{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:13Z","timestamp":1775282293188,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602200","type":"print"},{"value":"9783540447474","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_78","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:53:03Z","timestamp":1330278783000},"page":"381-392","source":"Crossref","is-referenced-by-count":14,"title":["Topology B-trees and their applications"],"prefix":"10.1007","author":[{"given":"Paul","family":"Callahan","sequence":"first","affiliation":[]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"Kumar","family":"Ramaiyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"9","key":"33_CR1","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"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Lars Arge. The buffer tree: A new technique for optimal i\/o algorithms. In Proc. on Fourth Workshop on Algorithms and Data Structures, 1995.","DOI":"10.1007\/3-540-60220-8_74"},{"key":"33_CR3","unstructured":"S. Arya and D. M. Mount. Approximate nearest neighbor queries in fixed dimensions. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 271\u2013280, 1993."},{"key":"33_CR4","unstructured":"S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. In Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pages 573\u2013582, 1994."},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Sergei N. Bespamyatnikh. An optimal algorithm for closest pair maintenance. In Proceedings 11th Annual Symposium on Computational Geometry, 1995.","DOI":"10.1145\/220279.220296"},{"key":"33_CR6","unstructured":"P. B. Callahan and S. R. Kosaraju. Algorithms for dynamic closest pair and n-body potential fields. In Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, pages 263\u2013272, 1995."},{"key":"33_CR7","unstructured":"R. F. Cohen and R. Tamassia. Dynamic expression trees and their applications. In Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms, pages 52\u201361, 1991."},{"key":"33_CR8","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."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"G. N. Frederickson. Ambivalent data structures for dynamic 2-edge connectivity and k-smallest spanning trees. In Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci., pages 632\u2013641, 1991.","DOI":"10.1109\/SFCS.1991.185429"},{"key":"33_CR10","unstructured":"G. N. Frederickson. A data structure for dynamically maintaining rooted trees. In Proc. 4th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 175\u2013184, 1993."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Michael T. Goodrich, Jyh-Jong Tsay, Darren E. Vengroff, and Jeffrey Scott Vitter. External-memory computational geometry. In Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS 93), pages 714\u2013723, 1993.","DOI":"10.1109\/SFCS.1993.366816"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"O. Gunther and H.-J. Schek. Advances in spatial databases. In Proc. 2nd Symposium, SSD '91, volume 525 of Lecture Notes in Computer Science. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54414-3"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"P. C. Kanellakis, S. Ramaswamy, D. E. Vengroff, and J. S. Vitter. Indexing for data models with constraints and classes. In Proc. 12th ACM SIGACT-SIGMOD-SIGART Conf. Princ. Database Sys., pages 233\u2013243, 1993.","DOI":"10.1145\/153850.153884"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Robert Laurini and Derek Thompson. Fundamentals of Spatial Information Systems. A.P.I.C. Series. Academic Press, 1992.","DOI":"10.1016\/B978-0-08-092420-5.50014-1"},{"issue":"4","key":"33_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0020-0190(81)90101-0","volume":"12","author":"D. Maier","year":"1981","unstructured":"D. Maier and S. C. Salveter. Hysterical B-trees. Information Processing Letters, 12(4):199\u2013202, 1981.","journal-title":"Information Processing Letters"},{"issue":"3","key":"33_CR16","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0925-7721(92)90006-E","volume":"2","author":"J. Matou\u0161ek","year":"1992","unstructured":"J. Matou\u0161ek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2(3):169\u2013186, 1992.","journal-title":"Comput. Geom. Theory Appl."},{"key":"33_CR17","unstructured":"D. Mount and S. Arya. Approximate range searching. In Proc. 11th ACM Symp. on Computational Geometry, 1995."},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"M. H. Nodine, M. T. Goodrich, and J. S. Vitter. Blocking for external graph searching. In Proceedings of the 12th Annual ACM Symposium on Principles of Database Systems (PODS '93), pages 222\u2013232, 1993.","DOI":"10.1145\/153850.153880"},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BF00289018","volume":"27","author":"M. H. Overmars","year":"1990","unstructured":"M. H. Overmars, M. H. M. Smid, M. T. de Berg, and M. J. van Kreveld. Maintaining range trees in secondary memory, part I: partitions. Acta Inform., 27:423\u2013452, 1990.","journal-title":"Acta Inform."},{"issue":"6","key":"33_CR20","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6):668\u2013676, 1990.","journal-title":"Communications of the ACM"},{"key":"33_CR21","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF00289019","volume":"27","author":"M. H. M. Smid","year":"1990","unstructured":"M. H. M. Smid and M. H. Overmars. Maintaining range trees in secondary memory, part II: lower bounds. Acta Inform., 27:453\u2013480, 1990.","journal-title":"Acta Inform."},{"key":"33_CR22","volume-title":"Lecture Notes in Computer Science","author":"J. S. Vitter","year":"1991","unstructured":"J. S. Vitter. Efficient memory access in large-scale computation. In 1991 Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, Hamburg, 1991. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:55:55Z","timestamp":1742597755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}