Orthogonal Range Queries in OLAP.

@inproceedings{DBLP:conf/icdt/Poon01,
  author    = {Chung Keung Poon},
  editor    = {Jan Van den Bussche and
               Victor Vianu},
  title     = {Orthogonal Range Queries in OLAP},
  booktitle = {Database Theory - ICDT 2001, 8th International Conference, London,
               UK, January 4-6, 2001, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1973},
  year      = {2001},
  isbn      = {3-540-41456-8},
  pages     = {361-374},
  ee        = {db/conf/icdt/Poon01.html, http://link.springer.de/link/service/series/0558/bibs/1973/19730361.htm},
  crossref  = {DBLP:conf/icdt/2001},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Online Edition: Springer LINK

References

[1]

Rakesh Agrawal, Ashish Gupta, Sunita Sarawagi: Modeling Multidimensional Databases. ICDE 1997: 232-243 BibTeX

[2]

...

[3]

Jon Louis Bentley: Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517(1975) BibTeX

[4]

Jon Louis Bentley: Multidimensional Divide-and-Conquer. Commun. ACM 23(4): 214-229(1980) BibTeX

[5]

Jon Louis Bentley, Hermann A. Maurer: Efficient Worst-Case Data Structures for Range Searching. Acta Inf. 13: 155-168(1980) BibTeX

[6]

Azad Bolour: Optimal Retrieval Algorithms for Small Region Queries. SIAM J. Comput. 10(4): 721-741(1981) BibTeX

[7]

Chee Yong Chan, Yannis E. Ioannidis: Hierarchical Prefix Cubes for Range-Sum Queries. VLDB 1999: 675-686 BibTeX

[8]

Bernard Chazelle: Filtering Search: A New Approach to Query-Answering. SIAM J. Comput. 15(3): 703-724(1986) BibTeX

[9]

Bernard Chazelle: A Functional Approach to Data Structures and Its Use in Multidimensional Searching. SIAM J. Comput. 17(3): 427-462(1988) BibTeX

[10]

Bernard Chazelle: Lower Bounds for Orthogonal Range Searching: I. The Reporting Case. J. ACM 37(2): 200-212(1990) BibTeX

[11]

Bernard Chazelle: Lower Bounds for Orthogonal Range Searching II. The Arithmetic Model. J. ACM 37(3): 439-463(1990) BibTeX

[12]

Bernard Chazelle, Burton Rosenberg: Computing Partial Sums in Multidimensional Arrays. Symposium on Computational Geometry 1989: 131-139 BibTeX

[13]

David Wai-Lok Cheung, Bo Zhou, Ben Kao, Kan Hu, Sau Dan Lee: DROLAP - A Dense-Region Based Approach to On-Line Analytical Processing. DEXA 1999: 761-770 BibTeX

[14]

...

[15]

...

[16]

Raphael A. Finkel, Jon Louis Bentley: Quad Trees: A Data Structure for Retrieval on Composite Keys. Acta Inf. 4: 1-9(1974) BibTeX

[17]

Michael L. Fredman: A Lower Bound on the Complexity of Orthogonal Range Queries. J. ACM 28(4): 696-705(1981) BibTeX

[18]

Steven Geffner, Divyakant Agrawal, Amr El Abbadi, Terence R. Smith: Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes. ICDE 1999: 328-335 BibTeX

[19]

Jim Gray, Adam Bosworth, Andrew Layman, Hamid Pirahesh: Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total. ICDE 1996: 152-159 BibTeX

[20]

Dov Harel, Robert Endre Tarjan: Fast Algorithms for Finding Nearest Common Ancestors. SIAM J. Comput. 13(2): 338-355(1984) BibTeX

[21]

...

[22]

Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ramakrishnan Srikant: Range Queries in OLAP Data Cubes. SIGMOD Conference 1997: 73-88 BibTeX

[23]

Ching-Tien Ho, Jehoshua Bruck, Rakesh Agrawal: Partial-Sum Queries in OLAP Data Cubes Using Covering Codes. IEEE Trans. Computers 47(12): 1326-1340(1998) BibTeX

[24]

D. T. Lee, C. K. Wong: Worst-Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees. Acta Inf. 9: 23-29(1977) BibTeX

[25]

Kothuri Venkata Ravi Kanth, Ambuj K. Singh: Efficient Dynamic Range Searching Using Data Replication. Inf. Process. Lett. 68(2): 97-105(1998) BibTeX

[26]

Jean Vuillemin: A Unifying Look at Data Structures. Commun. ACM 23(4): 229-239(1980) BibTeX

[27]

Dan E. Willard: New Data Structures for Orthogonal Range Queries. SIAM J. Comput. 14(1): 232-253(1985) BibTeX

[28]

Dan E. Willard, George S. Lueker: Adding Range Restriction Capability to Dynamic Data Structures. J. ACM 32(3): 597-617(1985) BibTeX

[29]

Andrew Chi-Chih Yao: On the Complexity of Maintaining Partial Sums. SIAM J. Comput. 14(2): 277-288(1985) BibTeX

[30]

Bo Zhou, David Wai-Lok Cheung, Ben Kao: A Fast Algorithm for Density-Based Clustering in Large Database. PAKDD 1999: 338-349 BibTeX