{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T13:22:28Z","timestamp":1748352148547,"version":"3.40.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642276590"},{"type":"electronic","value":"9783642276606"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27660-6_7","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T15:14:28Z","timestamp":1326726868000},"page":"77-87","source":"Crossref","is-referenced-by-count":4,"title":["Multi Feature Indexing Network MUFIN for Similarity Search Applications"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Zezula","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Batko, M., Novak, D., Falchi, F., Zezula, P.: On scalability of the similarity search in the world of peers. In: INFOSCALE, pp. 1\u201312. ACM (2006)","DOI":"10.1145\/1146847.1146867"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-77088-6_1","volume-title":"Digital Libraries: Research and Development","author":"M. Batko","year":"2007","unstructured":"Batko, M., Novak, D., Falchi, F., Zezula, P.: MESSIF: Metric Similarity Search Implementation Framework. In: Thanos, C., Borri, F., Candela, L. (eds.) Digital Libraries: Research and Development. LNCS, vol.\u00a04877, pp. 1\u201310. Springer, Heidelberg (2007)"},{"key":"7_CR3","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: VLDB, pp. 426\u2013435. Morgan Kaufmann (1997)"},{"issue":"1","key":"7_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":"7_CR5","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1207\/s15516709cog0000_30","volume":"29","author":"L. Larkey","year":"2005","unstructured":"Larkey, L., Markman, A.B.: Processes of similarity judgment. Cognitive Science\u00a029, 1061\u20131076 (2005)","journal-title":"Cognitive Science"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.is.2010.10.002","volume":"36","author":"D. Novak","year":"2011","unstructured":"Novak, D., Batko, M., Zezula, P.: Metric index: An efficient and scalable solution for precise and approximate similarity search. Inf. Syst.\u00a036(4), 721\u2013733 (2011)","journal-title":"Inf. Syst."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Novak, D., Zezula, P.: M-Chord: A scalable distributed similarity search structure. In: INFOSCALE, pp. 1\u201310. IEEE (2006)","DOI":"10.1145\/1146847.1146866"},{"key":"7_CR8","volume-title":"Metric Spaces","author":"M. O\u2019Searcoid","year":"2006","unstructured":"O\u2019Searcoid, M.: Metric Spaces. Springer, Heidelberg (2006)"},{"key":"7_CR9","unstructured":"Samet, H.: Foundations of Multidimensional And Metric Data Structures. Series in Data Management Systems. Morgan Kaufmann (2006)"},{"key":"7_CR10","series-title":"Advances in Database Systems","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity Search: The Metric Space Approach","author":"P. Zezula","year":"2006","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Advances in Database Systems, vol.\u00a032. Springer, Heidelberg (2006)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Zezula, P., Savino, P., Rabitti, F., Amato, G., Ciaccia, P.: Processing M-trees with parallel resources. In: RIDE, pp. 147\u2013154. IEEE (1998)","DOI":"10.1109\/RIDE.1998.658289"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2012: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27660-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T21:48:56Z","timestamp":1742334536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27660-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276590","9783642276606"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27660-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}