Abstract
A range query applies an aggregation operation over all selected cells of an OLAP data cube where selection is specified by the range of contiguous values for each dimension. Many works have focused on efficiently computing range sum or range max queries. Most of these algorithms use a uniformly partitioning scheme for the data cube. In this paper, we improve on query costs of some of these existing algorithms by noting two key areas. First, end-user range queries usually involve repetitive query patterns, which provide a variable sized partitioning scheme that can be used to partition the data cubes. Query costs are reduced because pre-computation is retrieved for entire partitions, rather than computed for a partial region in many partitions, which requires large amounts of cell accesses to the data cube. Second, data in the data cube can be arranged such that each partition is stored in as few physical storage blocks as possible, thus reducing the I/O costs for answering range queries.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Y. Chan and Y.E. Ioannidis, “Hierarchical cubes for range-sum queries”, in Proc. of the Intl. Conf. On Very Large Databases (VLDB), 1999, pp. 675–686.
S. Geffner, D. Agrawal, A. EI Abbadi, “The dynamic data cube”, in Proc. of EDBT, 2000.
S. Geffner, D. Agrawal, A.E. Abbadi, T. Smith. “Relative Prefix Sum: An Efficient Approach for Querying Dynamic OLAP Data Cubes”. In Proc. of the 15th ICDE, 1999.
C. T. Ho, R. Agrawal, R. Megiddo, R. Srikant, “Range Queriesin OLAP Data Cubes”, in Proc. of the Intl. ACM SIGMOD Conference, Tucson, Arizona, May 1997, pp. 73–88.
J. Gray, A. Bosworth, A. Layman, H. Pirahesh. “Data cube: A relational aggregation operator generating group-by, cross-tabs and sub-totals”. In Proc. of the 12th ICDE, 1996.
S. Y. Lee, T. W. Ling, H. G. Li, “Hierarchical Compact Cube for Range-Max”, in Proc. of the 26th VLDB Conference Cairo, Egypt, September 2000.
H. G. Li, T. W. Ling, S. Y. Lee, “Range-Max/Min Query in OLAP Data Cube”, in Proc. of the 11th DEXA Conference, Greenwich, 2000.
H. G. Li, T. W. Ling, S. Y. Lee, Z. X. Loh, “Range Sum Queriesin Dynamic OLAP Data Cubes”, CODAS’ 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ling, T.W., Low, W.C., Luo, Z.W., Lee, S.Y., Li, H.G. (2002). Variable Sized Partitions for Range Query Algorithms. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds) Database and Expert Systems Applications. DEXA 2002. Lecture Notes in Computer Science, vol 2453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46146-9_20
Download citation
DOI: https://doi.org/10.1007/3-540-46146-9_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44126-7
Online ISBN: 978-3-540-46146-3
eBook Packages: Springer Book Archive