{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T19:29:22Z","timestamp":1672255762886},"reference-count":37,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00741-7","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T12:20:43Z","timestamp":1046780443000},"page":"487-510","source":"Crossref","is-referenced-by-count":10,"title":["Dynamic orthogonal range queries in OLAP"],"prefix":"10.1016","volume":"296","author":[{"given":"Chung Keung","family":"Poon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00741-7_BIB1","series-title":"13th Internat. Conf. on Data Engineering, Birmingham, UK","first-page":"232","article-title":"Modeling multidimensional databases","author":"Agrawal","year":"1997"},{"key":"10.1016\/S0304-3975(02)00741-7_BIB2","doi-asserted-by":"crossref","unstructured":"Z. Aviad, E. Shamir, A direct dynamic solution to range search and related problems for product regions, in: 22nd Ann. Symp. on Foundations of Computer Science, IEEE, Nashville, TN, October 1981, New York, pp. 123\u2013126.","DOI":"10.1109\/SFCS.1981.5"},{"issue":"9","key":"10.1016\/S0304-3975(02)00741-7_BIB3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Comm. ACM"},{"issue":"4","key":"10.1016\/S0304-3975(02)00741-7_BIB4","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","article-title":"Multidimensional divide-and-conquer","volume":"23","author":"Bentley","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(02)00741-7_BIB5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF00263991","article-title":"Efficient worst-case data structures for range searching","volume":"13","author":"Bentley","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(02)00741-7_BIB6","series-title":"15th Allerton Conf. on Communications, Control and Computing","first-page":"193","article-title":"A problem in multivariate statistics","author":"Bentley","year":"1977"},{"issue":"4","key":"10.1016\/S0304-3975(02)00741-7_BIB7","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0210056","article-title":"Optimal retrieval algorithms for small region queries","volume":"10","author":"Bolour","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00741-7_BIB8","series-title":"Proc. 25th Internat. Conf. on Very Large Data Bases, Edinburgh, UK","first-page":"675","article-title":"Hierarchical prefix cubes for range-sum queries","author":"Chan","year":"1999"},{"issue":"3","key":"10.1016\/S0304-3975(02)00741-7_BIB9","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","article-title":"Filtering search","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(02)00741-7_BIB10","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1137\/0217026","article-title":"A functional approach to data structures and its use in multidimensional searching","volume":"17","author":"Chazelle","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(02)00741-7_BIB11","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/77600.77614","article-title":"Lower bounds for orthogonal range searching","volume":"37","author":"Chazelle","year":"1990","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0304-3975(02)00741-7_BIB12","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1145\/79147.79149","article-title":"Lower bounds for orthogonal range searching","volume":"37","author":"Chazelle","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00741-7_BIB13","series-title":"5th Ann. Symp. on Computational Geometry, Saarbruchen, Germany","first-page":"131","article-title":"Computing partial sums in multidimensional arrays","author":"Chazelle","year":"1989"},{"key":"10.1016\/S0304-3975(02)00741-7_BIB14","first-page":"761","article-title":"DROLAP\u2014a dense-region based approach to on-line analytical processing","volume":"Vol. 1677","author":"Cheung","year":"1999"},{"key":"10.1016\/S0304-3975(02)00741-7_BIB15","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":"10.1016\/S0304-3975(02)00741-7_BIB16","unstructured":"The OLAP Council, MD-API the OLAP application program interface version 0.5 specification, Technical Report, September 1996."},{"key":"10.1016\/S0304-3975(02)00741-7_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","article-title":"Quad trees","volume":"4","author":"Finkel","year":"1974","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/S0304-3975(02)00741-7_BIB18","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1145\/322276.322281","article-title":"A lower bound on the complexity of orthogonal range queries","volume":"28","author":"Fredman","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00741-7_BIB19","series-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing, Washington, DC","first-page":"135","article-title":"Scaling and related techniques for goemetry problems","author":"Gabow","year":"1984"},{"key":"10.1016\/S0304-3975(02)00741-7_BIB20","series-title":"15th Internat. Conf. on Data Engineering, Sydney, Australia New York","first-page":"328","article-title":"Relative prefix sums","author":"Geffner","year":"1999"},{"key":"10.1016\/S0304-3975(02)00741-7_BIB21","series-title":"12th Internat. Conf. on Data Engineering, New Orleans, LA","first-page":"152","article-title":"Data cube","author":"Gray","year":"1996"},{"issue":"2","key":"10.1016\/S0304-3975(02)00741-7_BIB22","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00741-7_BIB23","unstructured":"Ching-Tien Ho, R. Agrawal, N. Meggido, Jyh-Jong Tsay, Techniques for speeding up rang-max queries, Technical Report, IBM Research Report, April 1997."},{"key":"10.1016\/S0304-3975(02)00741-7_BIB24","doi-asserted-by":"crossref","unstructured":"Ching-Tien Ho, R. Agrawal, N. Megiddo, Ramakrishnan Srikant, Range queries in OLAP data cubes, in: ACM SIGMOD Conf. on the Management of Data, Tuscon, AZ, 1997, pp. 73\u201388.","DOI":"10.1145\/253262.253274"},{"issue":"12","key":"10.1016\/S0304-3975(02)00741-7_BIB25","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1109\/12.737680","article-title":"Partial-sum queries in OLAP data cubes using covering codes","volume":"47","author":"Ho","year":"1998","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(02)00741-7_BIB26","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF00263763","article-title":"Worst-case analysis for region and partial region searches in multi-dimensional binary search trees and balanced quad trees","volume":"9","author":"Lee","year":"1977","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(02)00741-7_BIB27","series-title":"Proc. 26th Internat. Conf. on Very Large Data Bases, Cairo, Egypt","first-page":"232","article-title":"Hierarchical compact cube for range-max queries","author":"Sin Yeung Lee","year":"2000"},{"key":"10.1016\/S0304-3975(02)00741-7_BIB28","unstructured":"Chung Keung Poon, Orthogonal range queries in OLAP, in: 8th Internat. Conf. on Database Theory, Lecture Notes in Computer Science, Vol. 1973, London, Britain, Springer, Berlin, January 2001, pp. 361\u2013374."},{"key":"10.1016\/S0304-3975(02)00741-7_BIB29","doi-asserted-by":"crossref","unstructured":"K.V. Ravi Kanth, A.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"},{"key":"10.1016\/S0304-3975(02)00741-7_BIB30","unstructured":"M. Riedewald, D. Agrawal, Amr El Abbadi, Flexible data cubes for online aggregation, in: 8th Internat. Conf. on Database Theory, Lecture Notes in Computer Science, Vol. 1973, London, Britain, Springer, Berlin, January 2001, pp. 159\u2013173."},{"key":"10.1016\/S0304-3975(02)00741-7_BIB31","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/S0304-3975(02)00741-7_BIB32","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/358841.358852","article-title":"A unifying look at data structures","volume":"23","author":"Vuillemin","year":"1980","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/S0304-3975(02)00741-7_BIB33","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/0214019","article-title":"New data structures for orthogonal queries","volume":"14","author":"Willard","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(02)00741-7_BIB34","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/3828.3839","article-title":"Adding range restriction capability to dynamic data structures","volume":"32","author":"Willard","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00741-7_BIB35","doi-asserted-by":"crossref","unstructured":"A. Yao, Space-time tradeoff for answering range queries, in: Proc. 14th Ann. ACM Symp. on Theory of Computing, San Francisco, CA, 1982, pp. 128\u2013136.","DOI":"10.1145\/800070.802185"},{"issue":"2","key":"10.1016\/S0304-3975(02)00741-7_BIB36","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0214022","article-title":"On the complexity of maintaining partial sums","volume":"14","author":"Yao","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00741-7_BIB37","first-page":"338","article-title":"A fast algorithm for density-based clustering in large database","volume":"Vol. 1574","author":"Zhou","year":"1999"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502007417?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502007417?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T04:11:14Z","timestamp":1583986274000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502007417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502007417"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00741-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}