{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:22:07Z","timestamp":1759335727760},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540294146"},{"type":"electronic","value":"9783540320852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11569596_86","type":"book-chapter","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T06:17:55Z","timestamp":1132035475000},"page":"843-853","source":"Crossref","is-referenced-by-count":7,"title":["Recursive Lists of Clusters: A Dynamic Data Structure for Range Queries in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Margarida","family":"Mamede","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"86_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-39984-1_28","volume-title":"String Processing and Information Retrieval","author":"D. Arroyuelo","year":"2003","unstructured":"Arroyuelo, D., Mu\u00f1oz, F., Navarro, G., Reyes, N.: Memory-adaptative dynamic spatial approximation trees. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 360\u2013368. Springer, Heidelberg (2003)"},{"key":"86_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-58094-8_18","volume-title":"Combinatorial Pattern Matching","author":"R. Baeza-Yates","year":"1994","unstructured":"Baeza-Yates, R., Cunto, W., Manber, U., Wu, S.: Proximity matching using fixed-queries trees. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol.\u00a0807, pp. 198\u2013212. Springer, Heidelberg (1994)"},{"key":"86_CR3","first-page":"574","volume-title":"Proc. of the 21st Int. Conf. on Very Large Data Bases","author":"S. Brin","year":"1995","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proc. of the 21st Int. Conf. on Very Large Data Bases, pp. 574\u2013584. Morgan Kaufmann, San Francisco (1995)"},{"issue":"4","key":"86_CR4","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/362003.362025","volume":"16","author":"W.A. Burkhard","year":"1973","unstructured":"Burkhard, W.A., Keller, R.M.: Some approaches to best-match file searching. Communications of the ACM\u00a016(4), 230\u2013236 (1973)","journal-title":"Communications of the ACM"},{"key":"86_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/SPIRE.2000.878182","volume-title":"Proc. of the 7th Symp. on String Processing and Information Retrieval","author":"E. Ch\u00e1vez","year":"2000","unstructured":"Ch\u00e1vez, E., Navarro, G.: An effective clustering algorithm to index high dimensional metric spaces. In: Proc. of the 7th Symp. on String Processing and Information Retrieval, pp. 75\u201386. IEEE CS Press, Los Alamitos (2000)"},{"issue":"9","key":"86_CR6","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1016\/j.patrec.2004.11.014","volume":"26","author":"E. Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recognition Letters\u00a026(9), 1363\u20131376 (2005)","journal-title":"Pattern Recognition Letters"},{"issue":"3","key":"86_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"86_CR8","first-page":"426","volume-title":"Proc. of the 23rd Int. Conf. on Very Large Data Bases","author":"P. Ciaccia","year":"1997","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proc. of the 23rd Int. Conf. on Very Large Data Bases, pp. 426\u2013435. Morgan Kaufmann, San Francisco (1997)"},{"issue":"1","key":"86_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1025026030880","volume":"21","author":"V. Dohnal","year":"2003","unstructured":"Dohnal, V., Gennaro, C., Savino, P., Zezula, P.: D-index: Distance searching index for metric data sets. Multimedia Tools and Applications\u00a021(1), 9\u201333 (2003)","journal-title":"Multimedia Tools and Applications"},{"key":"86_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-45735-6_23","volume-title":"String Processing and Information Retrieval","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Reyes, N.: Fully dynamic spatial approximation trees. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 254\u2013270. Springer, Heidelberg (2002)"},{"issue":"3","key":"86_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E.V. Ruiz","year":"1986","unstructured":"Ruiz, E.V.: An algorithm for finding nearest neighbours in (approximately) constant average time. Pattern Recognition Letters\u00a04(3), 145\u2013157 (1986)","journal-title":"Pattern Recognition Letters"},{"key":"86_CR12","first-page":"219","volume-title":"Proc. of the 11th Int. Conf. on Information and Knowledge Management","author":"C. Traina Jr.","year":"2002","unstructured":"Traina Jr., C., Traina, A., Filho, R.S., Faloutsos, C.: How to improve the pruning ability of dynamic metric access methods. In: Proc. of the 11th Int. Conf. on Information and Knowledge Management, pp. 219\u2013226. ACM Press, New York (2002)"},{"key":"86_CR13","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. of the 4th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 311\u2013321 (1993)"}],"container-title":["Lecture Notes in Computer Science","Computer and Information Sciences - ISCIS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11569596_86.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:17Z","timestamp":1619505617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11569596_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540294146","9783540320852"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11569596_86","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}