{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T05:11:21Z","timestamp":1737263481719,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_12","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:42:44Z","timestamp":1183563764000},"page":"88-100","source":"Crossref","is-referenced-by-count":16,"title":["Implementing I\/O-efficient Data Structures Using TPIE"],"prefix":"10.1007","author":[{"given":"Lars","family":"Arge","sequence":"first","affiliation":[]},{"given":"Octavian","family":"Procopiuc","sequence":"additional","affiliation":[]},{"given":"Jeffrey","family":"Scott Vitter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"unstructured":"P.K. Agarwal, L. Arge, and S. Govindarajan. CRB-tree: An optimal indexing scheme for 2d aggregate queries. Manuscript, 2002.","key":"12_CR1"},{"doi-asserted-by":"crossref","unstructured":"P.K. Agarwal, L. Arge, O. Procopiuc, and J. S. Vitter. A framework for index bulk loading and dynamization. In Proc. 28th Intl. Colloq. Automata, Languages and Programming (ICALP), 2001.","key":"12_CR2","DOI":"10.1007\/3-540-48224-5_10"},{"issue":"9","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal and J. S. Vitter. The Input\/Output complexity of sorting and related problems. Communications of the ACM, 31(9):1116\u20131127, 1988.","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"L. Arge. External memory data structures. In J. Abello, P.M. Pardalos, and M.G.C. Resende, editors, Handbook of Massive Data Sets, pages 313\u2013358. Kluwer Academic Publishers, 2002.","key":"12_CR4","DOI":"10.1007\/978-1-4615-0005-6_9"},{"doi-asserted-by":"crossref","unstructured":"L. Arge, A. Danner, and S.-M. Teh. I\/O-efficient point location using persistent B-trees. Manuscript, 2002.","key":"12_CR5","DOI":"10.1145\/996546.996549"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s00453-001-0107-6","volume":"33","author":"L. Arge","year":"2002","unstructured":"L. Arge, K. H. Hinrichs, J. Vahrenhold, and J. S. Vitter. Efficient bulk operations on dynamic R-trees. Algorithmica, 33(1):104\u2013128, 2002.","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold, and J. S. Vitter. A unified approach for indexed and non-indexed spatial joins. In Proc. Conference on Extending Database Technology, pages 413\u2013429, 1999.","key":"12_CR7","DOI":"10.1007\/3-540-46439-5_29"},{"doi-asserted-by":"crossref","unstructured":"L.A. Arge and J. Vahrenhold. I\/O-efficient dynamic planar point location. In Proc. ACM Symp. Computational Geometry, 2000.","key":"12_CR8","DOI":"10.1145\/336154.336205"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s007780050028","volume":"5","author":"B. Becker","year":"1996","unstructured":"B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion B-tree. VLDB Journal, 5(4):264\u2013275, 1996.","journal-title":"VLDB Journal"},{"doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. SIGMOD Intl. Conf. on Management of Data, pages 322\u2013331, 1990.","key":"12_CR10","DOI":"10.1145\/93597.98741"},{"issue":"9","key":"12_CR11","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. Commun. ACM, 18(9):509\u2013517, Sept. 1975.","journal-title":"Commun. ACM"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"D. Comer. The ubiquitous B-tree. ACM Comput. Surv., 11:121\u2013137, 1979.","journal-title":"ACM Comput. Surv."},{"doi-asserted-by":"crossref","unstructured":"A. Crauser and K. Mehlhorn. LEDA-SM: Extending LEDA to secondary memory. In Proc. Workshop on Algorithm Engineering, 1999.","key":"12_CR13","DOI":"10.1007\/3-540-48318-7_19"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00288968","volume":"17","author":"S. Huddleston","year":"1982","unstructured":"S. Huddleston and K. Mehlhorn. A new data structure for representing sorted lists. Acta Informatica, 17:157\u2013184, 1982.","journal-title":"Acta Informatica"},{"key":"12_CR15","volume-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"2000","unstructured":"K. Mehlhorn and S. N\u00e4her. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000."},{"unstructured":"M.H. Overmars. The Design of Dynamic Data Structures, volume 156 of Lecture Notes Comput. Sci. Springer-Verlag, Heidelberg, West Germany, 1983.","key":"12_CR16"},{"doi-asserted-by":"crossref","unstructured":"O. Procopiuc, P.K. Agarwal, L. Arge, and J. S. Vitter. Bkd-tree: A dynamic scalable kd-tree. Manuscript, 2002.","key":"12_CR17","DOI":"10.1007\/978-3-540-45072-6_4"},{"doi-asserted-by":"crossref","unstructured":"J.T. Robinson. The K-D-B-tree: A search structure for large multidimensional dynamic indexes. In Proc. SIGMOD Intl. Conf. on Management of Data, pages 10\u201318, 1981.","key":"12_CR18","DOI":"10.1145\/582318.582321"},{"doi-asserted-by":"crossref","unstructured":"D.E. Vengro. and J. S. Vitter. Supporting I\/O-efficient scientific computation in TPIE. In Proc. IEEE Symp. on Parallel and Distributed Computing, pages 74\u201377, 1995.","key":"12_CR19","DOI":"10.1109\/SPDP.1995.530667"},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J. S. Vitter","year":"2001","unstructured":"J. S. Vitter. External memory algorithms and data structures: Dealing with MASSIVE data. ACM Computing Surveys, 33(2):209\u2013271, 2001.","journal-title":"ACM Computing Surveys"},{"issue":"2\u20133","key":"12_CR21","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J. S. Vitter","year":"1994","unstructured":"J. S. Vitter and E.A. M. Shriver. Algorithms for parallel memory, I: Two-level memories. Algorithmica, 12(2\u20133):110\u2013147, 1994.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T04:47:30Z","timestamp":1737175650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}