{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:35:50Z","timestamp":1743111350496,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176401"},{"type":"electronic","value":"9783642176418"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17641-8_32","type":"book-chapter","created":{"date-parts":[[2010,11,24]],"date-time":"2010-11-24T10:52:31Z","timestamp":1290595951000},"page":"267-274","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchical Data Structures for Accessing Spatial Data"],"prefix":"10.1007","author":[{"given":"Rituparna","family":"Samaddar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Samaddar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tai-hoon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debnath","family":"Bhattacharyya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associated searching. Comm. Of the ACM\u00a018, 509\u2013517 (1975)","journal-title":"Comm. Of the ACM"},{"unstructured":"Moore, A.W.: An introductory tutorial on KD trees. Technical Report No. 209, Computer Laboratory, University of Cambridge (1991)","key":"32_CR2"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF00264354","volume":"17","author":"M.H. Overmars","year":"1982","unstructured":"Overmars, M.H., van Leeuwen, J.: Dynamic Multi-Dimensional data structures based on Quad and KD tress. Acta Informatica\u00a017, 267\u2013285 (1982)","journal-title":"Acta Informatica"},{"issue":"4","key":"32_CR4","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF01231602","volume":"3","author":"R.H. G\u00fcting","year":"1994","unstructured":"G\u00fcting, R.H.: An Introduction to Spatial Database Systems. The VLDB Journal \u2014 The International Journal on Very Large Data Bases\u00a03(4), 357\u2013399 (1994)","journal-title":"The VLDB Journal \u2014 The International Journal on Very Large Data Bases"},{"issue":"2","key":"32_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"Samet, H.: The Quadtree and Related Hierarchical Data Structures. ACM Computing Surveys (CSUR)\u00a016(2), 187\u2013260 (1984)","journal-title":"ACM Computing Surveys (CSUR)"},{"doi-asserted-by":"crossref","unstructured":"Guttman: R-Trees: A Dynamic index structure for spatial searching. In: Proceedings ACM SIGMOD, pp. 47\u201357 (1984)","key":"32_CR6","DOI":"10.1145\/971697.602266"},{"doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R* Tree-An efficient and Robust Access Method for points & Rectangles. In: Proceedings ACM SIGMOD 1990 International Conference on management of data (1990)","key":"32_CR7","DOI":"10.1145\/93597.98741"},{"doi-asserted-by":"crossref","unstructured":"Brinkhoff, T., Kriegel, H.P., Seeges, B.: Efficient Processing of spatial join using R-Trees. In: Proceedings ACM SIGMOD 1993 International Conference on Management (1993)","key":"32_CR8","DOI":"10.1145\/170035.170075"},{"doi-asserted-by":"crossref","unstructured":"Chang, S.K., Jungert, E., Li, Y.: The Design of Pictorial Database based upon the theory of symbolic projections. In: Proceedings 1st International Symposium on large Spatial databases, Santa Barbara, USA, pp. 303\u2013323 (1989)","key":"32_CR9","DOI":"10.1007\/3-540-52208-5_34"},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(97)00002-1","volume":"22","author":"E. Nardelli","year":"1997","unstructured":"Nardelli, E., Projetti, G.: Time & space efficient secondary memory representation of Quadtrees. Information System\u00a022(1), 25\u201337 (1997)","journal-title":"Information System"},{"key":"32_CR11","volume-title":"Nearest Neighbor search, A Database Perspective","author":"A.N. Papadopoulos","year":"2005","unstructured":"Papadopoulos, A.N., Manolopoulos, Y.: Nearest Neighbor search, A Database Perspective. Springer, Heidelberg (January 2005)"},{"key":"32_CR12","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading (1990)"},{"key":"32_CR13","volume-title":"Applications of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"Samet, H.: Applications of Spatial Data Structures. Addison-Wesley, Reading (1990)"},{"doi-asserted-by":"crossref","unstructured":"Finkel, R.A., Bentley, J.L.: Quad Trees: A Datastructure for retrieval of composite keys (April 8, 1974)","key":"32_CR14","DOI":"10.1007\/BF00288933"},{"doi-asserted-by":"crossref","unstructured":"Overmars, M.H., Van Leeuwen, J.: Multikey retrieval from K-d trees and QUAD-trees. In: International Conference on Management of Data, pp. 291\u2013301 (1985)","key":"32_CR15","DOI":"10.1145\/971699.318925"},{"doi-asserted-by":"crossref","unstructured":"RobInson, J.T.: The K-D-B-Tree A Search Structure for Large, Multidimensional Dynamic Indexes. In: 4CM-SIGMOD 1981 International, Conference 0\u201d Management -o-f Data Association (1981)","key":"32_CR16","DOI":"10.1145\/582318.582321"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00289574","volume":"18","author":"J. Leeuwen Van","year":"1983","unstructured":"Van Leeuwen, J., Overmars, M.H.: Stratified Balanced Search Trees. Acta, Informatica\u00a018, 345\u2013359 (1983)","journal-title":"Acta, Informatica"},{"doi-asserted-by":"crossref","unstructured":"Chang, J.M., Fu, K.S.: Dynamic Clustering Techniques for Physical Database, Design. In: International Conference on Management of Data, pp. 188\u2013199 (1980)","key":"32_CR18","DOI":"10.1145\/582279.582280"},{"issue":"3","key":"32_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J.H. Friedman","year":"1977","unstructured":"Friedman, J.H., Bentley, J.L., Finkel, R.A.: An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM Transactions on Mathematical Software\u00a03(3), 209\u2013226 (1977)","journal-title":"ACM Transactions on Mathematical Software"}],"container-title":["Communications in Computer and Information Science","Signal Processing and Multimedia"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17641-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T21:45:12Z","timestamp":1558388712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17641-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176401","9783642176418"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17641-8_32","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}