{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:28:44Z","timestamp":1725488924148},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414568"},{"type":"electronic","value":"9783540445036"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44503-x_23","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:25:32Z","timestamp":1186892732000},"page":"361-374","source":"Crossref","is-referenced-by-count":4,"title":["Orthogonal Range Queries in OLAP"],"prefix":"10.1007","author":[{"given":"Chung","family":"Keung Poon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,12]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, A. Gupta, and S. Sarawagi. Modeling multidimensional databases. In 13th International Conference on Data Engineering. IEEE, 1997.","DOI":"10.1109\/ICDE.1997.581777"},{"key":"23_CR2","unstructured":"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\u2013201, 1977."},{"issue":"9","key":"23_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"J.L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509\u2013517, 1975.","journal-title":"Communications of the ACM"},{"issue":"4","key":"23_CR4","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J.L. Bentley","year":"1980","unstructured":"J.L. Bentley. Multidimensional divide-and-conquer. Communications of the ACM, 23(4):214\u2013228, April 1980.","journal-title":"Communications of the ACM"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF00263991","volume":"13","author":"J.L. Bentley","year":"1980","unstructured":"J.L. Bentley and H.A. Maurer. Efficient worst-case data structures for range searching. Acta Informatica, 13:155\u2013168, 1980.","journal-title":"Acta Informatica"},{"issue":"4","key":"23_CR6","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0210056","volume":"10","author":"A. Bolour","year":"1981","unstructured":"A. Bolour. Optimal retrival algorithms for small region queries. SIAM Journal on Computing, 10(4):721\u2013741, November 1981.","journal-title":"SIAM Journal on Computing"},{"key":"23_CR7","unstructured":"C.Y. Chan and Yannis E. Ioannidis. Hierarchical prefix cubes for range-sum queries. In Proceedings of ACM International Conference on Very Large Data Bases, pages 675\u2013686, 1999."},{"issue":"3","key":"23_CR8","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"Bernard Chazelle","year":"1986","unstructured":"Bernard Chazelle. Filtering search: A new approach to query-answering. SIAM Journal on Computing, 15(3):703\u2013724, August 1986.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"23_CR9","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"Bernard Chazelle","year":"1988","unstructured":"Bernard Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing, 17(3):427\u2013462, June 1988.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"23_CR10","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/77600.77614","volume":"37","author":"Bernard Chazelle","year":"1990","unstructured":"Bernard Chazelle. Lower bounds for orthogonal range searching: I. the reporting case. Journal of the ACM, 37(2):200\u2013212, April 1990.","journal-title":"Journal of the ACM"},{"issue":"3","key":"23_CR11","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1145\/79147.79149","volume":"37","author":"Bernard Chazelle","year":"1990","unstructured":"Bernard Chazelle. Lower bounds for orthogonal range searching: II. the arithmetic model. Journal of the ACM, 37(3):439\u2013463, July 1990.","journal-title":"Journal of the ACM"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Bernard Chazelle and Burton Rosenberg. Computing partial sums in multidimensional arrays. In 5th Annual Symposium on Computational Geometry, pages 131\u2013139, 1989.","DOI":"10.1145\/73833.73848"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"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\u201999), 1999.","DOI":"10.1007\/3-540-48309-8_71"},{"key":"23_CR14","unstructured":"E.F. Codd. Providing OLAP (on-line analytical processing) to user-analysts: an IT mandate. Technical report, E.F. Codd and Associates, 1993."},{"key":"23_CR15","unstructured":"The OLAP Council. MD-API the OLAP application program interface version 0.5 specification. Technical report, September 1996."},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R.A. Finkel","year":"1974","unstructured":"R.A. Finkel and J.L. Bentley. Quad trees: A data structure for retrievel on composite keys. Acta Informatica, 4:1\u20139, 1974.","journal-title":"Acta Informatica"},{"issue":"4","key":"23_CR17","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1145\/322276.322281","volume":"28","author":"M. Fredman","year":"1981","unstructured":"Michael Fredman. A lower bound on the complexity of orthogonal range queries. Journal of the ACM, 28(4):696\u2013705, 1981.","journal-title":"Journal of the ACM"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013335. IEEE, 1999.","DOI":"10.1109\/ICDE.1999.754948"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"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\u2013159. IEEE, 1996.","DOI":"10.1109\/ICDE.1996.492099"},{"issue":"2","key":"23_CR20","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"Dov Harel and Robert Endre Tarjan","year":"1984","unstructured":"Dov Harel and Robert Endre Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338\u2013355, May 1984.","journal-title":"SIAM Journal on Computing"},{"key":"23_CR21","unstructured":"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."},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, and Ramakrishnan Srikant. Range queries in olap data cubes. In ACM SIGMOD Conference on the Management of Data, pages 73\u201388, 1997.","DOI":"10.1145\/253262.253274"},{"issue":"12","key":"23_CR23","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1109\/12.737680","volume":"47","author":"H. Ching-Tien","year":"1998","unstructured":"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\u20131340, 1998.","journal-title":"IEEE Transactions on Computers"},{"key":"23_CR24","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00263763","volume":"9","author":"D.T. Lee","year":"1977","unstructured":"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\u201329, 1977.","journal-title":"Acta Informatica"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1016\/S0020-0190(98)00128-8"},{"issue":"4","key":"23_CR26","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Jean Vuillemin. A unifying look at data structures. Communications of the ACM, 23(4):229\u2013239, 1980.","journal-title":"Communications of the ACM"},{"issue":"1","key":"23_CR27","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/0214019","volume":"14","author":"D.E. Willard","year":"1985","unstructured":"D.E. Willard. New data structures for orthogonal queries. SIAM Journal on Computing, 14(1):232\u2013253, February 1985.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"23_CR28","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/3828.3839","volume":"32","author":"D.E. Willard","year":"1985","unstructured":"D.E. Willard and G.S. Lueker. Adding range restriction capability to dynamic data structures. Journal of the ACM, 32(3):597\u2013617, July 1985.","journal-title":"Journal of the ACM"},{"issue":"2","key":"23_CR29","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0214022","volume":"14","author":"Andrew Yao","year":"1985","unstructured":"Andrew Yao. On the complexity of maintaining partial sums. SIAM Journal on Computing, 14(2):277\u2013288, May 1985.","journal-title":"SIAM Journal on Computing"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"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\u201999), pages 338\u2013349, 1999.","DOI":"10.1007\/3-540-48912-6_45"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44503-X_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:39:29Z","timestamp":1556753969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44503-X_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540414568","9783540445036"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-44503-x_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}