Orthogonal range queries in OLAP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1973, Issue , 2001, Pages 361-374

  Poon, Chung Keung ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; COMPUTATION THEORY; DATA STRUCTURES; QUERY PROCESSING;

CONTROLLED PARAMETER; DATA CUBE; GROUP OPERATIONS; MAX FUNCTIONS; MAX-QUERY; QUERY TIME; RANGE QUERY; SEMI-GROUP;

DIGITAL STORAGE;

EID: 84949476327     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44503-x_23     Document Type: Conference Paper

References (30)

1. R. Agrawal, A. Gupta, and S. Sarawagi. Modeling multidimensional databases. In 13th International Conference on Data Engineering. IEEE, 1997.
2. J. L. Bentley and M. I. Shamos. A problem in multivariate statistics: algorithms, data structure and applications. In 15th Allerton Conference on Communications, Control and Computing,pages 193-201, 1977.
3. J.L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509-517, 1975.
4. J.L. Bentley. Multidimensional divide-and-conquer. Communications of the ACM, 23(4):214-228, April 1980.
5. J.L. Bentley and H.A. Maurer. Efficient worst-case data structures for range searching. ActaInformatica, 13:155-168, 1980.
6. A. Bolour. Optimal retrival algorithms for small region queries. SIAM Journal on Computing, 10(4):721-741, November 1981.
7. C.Y. Chan and Yannis E. Ioannidis. Hierarchical prefix cubes for range-sum queries. In Proceedings ofACM International Conference on Very Large Data Bases, pages 675-686, 1999.
8. Bernard Chazelle. Filtering search: A new approach to query-answering. SIAM Journal on Computing, 15(3):703-724, August 1986.
9. Bernard Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing, 17(3):427-462, June 1988.
10. Bernard Chazelle. Lower bounds for orthogonal range searching: I. the reporting case. Journal of the ACM, 37(2):200-212, April 1990.
11. Bernard Chazelle. Lower bounds for orthogonal range searching: II. the arithmetic model. Journal of the ACM, 37(3):439-463, July 1990.
12. Bernard Chazelle and Burton Rosenberg. Computing partial sums in multidimensional arrays. In 5th Annual Symposium on Computational Geometry, pages 131-139, 1989.
13. D.W. Cheung, B. Zhou, B. Kao, K. Hu, and S.D. Lee. DROLAP - a dense-region based approach to on-line analytical processing. In 10th International Conference on Database and Expert Systems Applications (DEXA'99), 1999.
14. E.F. Codd. Providing OLAP (on-line analytical processing) to user-analysts: an IT mandate. Technical report, E.F. Codd and Associates, 1993.
15. The OLAP Council. MD-API the OLAP application program interface version 0.5 specification. Technical report, September 1996.
16. R.A. Finkel and J.L. Bentley. Quad trees: A data structure for retrievel on composite keys. ActaInformatica, 4:1-9, 1974.
17. Michael Fredman. A lower bound on the complexity of orthogonal range queries. Journal of the ACM, 28(4):696-705, 1981.
18. S. Geffner, D. Agrawal, A. El Abbadi, and T. Smith. Relative prefix sums: An efficient approach for querying dynamic olap data cubes. In 15th International Conference on Data Engineering, pages 328-335. IEEE, 1999.
19. Jim Gray, Adam Bosworth, Andrew Layman, and Hamid Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In 12th International Conference on Data Engineering, pages 152-159. IEEE, 1996.
20. Dov Harel and Robert Endre Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338-355, May 1984.
21. Ching-Tien Ho, Rakesh Agrawal, Nimrod Meggido, and Jyh-Jong Tsay. Techniques for speeding up rang-max queries. Technical report, IEEE Research Report, April 1997.
22. Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, and Ramakrishnan Srikant. Range queries in olap data cubes. In ACM SIGMOD Conference on the Managementof Data, pages 73-88, 1997.
23. Ching-Tien Ho, Jehoshua Bruck, and Rakesh Agrawal. Partial-sum queries in olap data cubes using covering codes. IEEE Transactions on Computers, 47(12):1326-1340, 1998.
24. D.T. Lee and C.K. Wong. Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees. Acta Informatica, 9:23-29, 1977.
25. K.V. Ravi Kanth and Ambuj K. Singh. Efficient dynamic range searching using data replication. Technical Report TRCS97-12, University of California at Santa barbara, 1997.
26. Jean Vuillemin. A unifying look at data structures. Communications of the ACM, 23(4):229-239, 1980.
27. D.E. Willard. New data structures for orthogonal queries. SIAM Journal on Computing, 14(1):232-253, February 1985.
28. D.E. Willard and G.S. Lueker. Adding range restriction capability to dynamic data structures. Journal of the ACM, 32(3):597-617, July 1985.
29. Andrew Yao. On the complexity of maintaining partial sums. SIAM Journal on Computing, 14(2):277-288, May 1985.
30. Bo Zhou, David W. Cheung, and Ben Kao. A fast algorithm for density-based clustering in large database. In Methodologies for Knowledge Discovery and Data Mining (PAKDD'99), pages 338-349, 1999.