Aggregate Aware Caching for Multi-dimensional Queries

  • Prasad M. Deshpande
  • Jeffrey F. Naughton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1777)

Abstract

To date, work on caching for OLAP workloads has focussed on using cached results from a previous query as the answer to another query. This strategy is effective when the query stream exhibits a high degree of locality. It unfortunately misses the dramatic performance improvements obtainable when the answer to a query, while not immediately available in the cache, can be computed from data in the cache. In this paper, we consider the common subcase of answering queries by aggregating data in the cache. In order to use aggregation in the cache, one must solve two subproblems: (1) determining when it is possible to answer a query by aggregating data in the cache, and (2) determining the fastest path for this aggregation, since there can be many. We present two strategies— a naive one and a Virtual Count based strategy. The virtual count based method finds if a query is computable from the cache almost instantaneously, with a small overhead of maintaining the summary state of the cache. The algorithm also maintains cost-based information that can be used to figure out the best possible option for computing a query result from the cache. Experiments with our implementation show that aggregation in the cache leads to substantial performance improvement. The virtual count based methods further improve the performance compared to the naive approaches, in terms of cache lookup and aggregation times.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AAD+96. S. Agarwal, R. Agrawal, P.M. Deshpande, A. Gupta, J.F. Naughton, R. Ramakrishnan, S. Sarawagi. On the Computation of Multidimensional Aggregates, Proc. of the 22nd Int. VLDB Conf., 506–521, 1996.Google Scholar
  2. APB. The Analytical Processing Benchmark available at http://www.olapcouncil.org/research/bmarkly.htm
  3. DFJST. S. Dar, M. J. Franklin, B. T. Jonsson, D. Srivastava, M. Tan. Semantic Data Caching and Replacement, Proc. of the 22nd Int. VLDB Conf., 1996.Google Scholar
  4. DRSN98. P. M. Deshpande, K. Ramasamy, A. Shukla, J. F. Naughton. Caching Multidimensional Queries Using Chunks, Proc of ACM SIGMOD, 259–270, 1998.Google Scholar
  5. D99. P. M. Deshpande. Efficient Database Support for OLAP Queries, Doctoral Dissertation, University of Wisconsin, Madison., 1999.Google Scholar
  6. HRU96. V. Harinarayanan, A. Rajaraman, J.D. Ullman. Implementing Data Cubes Efficiently, Proc. of ACM SIGMOD, 205–227, 1996.Google Scholar
  7. KR99. Y. Kotidis, N. Roussopoulos. DynaMat: A Dynamic View Management System for Data Warehouses Proc. of ACM SIGMOD, 371–382, 1999.Google Scholar
  8. RK96. R. Kimball. The Data Warehouse Toolkit, John Wiley & Sons, 1996.Google Scholar
  9. RSC98. K. A. Ross, D. Srivastava, D. Chatziantoniou. Complex Aggregation at Multiple Granularities, Int. Conf. on Extending Database Technology, 263–277, 1998.Google Scholar
  10. SDJL96. D. Srivastava, S. Dar, H. V. Jagadish and A. Y. Levy. Answering Queries with Aggregation Using Views, Proc. of the 22nd Int. VLDB Conf., 1996.Google Scholar
  11. SDN98. A. Shukla, P.M. Deshpande, J.F. Naughton. Materialized View Selection for Multidimensional Datasets, Proc. of the 24th Int. VLDB Conf., 488–499, 1998.Google Scholar
  12. SLCJ98. J. R. Smith, C. Li, V. Castelli, A. Jhingran. Dynamic Assembly of Views in Data Cubes, Proc. of the 17th Sym. on PODS, 274–283, 1998.Google Scholar
  13. SSV. P. Scheuermann, J. Shim and R. Vingralek. WATCHMAN: A Data Warehouse Intelligent Cache Manager, Proc. of the 22nd Int. VLDB Conf., 1996.Google Scholar
  14. SS94. S. Sarawagi and M. Stonebraker. Efficient Organization of Large Multidimensional Arrays, Proc. of the 11th Int. Conf. on Data Engg., 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Prasad M. Deshpande
    • 1
  • Jeffrey F. Naughton
    • 1
  1. 1.University of WisconsinMadison

Personalised recommendations