{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:00:04Z","timestamp":1725890404084},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676270"},{"type":"electronic","value":"9783540451518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45151-x_26","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:14:10Z","timestamp":1187248450000},"page":"271-283","source":"Crossref","is-referenced-by-count":0,"title":["Hana Tree: A Dynamic and Robust Access Method for Spatial Data Handling"],"prefix":"10.1007","author":[{"given":"Yongwon","family":"Kwon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changsung","family":"Jeong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,7]]},"reference":[{"issue":"1","key":"26_CR1","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. Dtabase System, Vol. 9, No. 1 (1984) 38\u201371","journal-title":"ACM Trans. Dtabase System"},{"key":"26_CR2","unstructured":"E. J. Otoo: A mapping Function for the directory of a multidimensional extendible hashing. In Proc. of the tenth Int. Conf. on Very Large Data Bases (1984) 491\u2013506"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"J. T. Robinson: The k-d-B-tree: a search structure for large multidimensional dynamic indexes. In Proc. of ACM SIGMOD Int. Conf. on Management of Data (1981) 10\u201318","DOI":"10.1145\/582318.582321"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"M. Freeston: The BANG file: a new kind of grid file. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data (1987) 260\u2013269","DOI":"10.1145\/38713.38743"},{"key":"26_CR5","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 Int. Conf. on Very Large Data Bases (1990) 590\u2013601"},{"key":"26_CR6","unstructured":"D. B. Lomet and Betty Salzberg,: The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance. In Proc. of the fifth IEEE Int. Conf. on Data Engineering (1989) 296\u2013304"},{"key":"26_CR7","unstructured":"K. Y. Whang and R. Krishmamurthy: The Multilevel Grid File-A Dynamic Hierarchical Multidimensional File Structure. Int. Symposium on Database Systems for Advanced Applications (1991) 449\u2013459"},{"key":"26_CR8","unstructured":"A. Henrich, H. W. Six, and P. Widmayer: The LSD tree: spatial access to multidimensional point and nonpoint objects. In Proc. of the fifteenth Int. Conf. on Very Large Data Bases (1989) 45\u201353"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"M. Freeston: A general solution of the n-dimensional B-tree problem. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data (1995) 80\u201391","DOI":"10.1145\/223784.223796"},{"key":"26_CR10","unstructured":"J. M. Hellerstein, J. F. Navghton and A. Pfeffer: Generalized search trees for database systems. In Proc. of the 21st Int. Conf. on VeryLarge Data Bases (1995) 562\u2013573"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. Gunther: Multidimension Access Methods. ACM Computing Surveys, Vol. 30, No. 2 (1998) 170\u2013230","journal-title":"ACM Computing Surveys"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"J. Orenstein and T. H. Merrett: A class of data structures for associative searching. In Proc. of the third ACM SIGACT-SIGMOD symposium on Principles of Database Systems (1984) 181\u2013190","DOI":"10.1145\/588011.588037"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"C. Faloutsos and S. Roseman: Fractals for secondary key retrieval. In Proc. of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Databases Systems (1989) 247\u2013252","DOI":"10.1145\/73721.73746"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45151-X_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T18:00:54Z","timestamp":1550772054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45151-X_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676270","9783540451518"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45151-x_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}