ACM Home Page
Please provide us with feedback. Feedback
Caching multidimensional queries using chunks
Full text PdfPdf (1.55 MB)
Source International Conference on Management of Data archive
Proceedings of the 1998 ACM SIGMOD international conference on Management of data table of contents
Seattle, Washington, United States
Pages: 259 - 270  
Year of Publication: 1998
ISBN:0-89791-995-5
Also published in ...
Authors
Prasad M. Deshpande  University of Wisconsin, Madison
Karthikeyan Ramasamy  University of Wisconsin, Madison
Amit Shukla  University of Wisconsin, Madison
Jeffrey F. Naughton  University of Wisconsin, Madison
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 41,   Citation Count: 52
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/276304.276328
What is a DOI?

ABSTRACT

Caching has been proposed (and implemented) by OLAP systems in order to reduce response times for multidimensional queries. Previous work on such caching has considered table level caching and query level caching. Table level caching is more suitable for static schemes. On the other hand, query level caching can be used in dynamic schemes, but is too coarse for “large” query results. Query level caching has the further drawback for small query results in that it is only effective when a new query is subsumed by a previously cached query. In this paper, we propose caching small regions of the multidimensional space called “chunks”. Chunk-based caching allows fine granularity caching, and allows queries to partially reuse the results of previous queries with which they overlap. To facilitate the computation of chunks required by a query but missing from the cache, we propose a new organization for relational tables, which we call a “chunked file.” Our experiments show that for workloads that exhibit query locality, chunked caching combined with the chunked file organization performs better than query level caching. An unexpected benefit of the chunked file organization is that, due to its multidimensional clustering properties, it can significantly improve the performance of queries that “miss” the cache entirely as compared to traditional file organizations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
AAD+96
 
BPT97
 
DFJST
 
DKLP+94
 
Fell57
William Feller, An Introduction to Probability Theory and Its Applications, Vol. I, John Wiley & Sons, pp 241; 1957.
 
GBLP96
 
GHRU97
 
Gupt97
HRU96
OG95
OQ97
 
RJZN97
K. Ramasamy, Q. Jin, Y. Zhao and J. F. N aughton. Bit-Map Indices: Implementation Issues and Performance Results. Working Paper.
 
RK96
R. Kimball. The Data Warehouse Toolkit, John Wiley & Sons, 1996.
 
SDJL96
 
SDN
A. Shukla, P.M. Deshpande, J.F. Naughton, Submitted for VLDB 1998.
 
SDNR96
 
SS94
 
SSV96
 
Ull96
J.D. Ullman, Efficient Implementation of Data Cubes Via Materialized Views A survey of the field for the 1996 KDD conference.
ZDN97

CITED BY  52

Collaborative Colleagues:
Prasad M. Deshpande: colleagues
Karthikeyan Ramasamy: colleagues
Amit Shukla: colleagues
Jeffrey F. Naughton: colleagues