{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T23:37:00Z","timestamp":1723073820743},"reference-count":15,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1016\/j.is.2011.01.002","type":"journal-article","created":{"date-parts":[[2011,1,20]],"date-time":"2011-01-20T09:31:03Z","timestamp":1295515863000},"page":"734-747","source":"Crossref","is-referenced-by-count":25,"title":["Fully dynamic metric access methods based on hyperplane partitioning"],"prefix":"10.1016","volume":"36","author":[{"given":"Gonzalo","family":"Navarro","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Uribe-Paredes","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.is.2011.01.002_bib1","series-title":"Foundations of Multidimensional and Metric Data Structures","author":"Samet","year":"2005"},{"issue":"3","key":"10.1016\/j.is.2011.01.002_bib2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","article-title":"Searching in metric spaces","volume":"33","author":"Ch\u00e1vez","year":"2001","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"10.1016\/j.is.2011.01.002_bib3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0306-4379(87)90041-X","article-title":"Voronoi trees and clustering problems","volume":"12","author":"Dehne","year":"1987","journal-title":"Information Systems"},{"key":"10.1016\/j.is.2011.01.002_bib4","unstructured":"S. Brin, Near neighbor search in large metric spaces, in: Proceedings of the 21st Very Large Databases Conference (VLDB), 1995, pp. 574\u2013584."},{"key":"10.1016\/j.is.2011.01.002_bib5","unstructured":"P. Ciaccia, M. Patella, P. Zezula, M-tree: an efficient access method for similarity search in metric spaces, in: Proceedings of the 23rd Very Large Databases Conference (VLDB), 1997, pp. 426\u2013435."},{"key":"10.1016\/j.is.2011.01.002_bib6","doi-asserted-by":"crossref","unstructured":"C. Traina, A. Traina, B. Seeger, C. Faloutsos, Slim-trees: high performance metric trees minimizing overlap between nodes, in: Proceedings of the Seventh Extending Database Technology (EDBT), 2000, pp. 51\u201361.","DOI":"10.1007\/3-540-46439-5_4"},{"issue":"1","key":"10.1016\/j.is.2011.01.002_bib7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s007780200060","article-title":"Searching in metric spaces by spatial approximation","volume":"11","author":"Navarro","year":"2002","journal-title":"The Very Large Databases Journal"},{"key":"10.1016\/j.is.2011.01.002_bib8","doi-asserted-by":"crossref","unstructured":"J. Lokoc, T. Skopal, On reinsertions in M-tree, in: Proceedings of the First Similarity Search and Applications (SISAP), IEEE CS, 2008, pp. 410\u2013417.","DOI":"10.1109\/SISAP.2008.10"},{"key":"10.1016\/j.is.2011.01.002_bib9","doi-asserted-by":"crossref","DOI":"10.1145\/1227161.1322337","article-title":"Dynamic spatial approximation trees","volume":"12","author":"Navarro","year":"2008","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"10.1016\/j.is.2011.01.002_bib10","unstructured":"R.F.S. Filho, A.J.M. Traina, C.T. Jr., C. Faloutsos, Similarity search without tears: the OMNI family of all-purpose access methods, in: Proceedings of the 17th International Conference on Data Engineering (ICDE), 2001, pp. 623\u2013630."},{"issue":"2","key":"10.1016\/j.is.2011.01.002_bib11","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/1071610.1071612","article-title":"idistance: an adaptive B+-tree based indexing method for nearest neighbor search","volume":"30","author":"Jagadish","year":"2005","journal-title":"ACM Transactions on Database Systems"},{"key":"10.1016\/j.is.2011.01.002_bib12","series-title":"Proceedings of the Second Similarity Search and Applications (SISAP)","first-page":"81","article-title":"Dynamic spatial approximation trees for massive data","author":"Navarro","year":"2009"},{"key":"10.1016\/j.is.2011.01.002_bib13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","article-title":"An algorithm for finding nearest neighbor in (approximately) constant average time","volume":"4","author":"Vidal","year":"1986","journal-title":"Pattern Recognition Letters"},{"key":"10.1016\/j.is.2011.01.002_bib14","unstructured":"M. Patella, Similarity search in multimedia databases, Ph.D. Thesis, Dip. di Elect. Inf. e Sist., Univ. degli Studi di Bologna, Bologna, Italy, 1999."},{"key":"10.1016\/j.is.2011.01.002_bib15","doi-asserted-by":"crossref","unstructured":"I. Kalantari, G. McDonald, A data structure and an algorithm for the nearest point problem, IEEE Transactions on Software Engineering 9 (5) (1983).","DOI":"10.1109\/TSE.1983.235263"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437911000032?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437911000032?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T18:30:59Z","timestamp":1637173859000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437911000032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["S0306437911000032"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2011.01.002","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}