Selecting and using views to compute aggregate queries
From MaRDI portal
Publication:657918
DOI10.1016/J.JCSS.2010.10.003zbMATH Open1234.68086OpenAlexW2020300116WikidataQ57434625 ScholiaQ57434625MaRDI QIDQ657918FDOQ657918
Authors: Foto N. Afrati, Rada Chirkova 
Publication date: 11 January 2012
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2010.10.003
Recommendations
Cites Work
- Title not available (Why is that?)
- Aggregate operators in constraint query languages
- On the content of materialized aggregate views
- Using views to generate efficient evaluation plans for queries
- Foundations of aggregation constraints
- A formal perspective on the view selection problem
- View selection for real conjunctive queries
Cited In (10)
- A formal perspective on the view selection problem
- Database Theory - ICDT 2005
- The View Selection Problem for Regular Path Queries
- Time complexity of page filling algorithms in materialized aggregate list (MAL) and MAL/TRIGG materialization cost
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views
- Selecting and materializing horizontally partitioned warehouse views
- Using views to generate efficient evaluation plans for queries
- On the content of materialized aggregate views
- Title not available (Why is that?)
- Sharing queries with nonequivalent user-defined aggregate functions
Uses Software
This page was built for publication: Selecting and using views to compute aggregate queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657918)
