{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T02:40:04Z","timestamp":1746412804673,"version":"3.40.4"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319119878"},{"type":"electronic","value":"9783319119885"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11988-5_9","type":"book-chapter","created":{"date-parts":[[2014,10,8]],"date-time":"2014-10-08T13:15:40Z","timestamp":1412774140000},"page":"94-105","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic List of Clusters in Secondary Memory"],"prefix":"10.1007","author":[{"given":"Gonzalo","family":"Navarro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nora","family":"Reyes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"9_CR1","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":"9_CR2","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.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"9_CR3","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: Proc. 23rd VLDB, pp. 426\u2013435 (1997)"},{"issue":"1","key":"9_CR4","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":"9_CR5","doi-asserted-by":"crossref","unstructured":"Santos Filho, R.F., Traina, A.J.M., Traina Jr., C., Faloutsos, C.: Similarity search without tears: The OMNI family of all-purpose access methods. In: Proc. 17th ICDE, pp. 623\u2013630 (2001)","DOI":"10.1109\/ICDE.2001.914877"},{"key":"9_CR6","series-title":"SCI","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-03625-5_9","volume-title":"Swarm Intelligence for Multi-objective Problems in Data Mining","author":"M.L. Hetland","year":"2009","unstructured":"Hetland, M.L.: The basic principles of metric indexing. In: Coello, C.A.C., Dehuri, S., Ghosh, S. (eds.) Swarm Intelligence for Multi-objective Problems in Data Mining. SCI, vol.\u00a0242, pp. 199\u2013232. Springer, Heidelberg (2009)"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"G. Hjaltason","year":"2003","unstructured":"Hjaltason, G., Samet, H.: Index-driven similarity search in metric spaces. ACM Transactions on Database Systems\u00a028(4), 517\u2013580 (2003)","journal-title":"ACM Transactions on Database Systems"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H.V. Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.-L., Yu, C., Zhang, R.: iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems\u00a030(2), 364\u2013397 (2005)","journal-title":"ACM Transactions on Database Systems"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1007\/11569596_86","volume-title":"Computer and Information Sciences - ISCIS 2005","author":"M. Mamede","year":"2005","unstructured":"Mamede, M.: Recursive lists of clusters: A dynamic data structure for range queries in metric spaces. In: Yolum, p., G\u00fcng\u00f6r, T., G\u00fcrgen, F., \u00d6zturan, C. (eds.) ISCIS 2005. LNCS, vol.\u00a03733, pp. 843\u2013853. Springer, Heidelberg (2005)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Navarro, G., Reyes, N.: Dynamic spatial approximation trees. ACM Journal of Experimental Algorithmics\u00a012:article 1.5 (2009)","DOI":"10.1145\/1227161.1322337"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Navarro, G., Reyes, N.: Dynamic spatial approximation trees for massive data. In: Proc. 2nd SISAP, pp. 81\u201388 (2009)","DOI":"10.1109\/SISAP.2009.28"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/j.is.2011.01.002","volume":"36","author":"G. Navarro","year":"2011","unstructured":"Navarro, G., Uribe, R.: Fully dynamic metric access methods based on hyperplane partitioning. Information Systems\u00a036(4), 734\u2013747 (2011)","journal-title":"Information Systems"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-41062-8_12","volume-title":"Similarity Search and Applications","author":"G. Ruiz","year":"2013","unstructured":"Ruiz, G., Santoyo, F., Ch\u00e1vez, E., Figueroa, K., Tellez, E.S.: Extreme pivots for faster metric indexes. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) SISAP 2013. LNCS, vol.\u00a08199, pp. 115\u2013126. Springer, Heidelberg (2013)"},{"key":"9_CR14","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers Inc. (2005)"},{"key":"9_CR15","unstructured":"Skopal, T., Pokorn\u00fd, J., Sn\u00e1sel, V.: PM-tree: Pivoting metric tree for similarity search in multimedia databases. In: ADBIS (Local Proceedings) (2004)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Advances in Database Systems, vol.\u00a032. Springer (2006)","DOI":"10.1007\/0-387-29151-2"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11988-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T02:00:33Z","timestamp":1746410433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11988-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319119878","9783319119885"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11988-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}