Range Queries in OLAP Data Cubes

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 26, Issue 2, 1997, Pages 73-88

  Ho, Ching Tien ^a   Agrawal, Rakesh ^a   Megiddo, Nimrod ^a   Srikant, Ramakrishnan ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA PROCESSING; DATA STRUCTURES; HIERARCHICAL SYSTEMS; ONLINE SYSTEMS; TREES (MATHEMATICS);

MULTIDIMENSIONAL DATABASES (MDDB); ON-LINE ANALYTICAL PROCESSING (OLAP);

QUERY LANGUAGES;

EID: 0031162982     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/253262.253274     Document Type: Article

References (38)

1. S. Agarwal, R. Agrawal, P.M. Deshpande, A. Gupta, J.F. Naughton, R. Ramakrishnan, and S. Sarawagi. On the computation of multidimensional aggregates. In Proc. of the 22nd Int'l Conference on Very Large Databases, pages 506-521, Mumbai (Bombay), India, September 1996.
2. Rakesh Agrawal, Ashish Gupta, and Sunita Sarawagi. Modeling multidimensional databases. In Proc. of the 13th Int'l Conference on Data Engineering, Birmingham, U.K., April 1997.
3. J.L. Bently. Multidimensional divide and conquer. Comm. ACM, 23(4):214-229, 1980.
4. J. L. Bently and J. H. Friedman. Data structures for range searching. Computing Surveys, 11(4), 1979.
5. N. Beckmann, H.-P. Kriegel, R. Schneider and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In Proc. of the ACM SIGMOD Conference on Management of Data, pages 322-331, Atlantic City, NJ, May 1990.
6. M. Berger and I. Regoutsos. An algorithm for point clustering and grid generation. IEEE Transactions on Systems, Man and Cybernetics, 21(5):1278-86, 1991.
7. Bernard Chazelle. Lower bounds for orthogonal range searching: Ii. the arithmetic model. J. ACM, 37(3):439-463, July 1990.
8. G.D. Cohen, A.C. Lobstein, and N.J.A Sloane. Further results on the covering radius of codes. IEEE Trans. Information Theory, IT-32(5):680-694, September 1986.
9. M.C. Chen and L.P. McNamee. The data model and access method of summary data management. IEEE Transactions on Knowledge and Data Engineering, 1(4):519-29, 1989.
10. E. F. Codd. Providing OLAP (on-line analytical processing) to user-analysts: An IT mandate. Technical report, E. F. Codd and Associates, 1993.
11. George Colliat. OLAP, relational, and multidimensional database systems. SIGMOD RECORD, September 1996.
12. D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121-138, June 1979.
13. Bernard Chazelle and Burton Rosenberg. Computing partial sums in multidimensional arrays. In Proc. of the ACM Symp. on Computational Geometry, pages 131-139, 1989.
14. S. Chaudhuri and K. Shim. Including group-by in query optimization. In Proc. of the 20th Int'l Conference on Very Large Databases, pages 354-366, Santiago, Chile, September 1994.
15. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tabs and subtotals. In Proc. of the 12th Int'l Conference on Data Engineering, pages 152-159, 1996.
16. A. Gupta, V. Harinarayan, and D. Quass. Aggregate-query processing in data warehousing environments. In Proceedings of the Eighth International Conference on Very Large Databases (VLDB), pages 358-369, Zurich, Switzerland, September 1995.
17. Himanshu Gupta, Venky Harinarayan, Anand Rajaraman, and Jeffrey D. Ullman. Index selection for OLAP. In Proc. of the 13th Int'l Conference on Data Engineering, Birmingham, U.K., April 1997.
18. Ching-Tien Ho, Jehoshua Bruck, and Rakesh Agrawal. Partial-sum queries in OLAP data cubes using covering codes. In Proc. of the 16th ACM Symposium on Principles of Database Systems, May 1997.
19. V. Harinarayan, A. Rajaraman, and J.D. Ullman. Implementing data cubes efficiently. In Proc. of the ACM SIGMOD Conference on Management of Data, June 1996.
20. IBM. DB2 SQL Reference for Common Servers Version 2, 1995.
21. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice Hall, 1988.
22. T. Johnson and D. Shasha. Hierarchically split cube forests for decision support: description and tuned design, 1996. Working Paper.
23. D. Lomet, editor. Special Issue on Materialized Views and Data Warehousing. IEEE Data Engineering Bulletin, 18(2), June 1995.
24. Kurt Mehlhorn. Data Structure and Algorithm 3: Multi-dimensional Searching and Computational Geometry. Springer-Verlag, 1984.
25. Z. Michalewicz. Statistical and Scientific Databases. Ellis Horwood, 1992.
26. L. Mitten. Branch and bound methods: General formulation and properties. Operations Research, 18:24-34, 1970.
27. The OLAP Council. MD-API the OLAP Application Program Interface Version 0.5 Specification, September 1996.
28. E.M. Reingold, J. Nievergelt, and N. Deo. Combinatorial Algorithms. Prentice-Hall, Englewood Cliffs. NJ, 1977.
29. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1989.
30. John Shafer, Rakesh Agrawal, and Manish Mehta. SPRINT: A scalable parallel classifier for data mining. In Proc. of the 22nd Int'l Conference on Very Large Databases, Bombay, India, September 1996.
31. P. Schroeter and J. Bigun. Hierarchical image segmentation by multi-dimensional clustering and orientation-adaptive boundary refinement. Pattern Recognition, 25(5):695-709, May 1995.
32. A. Shukla, P.M. Deshpande, J.F. Naughton, and K. Ramasamy. Storage estimation for multidimensional aggregates in the presence of hierarchies. In Proc. of the 22nd Int'l Conference on Very Large Databases, pages 522-531, Mumbai (Bombay), India, September 1996.
33. B. Salzberg and A. Reuter. Indexing for aggregation, 1996. Working Paper.
34. J. Srivastava, J.S.E. Tan, and V.Y. Lum. TB-SAM: An access method for efficient processing of statistical queries. IEEE Transactions on Knowledge and Data Engineering, 1(4), 1989.
35. P.M. Vaidya. Space-time tradeoffs for orthogonal range queries. In Proc. 17th Annual ACM Symp. on Theory of Comput., pages 169-174, 1985.
36. D.E. Willard and G.S. Lueker. Adding range restriction capability to dynamic data structures. J. ACM, 32(3):597-617, 1985.
37. Andrew Yao. On the complexity of maintaining partial sums. SIAM J. Computing, 14(2):277-288, May 1985.
38. W. P. Yan and P. Larson. Eager aggregation and lazy aggregation. In Proceedings of the Eighth International Conference on Very Large Databases (VLDB), pages 345-357, Zurich, Switzerland, September 1995.