{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:52:52Z","timestamp":1742399572617},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200642"},{"type":"electronic","value":"9783540396581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39658-1_4","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T19:24:30Z","timestamp":1279826670000},"page":"7-18","source":"Crossref","is-referenced-by-count":9,"title":["I\/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries"],"prefix":"10.1007","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"Lars","family":"Arge","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Yi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Agarwal, P.K., Arge, L., Brodal, G.S., Vitter, J.S.: I\/O-efficient dynamic point location in monotone planar subdivisions. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 1116\u20131127 (1999)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Arge, L., Govindarajan, S.: CRB-tree: An optimal indexing scheme for 2D aggregate queries. In: Proc. Intl. Conf. on Database Theory (2003)","DOI":"10.1007\/3-540-36285-1_10"},{"key":"4_CR3","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry","author":"P.K. Agarwal","year":"1999","unstructured":"Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, pp. 1\u201356. American Mathematical Society, Providence (1999)"},{"issue":"9","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The Input\/Output complexity of sorting and related problems. Comm. ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Comm. ACM"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-1-4615-0005-6_9","volume-title":"Handbook of Massive Data Sets","author":"L. Arge","year":"2002","unstructured":"Arge, L.: External memory data structures. In: Handbook of Massive Data Sets, pp. 313\u2013358. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Arge, L., Vahrenhold, J.: I\/O-efficient dynamic planar point location. In: Proc. ACM Symp. on Computational Geometry, pp. 191\u2013200 (2000)","DOI":"10.1145\/336154.336205"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Arge, L., Vitter, J.S.: Optimal dynamic interval management in external memory. In: Proc. IEEE Symp. on Foundations of Computer Science, pp. 560\u2013569 (1996)","DOI":"10.1109\/SFCS.1996.548515"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informatica\u00a01, 173\u2013189 (1972)","journal-title":"Acta Informatica"},{"issue":"6","key":"4_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L.: Multidimensional divide and conquer. Comm. ACM\u00a023(6), 214\u2013229 (1980)","journal-title":"Comm. ACM"},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput.\u00a017(3), 427\u2013462 (1988)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: The ubiquitous B-tree. ACM Computing Surveys\u00a011(2), 121\u2013137 (1979)","journal-title":"ACM Computing Surveys"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0190(81)90053-3","volume":"13","author":"H. Edelsbrunner","year":"1981","unstructured":"Edelsbrunner, H., Maurer, H.A.: On the intersection of orthogonal objects. Information Processing Letters\u00a013, 177\u2013181 (1981)","journal-title":"Information Processing Letters"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Computing Surveys\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Computing Surveys"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Grossi, R., Italiano, G.F.: Efficient cross-tree for external memory. In: External Memory Algorithms and Visualization. AMS, DIMACS series in Discrete Mathematics and Theoretical Computer Science, pp. 87\u2013106 (1999)","DOI":"10.1090\/dimacs\/050\/04"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-49257-7_17","volume-title":"Database Theory - ICDT\u201999","author":"K.V.R. Kanth","year":"1998","unstructured":"Kanth, K.V.R., Singh, A.K.: Optimal dynamic range searching in nonreplicating index structures. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 257\u2013276. Springer, Heidelberg (1998)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Molad, E., Tarjan, R.E.: Dynamic rectangular intersection with priorities. In: Proc. ACM Symp. on Theory of Computation, pp. 639\u2013648 (2003)","DOI":"10.1145\/780542.780635"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"The Design of Dynamic Data Structures","author":"M. Overmars","year":"1983","unstructured":"Overmars, M.: The Design of Dynamic Data Structures. LNCS, vol.\u00a0156. Springer, Heidelberg (1983)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Robinson, J.: The K-D-B tree: A search structure for large multidimensional dynamic indexes. In: Proc. SIGMOD Intl. Conf. on Management of Data, pp. 10\u201318 (1981)","DOI":"10.1145\/582318.582321"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Comm. ACM\u00a023, 229\u2013239 (1980)","journal-title":"Comm. ACM"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Yang, J., Widom, J.: Incremental computation and maintenance of temporal aggregates. In: Proc. IEEE Intl. Conf. on Data Engineering, pp. 51\u201360 (2001)","DOI":"10.1109\/ICDE.2001.914813"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39658-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T09:00:18Z","timestamp":1559293218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39658-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200642","9783540396581"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39658-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}