On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Solving implication problems in database applications
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Use of stale answers in database applications
ICIS '92 Proceedings of the thirteenth international conference on Information systems
Decision Support Systems - Special issue on WITS '92
Solving satisfiability and implication problems in database systems
ACM Transactions on Database Systems (TODS)
Communications of the ACM
Communications of the ACM
Building the Data Warehouse
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Decision Support in the Data Warehouse
Decision Support in the Data Warehouse
Updating Distributed Materialized Views
IEEE Transactions on Knowledge and Data Engineering
Automatic Knowledge Acquisition and Maintenance for Semantic Query Optimization
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
PROQID: partial restarts of queries in distributed databases
Proceedings of the 17th ACM conference on Information and knowledge management
| Hi-index | 0.00 |
The main function of a data warehouse is the separation of the decision layer from the operation layer so that users can invoke analysis, planning, and decision support applications without having to worry about constantly evolving operational databases. Such applications allow ad hoc queries for which no predefined reports exist. It is possible that an ad hoc query is submitted by different users or even by the same user at different times, requiring its repeated evaluations even though the contents of the warehouse have not changed in between. In this work, we propose an enhancement to a data warehouse structure, by building additional intelligence in the form of an adaptive and efficient query cache. The cache contains a list of recently executed ad hoc queries and their answers. Whenever possible, a new query is satisfied by answers already stored in the cache, thereby avoiding potentially large data scans. We discuss issues related to organizing and searching the query cache. In particular, we outline subsumption detection algorithms for a number of different situations that allow for quick decision on whether the cache can be used to evaluate an arriving query.