Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Proof-tree transformation theorems and their applications
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimization of real conjunctive queries
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data model and query evaluation in global information systems
Journal of Intelligent Information Systems - Special issue: networked information discovery and retrieval
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deciding equivalences among aggregate queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rewriting aggregate queries using views
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Materialized views: techniques, implementations, and applications
Materialized views: techniques, implementations, and applications
Answering complex SQL queries using automatic summary tables
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Optimizing queries using materialized views: a practical, scalable solution
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Orthogonal optimization of subqueries and aggregation
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Optimizing Queries with Aggregate Views
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Containment of Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Aggregate-Query Processing in Data Warehousing Environments
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Eager Aggregation and Lazy Aggregation
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Answering Queries with Aggregation Using Views
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Query Transformation for PSJ-Queries
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The GMAP: a versatile tool for physical data independence
The VLDB Journal — The International Journal on Very Large Data Bases
MiniCon: A scalable algorithm for answering queries using views
The VLDB Journal — The International Journal on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Answering Multidimensional Queries on Cubes Using Other Cubes
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
On the content of materialized aggregate views
Journal of Computer and System Sciences - Special issue on PODS 2000
On the equivalence and rewriting of aggregate queries
Acta Informatica
Equivalences among aggregate queries with negation
ACM Transactions on Computational Logic (TOCL)
Containment of aggregate queries
ACM SIGMOD Record
Selecting and using views to compute aggregate queries
ICDT'05 Proceedings of the 10th international conference on Database Theory
User-defined aggregate functions: bridging theory and practice
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Querying data sources that export infinite sets of views
Proceedings of the 12th International Conference on Database Theory
Proceedings of the 12th International Conference on Database Theory
On tree pattern query rewriting using views
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
Aggregate queries for discrete and continuous probabilistic XML
Proceedings of the 13th International Conference on Database Theory
Towards OLAP query reformulation in peer-to-peer data warehousing
DOLAP '10 Proceedings of the ACM 13th international workshop on Data warehousing and OLAP
Provenance for aggregate queries
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Capturing continuous data and answering aggregate queries in probabilistic XML
ACM Transactions on Database Systems (TODS)
OLAP query reformulation in peer-to-peer data warehousing
Information Systems
ACM Transactions on Database Systems (TODS)
RDF pattern matching using sortable views
Proceedings of the 21st ACM international conference on Information and knowledge management
| Hi-index | 0.01 |
The problem of rewriting aggregate queries using views is studied for conjunctive queries with arbitrary aggregation functions and built-in predicates. Two types of queries over views are introduced for rewriting aggregate queries: pure candidates and aggregate candidates. Pure candidates can be used to rewrite arbitrary aggregate queries. Aggregate candidates can be used to rewrite queries containing aggregate functions definable in terms of a commutative-semigroup operation. For both types of candidates (as well as for several relaxations of these candidates), the unfolding property holds. This allows characterizations for query equivalence to be used to determine whether a candidate is a rewriting of a query. The complexity of the rewriting-existence problem is also studied and upper and lower complexity bounds are given.