{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T11:59:38Z","timestamp":1754481578457,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544142"},{"type":"electronic","value":"9783540476153"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54414-3_43","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:44:42Z","timestamp":1330209882000},"page":"277-296","source":"Crossref","is-referenced-by-count":5,"title":["Performance comparison of segment access methods implemented on top of the buddy-tree"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Seeger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H. P. Kriegel, R. Schneider, B. Seeger: \u2018The R*-tree: an efficient and robust access method for points and rectangles', Proc. ACM SIGMOD Int. Conf. on Management of Data, 322\u2013331, 1990","DOI":"10.1145\/93605.98741"},{"key":"17_CR2","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\/38714.38743"},{"key":"17_CR3","unstructured":"H.-J. Frost, T. Otten and O. Reins: \u2018Improvements on the buddy-tree', master thesis (in German), University of Bremen, 1990"},{"key":"17_CR4","unstructured":"D. Greene: \u2018An implementation and performance analysis of spatial data access methods', Proc. 5th Int. Conf. on Data Engineering, 606\u2013615, 1989"},{"key":"17_CR5","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\/971697.602266"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"E. N. Hanson, M. Chaabouni, C.-H. Kim, Y.-W. Wang: \u2018A predicate matching algorithm for database rule systems', Proc. ACM SIGMOD Int. Conf. on Management of Data, 271\u2013280, 1990","DOI":"10.1145\/93605.98736"},{"key":"17_CR7","unstructured":"A. Henrich, H.-W. Six and P. Widmayer: \u2018The LSD-tree: Spatial access to multidimensional point-and non-point objects', 15th Int. Conf. on Very Large Data Bases, 45\u201353, 1989"},{"key":"17_CR8","unstructured":"K. Hinrichs: \u2018The grid file system: implementation and case studies for applications', Dissertation Nr. 7734, Eidgen\u00f6ssische technische Hochschule (ETH) Z\u00fcrich, 1985"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"A. Hutflesz, H.-W. Six and P. Widmayer: \u2018The R-file: An efficient access structure for proximity queries', Proc. 6th Int. Conf. on Data Engineering, 372\u2013379, 1990","DOI":"10.1109\/ICDE.1990.113490"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"H.P. Kriegel, M. Schiwietz, R. Schneider, B. Seeger: \u2018A performance comparison of multidimensional point and spatial access methods', Proc. of the Symp. on Large Spatial Data Bases, Lecture Notes in Comp. Science No. 409, Springer-Verlag, 1990","DOI":"10.1007\/3-540-52208-5_23"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"H.P. Kriegel, P. Heep, S. Heep, M. Schiwietz, R. Schneider: \u2018An access method based query processor for spatial database systems', technical report, University of Bremen, 1991","DOI":"10.1007\/978-3-642-77605-2_15"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"D.B. Lomet, B. Salzberg: \u2018The hB-tree: a robust multi-attribute indexing method', ACM Trans. on Database Systems, Vo. 15, 4, 1989","DOI":"10.1145\/99935.99949"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"D.B. Lomet, B. Salzberg: \u2018Access Methods for multiversion data', Proc. ACM SIGMOD Int. Conf. on Management of Data, 315\u2013324, 1989","DOI":"10.1145\/66926.66956"},{"issue":"1","key":"17_CR14","doi-asserted-by":"crossref","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":"17_CR15","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-642-72617-0_17","volume":"136","author":"B.C. Ooi","year":"1987","unstructured":"B.C. Ooi: \u2018A data structure for geographic database', Proc. GI-Fachtagung \u201dDatenbanksysteme in B\u00fcro, Technik und Wissenschaft\u201d, Informatik Fachbericht 136, 247\u2013258, 1987","journal-title":"Informatik Fachbericht"},{"issue":"4","key":"17_CR16","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0020-0190(82)90027-8","volume":"14","author":"J. A. Orenstein","year":"1982","unstructured":"J. A. Orenstein: \u2018Multidimensional tries used for associative searching', Information Processing Letters, 14, 4, 150\u2013157, 1982","journal-title":"Information Processing Letters"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"J. A. Orenstein: \u2018Query processing in object-oriented data base systems', Proc. ACM SIGMOD Int. Conf. on Management of Data, 1986","DOI":"10.1145\/16894.16886"},{"key":"17_CR18","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\/582319.582321"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"H. Samet: \u2018The design and analysis of spatial data structures', Addison Wesley, 1989","DOI":"10.1007\/3-540-52208-5_28"},{"key":"17_CR20","unstructured":"B. Seeger, H. P. Kriegel: \u2018Design and implementation of spatial access methods', Proc. 14th Int. Conf. on Very Large Data Bases, 360\u2013371, 1988"},{"key":"17_CR21","unstructured":"B. Seeger, H. P. Kriegel: \u2018The buddy-tree: an efficient and robust access method for spatial data base systems', Proc. 16th Int. Conf. on Very Large Data Bases, 590\u2013601, 1990"},{"key":"17_CR22","unstructured":"T. Sellis, N. Roussopoulos, C. Faloutsos: \u2018The R +-tree: a dynamic index for multidimensional objects', Proc. 13th Int. Conf. on Very Large Database, 1987"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"H.-W. Six, P. Widmayer: 'spatial Searching in Geometric Databases', Proc. 4th Int. Conf. on Data Engineering, 496\u2013503, 1988","DOI":"10.1109\/ICDE.1988.105496"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"M. Tamminen, R. Sulonen: \u2018The Excell method for efficient geometric access to data', Proc. 19th ACM Design Automation Conf. 345\u2013351, 1982","DOI":"10.1109\/DAC.1982.1585522"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54414-3_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:17:17Z","timestamp":1742591837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54414-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544142","9783540476153"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-54414-3_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}