{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:19:45Z","timestamp":1740028785834,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121784"},{"type":"electronic","value":"9783642121791"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12179-1_37","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T19:23:41Z","timestamp":1270063421000},"page":"443-457","source":"Crossref","is-referenced-by-count":2,"title":["On the Configuration of the Similarity Search Data Structure D-Index for High Dimensional Objects"],"prefix":"10.1007","author":[{"given":"Arnoldo Jos\u00e9","family":"M\u00fcller-Molina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Shinohara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","first-page":"111","volume-title":"SCAM 2007","author":"A.J. M\u00fcller-Molina","year":"2007","unstructured":"M\u00fcller-Molina, A.J., Shinohara, T.: Fast approximate matching of programs for protecting libre\/open source software by using spatial indexes. In: SCAM 2007, pp. 111\u2013122. IEEE Computer Society, Washington (2007)"},{"issue":"1","key":"37_CR2","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 Appl.\u00a021(1), 9\u201333 (2003)","journal-title":"Multimedia Tools Appl."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Mic\u00f3, L., Oncina, J., Vidal, E.: An algorithm for finding nearest neighbours in constant averagetime with a linear space complexity. In: Recognition Methodology and Systems, pp. 557\u2013560 (1992)","DOI":"10.1109\/ICPR.1992.201840"},{"issue":"3","key":"37_CR4","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 Recogn. Lett.\u00a04(3), 145\u2013157 (1986)","journal-title":"Pattern Recogn. Lett."},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-45884-0_14","volume-title":"Progress in Discovery Science","author":"T. Shinohara","year":"2002","unstructured":"Shinohara, T., Ishizaka, H.: On dimension reduction mappings for approximate retrieval of multi-dimensional data. In: Progress in Discovery Science, London, UK, pp. 224\u2013231. Springer, Heidelberg (2002)"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1109\/ICDE.2001.914877","volume-title":"Proceedings of the 17th International Conference on Data Engineering","author":"R.F.S. Filho","year":"2001","unstructured":"Filho, R.F.S., Traina, A.J.M., Caetano Traina, J., Faloutsos, C.: Similarity search without tears: The omni family of all-purpose access methods. In: Proceedings of the 17th International Conference on Data Engineering, pp. 623\u2013630. IEEE Computer Society, Washington (2001)"},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"M.L. Mic\u00f3","year":"1994","unstructured":"Mic\u00f3, M.L., Oncina, J., Vidal, E.: A new version of the nearest-neighbour approximating and eliminating search algorithm (aesa) with linear preprocessing time and memory requirements. Pattern Recogn. Lett.\u00a015(1), 9\u201317 (1994)","journal-title":"Pattern Recogn. Lett."},{"key":"37_CR8","first-page":"1","volume-title":"MIR 2001","author":"C. Gennaro","year":"2001","unstructured":"Gennaro, C., Savino, P., Zezula, P.: Similarity search in metric databases through hashing. In: MIR 2001, pp. 1\u20135. ACM, New York (2001)"},{"key":"37_CR9","unstructured":"Yianilos, P.N.: Excluded middle vantage point forests for nearest neighbor search. Technical report, NEC Research Institute, Princeton, NJ (1998)"},{"key":"37_CR10","first-page":"275","volume-title":"CASCON 2006","author":"A.J. M\u00fcller-Molina","year":"2006","unstructured":"M\u00fcller-Molina, A.J., Shinohara, T.: On approximate matching of programs for protecting libre software. In: CASCON 2006, pp. 275\u2013289. ACM Press, New York (2006)"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. ACM Commun., 422\u2013426 (1970)","DOI":"10.1145\/362686.362692"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-00399-8_8","volume-title":"New Frontiers in Applied Data Mining","author":"A.J. M\u00fcller-Molina","year":"2009","unstructured":"M\u00fcller-Molina, A.J., Hirata, K., Shinohara, T.: A tree distance function based on multi-sets. In: Chawla, S., Washio, T., Minato, S.-i., Tsumoto, S., Onoda, T., Yamada, S., Inokuchi, A. (eds.) PAKDD 2008. LNCS, vol.\u00a05433, pp. 87\u201398. Springer, Heidelberg (2009)"},{"key":"37_CR13","first-page":"146","volume-title":"ALP","author":"E. Demaine","year":"2007","unstructured":"Demaine, E., Mosez, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. In: ALP, pp. 146\u2013157. Springer, Heidelberg (2007)"},{"key":"37_CR14","first-page":"313","volume-title":"ICDE 2004","author":"R. Zhang","year":"2004","unstructured":"Zhang, R., Ooi, B.C., Tan, K.L.: Making the pyramid technique robust to query types and workloads. In: ICDE 2004, p. 313. IEEE Computer Society, Washington (2004)"},{"key":"37_CR15","volume-title":"Similarity Search: The Metric Space Approach","author":"P. Zezula","year":"2005","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Springer, Secaucus (2005)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12179-1_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T20:11:35Z","timestamp":1739995895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12179-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121784","9783642121791"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12179-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}