ACM Transactions on Database Systems (TODS)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A universal-scheme approach to statistical databases containing homogeneous summary tables
ACM Transactions on Database Systems (TODS)
View maintenance in mobile computing
ACM SIGMOD Record
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Research problems in data warehousing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
The aggregate data problem: a system for their definition and management
ACM SIGMOD Record
Maintenance of data cubes and summary tables in a warehouse
SIGMOD '97 Proceedings of the 1997 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
OLAP and statistical databases: similarities and differences
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
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
Bottom-up computation of sparse and Iceberg CUBE
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Sleepers and workaholics: caching strategies in mobile environments (extended version)
The VLDB Journal — The International Journal on Very Large Data Bases
Modeling Multidimensional Databases
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Optimizing Queries with Materialized Views
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Computing Iceberg Queries Efficiently
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
On the Computation of Multidimensional Aggregates
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
Computational Issues Connected with the Protection of Sensitive Statistics by Auditing Sum Queries
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Theory of answering queries using views
ACM SIGMOD Record
Managing periodically updated data in relational databases: a stochastic modeling approach
Journal of the ACM (JACM)
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimizing View Sets without Losing Query-Answering Power
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Containment of Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Automatic Aggregation Using Explicit Metadata
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Querying multidimensional data
Multidimensional databases
Proceedings of the 13th international conference on World Wide Web
Views and queries: determinacy and rewriting
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
View-based query processing: On the relationship between rewriting, answering and losslessness
Theoretical Computer Science
Queries determined by views: pack your views
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semantic email: theory and applications
Web Semantics: Science, Services and Agents on the World Wide Web
Determinacy and query rewriting for conjunctive queries and views
Theoretical Computer Science
Determinacy and rewriting of conjunctive queries using views: a progress report
ICDT'07 Proceedings of the 11th international conference on Database Theory
View-based query processing: on the relationship between rewriting, answering and losslessness
ICDT'05 Proceedings of the 10th international conference on Database Theory
A taxonomy of inaccurate summaries and their management in OLAP systems
ER'05 Proceedings of the 24th international conference on Conceptual Modeling
Rewriting conjunctive queries determined by views
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
We consider the problem of answering queries using only materialized views. We first show that if the views subsume the query from the point of view of the information content, then the query can be answered using only the views, but the resulting query might be extremely inefficient. We then focus on aggregate views and queries over a single relation, which are fundamental in many applications such as data warehousing. We show that in this case, it is possible to guarantee that as soon as the views subsume the query, it can be completely rewritten in terms of the views in a simple query language. Our main contribution is the conception of various rewriting algorithms which run in polynomial time, and the proof of their completeness which relies on combinatorial arguments. Finally, we discuss the choice of materializing or not ratio views such as average and percentage, important for the design of materialized views. We show that it has an impact on the information content, which can be used to protect data, as well as on the maintenance of views.