{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T23:35:03Z","timestamp":1773963303354,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540522089","type":"print"},{"value":"9783540469247","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52208-5_23","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:24:12Z","timestamp":1330205052000},"page":"89-114","source":"Crossref","is-referenced-by-count":26,"title":["Performance comparison of point and spatial access methods"],"prefix":"10.1007","author":[{"given":"Hans-Peter","family":"Kriegel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schiwietz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Seeger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"D. Comer: \u2018The Ubiquitous B-tree', Computing Surveys, Vol.11, No.2, 121\u2013137, 1979","journal-title":"Computing Surveys"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BF01934457","volume":"23","author":"W.A. Burkhard","year":"1983","unstructured":"W.A. Burkhard: \u2018Interpolation-based index maintenance', BIT 23, 274\u2013294, 1983","journal-title":"BIT"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"M. Freeston: \u2018The BANG file: a new kind of grid file', Proc. ACM SIGMOD Int. Conf. on Management of Data, 260\u2013269, 1987","DOI":"10.1145\/38713.38743"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"D. Greene: \u2018An Implementation and Performance Analysis of Spatial Data Access Methods', Proc. 5th Int. Conf. on Data Engineering, 606\u2013615, 1989","DOI":"10.1109\/ICDE.1989.47268"},{"key":"5_CR5","unstructured":"O. G\u00fcnther: The design of the cell tree: An object-oriented index structure for geometric databases, in Proc. Fifth Intl. Conf. on Data Engineering, Feb. 6\u201310, 1989, Los Angeles"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"A. Guttman: \u2018R-trees: a dynamic index structure for spatial searching', Proc. ACM SIGMOD Int. Conf. on Management of Data, 47\u201357, 1984","DOI":"10.1145\/602259.602266"},{"key":"5_CR7","volume-title":"'The grid file system: implementation and case studies for applications', Dissertation No. 7734","author":"K. Hinrichs","year":"1985","unstructured":"K. Hinrichs: 'The grid file system: implementation and case studies for applications', Dissertation No. 7734, Eidgen\u00f6ssische Technische Hochschule (ETH), Zuerich, 1985"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"A. Hutflesz, H.-W. Six, P. Widmayer: \u2018Twin grid files: space optimizing access schemes', Proc. ACM SIGMOD Int. Conf. on Management of Data, 183\u2013190, 1988","DOI":"10.1145\/50202.50222"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"H.P. Kriegel: \u2018Performance comparison of index structures for multikey retrieval', Proc. ACM SIGMOD Int. Conf. on Management of Data, 186\u2013196, 1984","DOI":"10.1145\/971697.602284"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-17187-8_38","volume":"243","author":"H.P. Kriegel","year":"1986","unstructured":"H.P. Kriegel, B. Seeger: \u2018Multidimensional order preserving linear hashing with partial expansions', Proc. Int. Conf. on Database Theory, Lecture Notes in Computer Science 243, 203\u2013220, 1986","journal-title":"Lecture Notes in Computer Science"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"H.P. Kriegel, B. Seeger: \u2018Multidimensional quantile hashing is very efficient for non-uniform distributions', Proc. 3rd Int. Conf. on Data Engineering, 10\u201317, 1987, extended version will appear in Information Science","DOI":"10.1109\/ICDE.1987.7272349"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"H.P. Kriegel, B. Seeger: \u2018PLOP-Hashing: a grid file without directory', Proc. 4th Int. Conf. on Data Engineering, 369\u2013376, 1988","DOI":"10.1109\/ICDE.1988.105439"},{"key":"5_CR13","unstructured":"D.B. Lomet, B. Salzberg: The hB-tree: A robust multiattribute search structure, in Proc. of the Fifth Int. Conf. on Data Engineering, Feb. 6\u201310, 1989, Los Angeles, also available as Technical Report TR-87-05, School of Information Technology, Wang Institute of Graduate Studies."},{"issue":"1","key":"5_CR14","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: \u2018The grid file: an adaptable, symmetric multikey file structure', ACM Trans. on Database Systems, Vol. 9, 1, 38\u201371, 1984","journal-title":"ACM Trans. on Database Systems"},{"key":"5_CR15","unstructured":"J. Nievergelt, K. Hinrichs: 'storage and access structures for geometric data bases', Proc. Int. Conf. on Foundsations of Data Organization, 335\u2013345, 1985"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"J.A. Orenstein, T.H. Merrett: \u2018A class of data structures for associative searching', Proc 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 181\u2013190, 1984","DOI":"10.1145\/588011.588037"},{"key":"5_CR17","unstructured":"E. J. Otoo: \u2018A mapping function for the directory of a multidimensional extendible hashing', Proc. 10th Int. Conf. on Very Large Databases, 491\u2013506, 1984"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"E. J. Otoo,: \u2018Balanced multidimensional extendible hash tree', Proc. 5th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 110\u2013113, 1986","DOI":"10.1145\/6012.6015"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"M. Ouksel: \u2018The interpolation based grid file', Proc. 4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1985","DOI":"10.1145\/325405.325408"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"J. T. Robinson: \u2018The K-D-B-tree: a search structure for large multidimensional dynamic indexes', Proc. ACM SIGMOD Int. Conf. on Management of Data, 10\u201318, 1981","DOI":"10.1145\/582318.582321"},{"key":"5_CR21","unstructured":"Seeger, B.: \u2018Design and implementation of multidimensional access methods\u2019 in German), PhD thesis, Department of Computer Science, University of Bremen."},{"key":"5_CR22","unstructured":"B. Seeger, S. Frank, H.P. Kriegel: The buddy hash tree, English version in preparation, German version available as a Technical Report"},{"key":"5_CR23","unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: \u2018The R+-tree: a dynamic index for multi-dimensional objects', Proc. 13th Int. Conf. on Engeneering, 1988."},{"key":"5_CR24","unstructured":"B. Seeger, H. P. Kriegel: \u2018Design and implementation of spatial access methods', Proc. 14th Int. Conf. on Very Large Databases, 360\u2013371, 1988"},{"key":"5_CR25","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01934393","volume":"22","author":"M. Tamminen","year":"1982","unstructured":"M. Tamminen: \u2018The extendible cell method for closest point problems', BIT 22, 27\u201341, 1982","journal-title":"BIT"},{"key":"5_CR26","volume-title":"'Multilevel grid files', Technical Report","author":"K.-Y. Whang","year":"1985","unstructured":"K.-Y. Whang, R. Krishnamurthy: 'Multilevel grid files', Technical Report, IBM Research Lab., Yorktown Heights, 1985"}],"container-title":["Lecture Notes in Computer Science","Design and Implementation of Large Spatial Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52208-5_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:23:31Z","timestamp":1605648211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52208-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540522089","9783540469247"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-52208-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}