{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:49Z","timestamp":1725663529328},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569213"},{"type":"electronic","value":"9783540477853"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56921-9_1","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:52:47Z","timestamp":1330257167000},"page":"1-22","source":"Crossref","is-referenced-by-count":0,"title":["Begriffsverzeichnis: a concept index"],"prefix":"10.1007","author":[{"given":"Michael","family":"Freeston","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"1_CR1","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. Proc. ACM SIGMOD Conf., 1990.","DOI":"10.1145\/93597.98741"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"J.L. Bentley. Multidimensional Binary Search Trees in Database Applications. IEEE Trans. on Soft. Eng., Vol. SE-5, No. 4, July 1979.","DOI":"10.1109\/TSE.1979.234200"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"J.L. Bentley and J.H. Friedman. Data Structures for Range Searching. ACM Computing Surveys, Vol. 11, No. 4, December 1979.","DOI":"10.1145\/356789.356797"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"W.A. Burkhard. Interpolation-Based Index Maintenance. Proc. ACM SIGMOD-SIGACT Symposium, 1983.","DOI":"10.1145\/588058.588070"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"R. Fagin, J. Nievergelt, N. Pippenger and H.R. Strong. Extendible Hashing: A Fast Access Method for Dynamic Files. ACM-TODS, Vol. 4, No. 3, September 1979.","DOI":"10.1145\/320083.320092"},{"key":"1_CR6","unstructured":"M.W. Freeston. Data Structures for Knowledge Bases: Multi-Dimensional File Organisations. ECRC, Technical Report TR-KB-13, 1986."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"M. Freeston. The BANG File: a New Kind of Grid File. Proc. ACM SIGMOD Conf., San Francisco, May 1987.","DOI":"10.1145\/38713.38743"},{"key":"1_CR8","unstructured":"M. Freeston. Grid files for Efficient Prolog Clause Access. Prolog and Databases: Implementations and Applications, Ed. Gray P.M.D. and Lucas R.J., Pub. Ellis Horwood."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"M. Freeston. Advances in the design of the BANG File. 3rd International Conference on Foundations of Data Organization and Algoritms (FODO), Paris, June 1989.","DOI":"10.1007\/3-540-51295-0_140"},{"key":"1_CR10","volume-title":"Lecture Notes in Computer Science No. 409","author":"M. Freeston","year":"1989","unstructured":"M. Freeston. A Well-Behaved File Structure for the Storage of Spatial Objects. Symposium on the Design and Implementation of Large Spatial Databases, Santa Barbara, California, July 1989, Lecture Notes in Computer Science No. 409, Springer-Verlag, 1989."},{"key":"1_CR11","unstructured":"M. Freeston. The Comparative Performance of BANG Indexing for Spatial Objects. 5th International Symposium on Spatial Data Handling, Charleston, South Carolina, August 1992."},{"key":"1_CR12","unstructured":"M. Freeston. On the Generalised Indexing of Complex Structures. ECRC Technical Report ECRC-93-9, May 1993."},{"key":"1_CR13","unstructured":"M. Freeston. On the Generalised Application of Spatial Indexing Techniques in Deductive GIS Systems. British Computer Journal, special issue on spatial data, Ed. Freeston and Nievergelt, October 1993 [In preparation]."},{"key":"1_CR14","unstructured":"G. Gardarin, P. Valduriez, Y. Viemont. Les Arbres de Predicats. INRIA, Rapports de Recherche, No. 203, April 1983."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"O. Gunther. The Design of the Cell Tree: an Object-Oriented Index Structure for Geometric Databases. Proc. IEEE 5th Int. Conf. on Data Engineering, Los Angeles, 1989.","DOI":"10.1109\/ICDE.1989.47267"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"A. Guttman. R-trees: a dynamic index structure for spatial searching. Proc. ACM SIGMOD Conf., Boston, 1984.","DOI":"10.1145\/602259.602266"},{"key":"1_CR17","unstructured":"A. Henrich, H.-W. Six and P. Widmayer. The LSD-tree: Spatial Access to Multidimensional Point and Non-point Objects. 15th Int. Conf. on Very Large Data Bases (VLDB), 1989."},{"key":"1_CR18","volume-title":"Doctoral Thesis Nr. 7734","author":"K. H. Hinrichs","year":"1985","unstructured":"K.H. Hinrichs. The grid file system: implementation and case studies of applications. Doctoral Thesis Nr. 7734, ETH Z\u00fcrich, 1985."},{"key":"1_CR19","volume-title":"Lecture Notes in Computer Science No. 303","author":"A. Hutflesz","year":"1988","unstructured":"A. Hutflesz, H.-W. Six and P. Widmayer. The Twin Grid File: A Nearly Space Optimal Index Structure. Proc. 1st Int. Conf. on Extending Database Technology (EDBT), Venice, Italy, March 1988, Lecture Notes in Computer Science No. 303, Springer-Verlag, 1988."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"A. Hutflesz, H.-W. Six and P. Widmayer. The R-file: An Efficient Access Structure for Proximity Queries. Proc. 6th Int. Conf. on Data Engineering, 1990.","DOI":"10.1109\/ICDE.1990.113490"},{"key":"1_CR21","volume-title":"Lecture Notes in Computer Science No. 409","author":"H. P. Kriegel","year":"1990","unstructured":"H.P. Kriegel, M. Schiwietz, R. Schneider and B. Seeger. A Performance Comparison of Multidimensional Point and Spatial Access Methods. Proc. Symposium on Large Spatial Databases, Z\u00fcrich, 1990, Lecture Notes in Computer Science No. 409, Springer-Verlag, 1990."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"D.T. Lee, C.K. Wong. Quintary Trees: A File Structure for Multidimensional Database Systems. ACM-TODS, Vol. 5, No. 3, September 1980.","DOI":"10.1145\/320613.320618"},{"key":"1_CR23","first-page":"4","volume":"15","author":"D. B. Lomet","year":"1989","unstructured":"D.B. Lomet and B. Salzberg. The hB-tree: a Robust Multi-Attribute Indexing Method. ACM Trans. on Database Systems, Vol. 15, 4, 1989.","journal-title":"ACM Trans. on Database Systems"},{"key":"1_CR24","volume-title":"Internal Report No. 46","author":"J. Nievergelt","year":"1981","unstructured":"J. Nievergelt, H. Hintenberger, K.C. Sevcik. The Grid File: an adaptable, symmetric multikey file structure. Internal Report No. 46, Institut f\u00fcr Informatik, ETH Zurich, December 1981."},{"key":"1_CR25","unstructured":"Y. Ohsawa and M. Sakauchi. The BD-Tree: a new n-dimensional data structure with highly efficient dynamic characteristics. IFIP 9th World Computer Congress, Paris, 1983."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"J.A. Orenstein. Spatial Query Processing in an Object-Oriented Database System. Proc. ACM SIGMOD Conf., 1986.","DOI":"10.1145\/16894.16886"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"E.J. Otoo. A Multidimensional Digital Hashing Scheme for Files with Composite Keys. ACM 1985.","DOI":"10.1145\/318898.318918"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"M. Ouksel and P. Scheuermann. Storage Mapping for Multidimensional Linear Dynamic Hashing. Proc. of 2nd Symposium on Principles of Database Systems, Atlanta, 1983.","DOI":"10.1145\/588058.588071"},{"key":"1_CR29","unstructured":"E.A. Ozkarahan and M. Ouksel. Dynamic and Order Preserving Data Partitioning for Database Machines. Proc. of 11th Int. Conf. on Very Large Data Bases, Stockholm, August 1985."},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"J.T. Robinson. The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes. Proc. ACM SIGMOD Conf., 1981.","DOI":"10.1145\/582318.582321"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"H. Samet. Quadtrees and Related Hierarchical Data Structures for Computer Graphics and Image Processing, 1986.","DOI":"10.1007\/978-3-642-71071-1_11"},{"key":"1_CR32","unstructured":"H. Samet. The Design and Analysis of Spatial Data Structures. Pub. Addison Wesley, 1989."},{"key":"1_CR33","unstructured":"B. Seeger and H.P. Kriegel. Design and Implementation of Spatial Access Methods. Proc. 14th Int. Conf on Very Large Data Bases (VLDB), Long Beach, California, 1988."},{"key":"1_CR34","unstructured":"B. Seeger and H.P. Kriegel. The Buddy-tree: an Efficient and Robust Access Method for Spatial Data Base Systems. Proc. 16th Int. Conf. on Very Large Data Bases, Brisbane, 1990."},{"key":"1_CR35","unstructured":"T. Sellis, N. Roussopoulos and C. Faloutsos. The R+ Tree: a Dynamic Index for Multi-dimensional Objects. Proceeding 13th Int. Conf. on Very Large Data Bases, Brighton, 1987."}],"container-title":["Lecture Notes in Computer Science","Advances in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56921-9_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:07:02Z","timestamp":1605647222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56921-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569213","9783540477853"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-56921-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}