{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:32Z","timestamp":1725663572893},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540522089"},{"type":"electronic","value":"9783540469247"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52208-5_19","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:23:44Z","timestamp":1330205024000},"page":"1-27","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["7\u00b12 criteria for assessing and comparing spatial data structures"],"prefix":"10.1007","author":[{"given":"Jurg","family":"Nievergelt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"1_CR1","first-page":"263","volume":"146","author":"G. M. Adelson-Velskii","year":"1962","unstructured":"G. M. Adelson-Velskii, Y. M. Landis: An algorithm for the organization of information (in Russian), Dokl. Akad. Nauk SSSR, Vol 146, 263\u2013266, 1962.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer, E. M. McCreight: Organization and maintenance of large ordered indexes, Acta Informatica, Vol 1, 173\u2013189, 1972.","journal-title":"Acta Informatica"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00263762","volume":"9","author":"R. Bayer","year":"1977","unstructured":"R. Bayer, M. Schkolnick: Concurrency of operations on B-trees, Acta Informatica, Vol 9, 1\u201321, 1977.","journal-title":"Acta Informatica"},{"issue":"9","key":"1_CR4","doi-asserted-by":"crossref","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, Comm. ACM, 18, No 9, 509\u2013517, Sep 1975.","journal-title":"Comm. ACM"},{"key":"1_CR5","unstructured":"H. Edelsbrunner, J. van Leeuwen: Multidimensional algorithms and data structures (bibliography), Bulletin of the EATCS, 1980."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"M. W. Freeston: The Bang file: a new kind of grid file, Proc. ACM SIGMOD Conf. 1987.","DOI":"10.1145\/38713.38743"},{"issue":"3","key":"1_CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/965105.807481","volume":"14","author":"H. Fuchs","year":"1980","unstructured":"H. Fuchs, Z.M. Kedem, B.F. Naylor: On visible surface generation by priority tree structures, Computer Graphics (Proc. SIGGRAPH '80), Vol 14, 3, 123\u2013133, 1980.","journal-title":"Computer Graphics"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"O. Gunther: Efficient structures for geometric data management, Lecture Notes in Computer Science, 337, Springer 1988.","DOI":"10.1007\/BFb0046097"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"A. Guttman: R-trees: a dynamic index structure for spatial searching, Proc. ACM SIGMOD Conf. on Management of Data, 47\u201357, 1984.","DOI":"10.1145\/971697.602266"},{"key":"1_CR10","unstructured":"A. Henrich, H-W. Six, P. Widmayer: The LSD tree: spatial access to multidimensional point-and non-point-objects, Proc. VLDB, Amsterdam, 1989."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/BF01936137","volume":"25","author":"K. Hinrichs","year":"1985","unstructured":"K. Hinrichs: Implementation of the grid file: design concepts and experience, BIT 25 (1985), 569\u2013592.","journal-title":"BIT"},{"key":"1_CR12","unstructured":"D. E. Knuth: \"The Art of Computer Programming\", Addison-Wesley. Vol 1 \"Fundamental Algorithms\", 1968; Vol 3 \"Sorting and Searching\", 1973."},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1145\/320613.320619","volume":"5","author":"H. T. Kung","year":"1980","unstructured":"H. T. Kung, P. L. Lehman: Concurrent manipulation of binary search trees, ACM TODS, Vol 5, No 3, 354\u2013382, Sep 1980.","journal-title":"ACM TODS"},{"key":"1_CR14","unstructured":"D. Lomet, B. Salzberg: The hB-tree: A robust multiattribute search structure, Proc. 5-th Int. Conf. on Data Engineering, Feb 1989."},{"key":"1_CR15","volume-title":"An introduction to solid modeling","author":"M. Mantyla","year":"1988","unstructured":"M. Mantyla: An introduction to solid modeling, Computer Science Press, Rockville, MD, 1988."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn: Data structures and algorithms, Vol 3, Multi-dimensional search and computational geometry, Springer, 1984.","DOI":"10.1007\/978-3-642-69900-9_2"},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/3-540-10828-9_53","volume":"112","author":"J. Nievergelt","year":"1981","unstructured":"J. Nievergelt: Trees as data and file structures. In CAAP '81, Proc. 6th Coll on Trees in Algebra and Progamming, (E. Astesiano and C. Bohm, eds.), Lecture Notes in Comp Sci 112, 35\u201345, Springer 1981.","journal-title":"Lecture Notes in Comp Sci"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt, H. Hinterberger, K. C. Sevcik: The grid file: an adaptable, symmetric multikey file structure, ACM Trans. on Database Systems 9, 1, 38\u201371, 1984.","journal-title":"ACM Trans. on Database Systems"},{"key":"1_CR19","first-page":"441","volume-title":"Storage and access structures for geometric data bases, Proc. Kyoto 85 Intern. Conf. on Foundations of Data Structures","author":"J. Nievergelt","year":"1987","unstructured":"J. Nievergelt, K. Hinrichs: Storage and access structures for geometric data bases, Proc. Kyoto 85 Intern. Conf. on Foundations of Data Structures (eds. Ghosh et al.), 441\u2013455, Plenum Press, NY 1987."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0196-6774(81)90025-0","volume":"2","author":"M. H. Overmars","year":"1981","unstructured":"M. H. Overmars: Dynamization of order decomposable set problems, J. Algorithms, Vol 2, 245\u2013260, 1981.","journal-title":"J. Algorithms"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"F. Preparata, M. Shamos: Computational Geometry, Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"H. Samet: The design and analysis of spatial data structures, and Applications of spatial data structures, Addison Wesley, 1989","DOI":"10.1007\/3-540-52208-5_28"},{"key":"1_CR23","unstructured":"B. Seeger, H-P. Kriegel: Techniques for design and implementation of efficient spatial access methods, 360\u2013371, Proc. 14-th VLDB, 1988."},{"key":"1_CR24","unstructured":"T. Sellis, N. Roussopoulos, C. Faloutsos: The R+-tree: A dynamic index for multidimensional objects, 507\u2013518, Proc. VLDB, 1987."},{"key":"1_CR25","unstructured":"D. E. Willard: Balanced forests of h-d trees as a dynamic data structure, Harvard Report, 1978."}],"container-title":["Lecture Notes in Computer Science","Design and Implementation of Large Spatial Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52208-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T03:05:45Z","timestamp":1640919945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52208-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540522089","9783540469247"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-52208-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}