{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:45Z","timestamp":1742617185662,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601593"},{"type":"electronic","value":"9783540495369"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60159-7_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:47:07Z","timestamp":1330278427000},"page":"132-151","source":"Crossref","is-referenced-by-count":2,"title":["Extending a spatial access structure to support additional standard attributes"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Henrich","sequence":"first","affiliation":[]},{"given":"Jens","family":"M\u00f6ller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"9","key":"9_CR1","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. Communications of the ACM, 18(9):509\u2013517, 1975.","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"L. Becker, K. Hinrichs, and U. Finke. A New Algorithm for Computing Joins with Grid Files. In Proc. IEEE Int'l. Conf. on Data Eng., pages 190\u2013197, Vienna, Austria, April 1993.","key":"9_CR2","DOI":"10.1109\/ICDE.1993.344063"},{"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 Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, pages 322\u2013331, Atlantic City, 1990.","key":"9_CR3","DOI":"10.1145\/93597.98741"},{"unstructured":"J.P. Cheiney, P. Faudemay, R. Michel, and J.M. Thevenin. A Reliable Parallel Backend Using Multiattribute Clustering and Select-Join Operator. In Procs. VLDB, pages 220\u2013227, 1986.","key":"9_CR4"},{"doi-asserted-by":"crossref","unstructured":"M. Freeston. The BANG file: a new kind of grid file. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pages 260\u2013269, San Francisco, 1987.","key":"9_CR5","DOI":"10.1145\/38713.38743"},{"doi-asserted-by":"crossref","unstructured":"O. G\u00fcnther and J. Bilmes. Tree-based access methods for spatial databases: implementation and performance evaluation. IEEE Trans. on Knowledge and Data Engineering, pages 342\u2013356, 1991.","key":"9_CR6","DOI":"10.1109\/69.91064"},{"doi-asserted-by":"crossref","unstructured":"A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pages 47\u201357, Boston, 1984.","key":"9_CR7","DOI":"10.1145\/602259.602266"},{"doi-asserted-by":"crossref","unstructured":"R.H. G\u00fcting. Geo-Relational-Algebra: A Model and Query Language for Geometric Database Systems. In J.W. Schmidt, S. Ceri, and M. Missikoff, editors,\u2019 Advances in Database Technology \u2014 EDBT'. Proc. of the Intl. Conf. on Extending Database Technology, pages 506\u2013527, 1988.","key":"9_CR8","DOI":"10.1007\/3-540-19074-0_70"},{"unstructured":"R.H. G\u00fcting. Gral: An Extensible Relational Database System for Geometric Applications. In Proc. of the 15th Intl. Conf. on Very Large Databases, 1989.","key":"9_CR9"},{"unstructured":"A. Henrich. A distance-scan algorithm for spatial access structures. In Proc. of the 2nd ACM Workshop on Advances in Geographic Information Systems, 1994. to appear.","key":"9_CR10"},{"key":"9_CR11","volume-title":"Dissertation Nr. 7734","author":"K. Hinrichs","year":"1985","unstructured":"K. Hinrichs. The grid file system: implementation and case studies of applications. Dissertation Nr. 7734, ETH Z\u00fcrich, 1985."},{"doi-asserted-by":"crossref","unstructured":"A. Henrich and J. M\u00f6ller. Die Nutzung mehrdimensionaler Zugriffsstrukturen f\u00fcr Standardattribute. In Proc. GI-Fachtagung Datenbanksysteme in B\u00fcro, Technik und Wissenschaft, Dresden, 1995. to appear.","key":"9_CR12","DOI":"10.1007\/978-3-642-79646-3_13"},{"doi-asserted-by":"crossref","unstructured":"A. Henrich, H.-W. Six, and P. Widmayer. Paging binary trees with external balancing. In Proc. 15th Intl. Conf. on Graph-Theoretic Concepts in Computer Science, pages 260\u2013276, Aachen, 1989.","key":"9_CR13","DOI":"10.1007\/3-540-52292-1_19"},{"unstructured":"A. Henrich, H.-W. Six, and P. Widmayer. The LSD-tree: spatial access to multidimensional point and non point objects. In Proc. 16th Intl. Conf. on Very Large Data Bases, pages 45\u201353, Amsterdam, 1989.","key":"9_CR14"},{"doi-asserted-by":"crossref","unstructured":"A. Hutflesz, H.-W. Six, and P. Widmayer. The R-File: An Efficient Access Structure for Proximity Queries. In Proc. IEEE 6th Int. Conf. on Data Engineering, pages 372\u2013379, 1990.","key":"9_CR15","DOI":"10.1109\/ICDE.1990.113490"},{"doi-asserted-by":"crossref","unstructured":"M. Kitsuregawa, L. Harada, and M. Takagi. Join Strategies on KD-Tree Indexed Relations. In Proc. IEEE Conference on Data Engineering, pages 85\u201393, 1989.","key":"9_CR16","DOI":"10.1109\/ICDE.1989.47203"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1007\/BF01759075","volume":"6","author":"M.J. Kreveld van","year":"1991","unstructured":"M.J. van Kreveld and M.H. Overmars. Divided k-d Trees. Algorithmica, 6:840\u2013858, 1991.","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"D.B. Lomet and B. Salzberg. A Robust Multi-Attribute Search Structure. In Proc. IEEE 5th Intl. Conf. on Data Engineering, pages 296\u2013304, 1989.","key":"9_CR18","DOI":"10.1109\/ICDE.1989.47229"},{"issue":"1","key":"9_CR19","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt, H. Hinterberger, and K.C. Sevcik. The Grid File: an adaptable, symmetric multikey file structure. ACM Transactions on Database Systems, 9(1):38\u201371, 1984.","journal-title":"ACM Transactions on Database Systems"},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF03037503","volume":"6","author":"E.A. Ozkarahan","year":"1988","unstructured":"E.A. Ozkarahan and C.H. Bozsahin. Join Strategies Using Data Space Partitioning. New Generation Computing, 6:19\u201339, 1988.","journal-title":"New Generation Computing"},{"unstructured":"B.C. Ooi, K.J. McDonell, and R. Sacks-Davis. Spatial kd-Tree: An Indexing Mechanism for Spatial Databases. In IEEE COMPSAC, pages 433\u2013438, 1987.","key":"9_CR21"},{"doi-asserted-by":"crossref","unstructured":"J.T. Robinson. The K-D-B-Tree: A Search Structure for Large Multdimensional Dynamic Indexes. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pages 10\u201318, 1981.","key":"9_CR22","DOI":"10.1145\/582318.582321"},{"unstructured":"B. Seeger and H.-P. Kriegel. Techniques for design and implementation of efficient spatial access methods. In Proc. 14th Intl. Conf. on Very Large Databases, pages 360\u2013371, 1988.","key":"9_CR23"},{"unstructured":"B. Seeger and H.-P. Kriegel. The buddy-tree: an efficient and robust access method for spatial data base systems. In Proc. of the 16th Intl. Conf. on Very Large Data Bases, pages 590\u2013601, Brisbane, 1990.","key":"9_CR24"},{"unstructured":"T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-tree: a dynamic index for multi-dimensional objects. In Proc. 13th International Conference on Very Large Data Bases, pages 507\u2013518, 1987.","key":"9_CR25"},{"unstructured":"J.A. Thom, K. Ramamohanarao, and L. Naish. A Superjoin Algorithm for Deductive Databases. In Procs. VLDB, pages 189\u2013196, 1986.","key":"9_CR26"}],"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-60159-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:54:13Z","timestamp":1742597653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60159-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601593","9783540495369"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-60159-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}