Query optimization by using derivability in a data warehouse environment
Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
PROMISE: Predicting Query Behavior to Enable Predictive Caching Strategies for OLAP Systems
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Aggregate view management in data warehouses
Handbook of massive data sets
Usability-based caching of query results in OLAP systems
Journal of Systems and Software
Demand-Driven Caching in Multiuser Environment
IEEE Transactions on Knowledge and Data Engineering
QPipe: a simultaneously pipelined relational query engine
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Extending the data warehouse for service provisioning data
Data & Knowledge Engineering - Special issue: ER 2003
Load balancing and data placement for multi-tiered database systems
Data & Knowledge Engineering
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
On-demand view materialization and indexing for network forensic analysis
NETB'07 Proceedings of the 3rd USENIX international workshop on Networking meets databases
High Performance Analytics with the R3-Cache
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Efficient index compression in DB2 LUW
Proceedings of the VLDB Endowment
Processing nested complex sequence pattern queries over event streams
Proceedings of the Seventh International Workshop on Data Management for Sensor Networks
Scaling up analytical queries with column-stores
Proceedings of the Sixth International Workshop on Testing Database Systems
Sharing data and work across concurrent analytical queries
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
The response time of DSS (Decision Support System) queries is typically several orders of magnitude higher than the response time of OLTP (OnLine Transaction Processing) queries. Since DSS queries are often submitted interactively, techniques for reducing their response time are becoming increasingly important. We argue that caching of query results is one such technique particularly well suited to the DSS environment. We have designed a query cache manager for such an environment. The cache manager can lookup query results from the cache either based on an exact query match or using a query split algorithm to efficiently find query results which subsume the submitted query. The cache manager dynamically maintains the cache content by deciding whether a newly generated query result should be admitted to the cache and if so, which query results should be evicted from the cache to free space for the new query result. The decisions are aimed at minimizing the query response time. The decisions are explicitly based on a cost function that considers the execution cost of each query, the size of each query result, the reference frequency to each result, the cost of maintenance of each result due to updates of the base tables, and the frequency of such updates. Experimental evaluation shows that our cache manager can improve performance on TPC-D like workloads.