Abstract
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is specified by ranges of continuous values for numeric dimensions. Much work has been done with one type of aggregations: SUM. But little work has been done with another type of aggregations: MAX/MIN besides the tree-based algorithm. In this paper, we propose a new method which partitions the given data cube, stores precomputed max/min over partitions and location of the max/min of the partitions. We also use some techniques to reduce the chance of accessing the original data cube when answering ad hoc queries at run time. The experiment results demonstrate that our method outperforms the tree-based algorithm.
This is a preview of subscription content, log in via an institution to check access.
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
R. Agrawal, A. Gupta. S. Sarawagi. Modeling multidimensional databases. In Proc. of the 13th Int’l Conference on Data Engineering, Birmingham, U.K., April 1997.
J. L. Bentley. Multidimensional divide and conquer. Comm. ACM, 23(4): 214–229, 1980.
C. Y. Chan, Yannis E. Ioannidis. Hierarchical Cubes for Range-Sum Queries. Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, 1999, pp 675–686.
E. F. Codd. Providing OLAP(on-line analytical processing) to user-analysts: an IT mandate. Technical report, E.F. Codd and Associates, 1993.
S. Geffner, D. Agrawal, A. EI Abbadi, T. Smith. Algorithms for the Relative Prefix Sum Approach to Range sum Queries in Data Cubes. University of California, Santa Barbara, Computer Science Technical Report TRCS99-01.
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 Int’l Conference on Data Engineering, pp 152–159, 1996.
V. Harinarayan, A. Rajaraman, J. D. Ullman. Implementing Data Cubes Effieciently. Proceedings of ACM SIGMOD 1996 International Conference on Management of Dat, Montreal, Canda, June 1996 pp205–216.
C. Ho, R. Agrawal, N. Megiddo, R. Srikant. Range Queries in OLAP Data Cubes. In Proc. of the ACM SIGMOD Conference on the Management of Data, pp 73–88, 1997.
S. Y. Lee, T. W. Ling, H. G. Li. Hierarchical Compact Cube for Range-Max. Proceedings of the 26th VLDB Conference Cairo, Egypt, September 2000.
L. Mitten. Branch and bound methods: General formulation and properties. Operations Research, 18:24–34, 1970.
The OLAP Concil. MD-API the OLAP Application Program Interface Version 0.5 Specification, September 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, HG., Ling, T.W., Lee, S.Y. (2000). Range-Max/Min Query in OLAP Data Cube. In: Ibrahim, M., Küng, J., Revell, N. (eds) Database and Expert Systems Applications. DEXA 2000. Lecture Notes in Computer Science, vol 1873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44469-6_44
Download citation
DOI: https://doi.org/10.1007/3-540-44469-6_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67978-3
Online ISBN: 978-3-540-44469-5
eBook Packages: Springer Book Archive