{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:48:24Z","timestamp":1725698904419},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642321528"},{"type":"electronic","value":"9783642321535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32153-5_7","type":"book-chapter","created":{"date-parts":[[2012,8,3]],"date-time":"2012-08-03T13:30:43Z","timestamp":1344000643000},"page":"85-100","source":"Crossref","is-referenced-by-count":3,"title":["Cut-Region: A Compact Building Block for Hierarchical Metric Indexing"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Loko\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u0159emysl","family":"\u010cech","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Nov\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Skopal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Beecks, C., Loko\u010d, J., Seidl, T., Skopal, T.: Indexing the signature quadratic form distance for efficient content-based multimedia retrieval. In: Proc. ACM International Conference on Multimedia Retrieval (2011)","DOI":"10.1145\/1991996.1992020"},{"key":"7_CR2","first-page":"31","volume-title":"Proceedings of the 5th International Workshop on Ranking in Databases (DBRank 2011)","author":"C. Beecks","year":"2011","unstructured":"Beecks, C., Skopal, T., Schoeffmann, K., Seidl, T.: Towards large-scale multimedia exploration. In: Das, G., Hsristidis, V., Ilyas, I. (eds.) Proceedings of the 5th International Workshop on Ranking in Databases (DBRank 2011), pp. 31\u201333. VLDB, Seattle, WA, USA (2011)"},{"key":"7_CR3","unstructured":"Bolettieri, P., Esuli, A., Falchi, F., Lucchese, C., Perego, R., Piccioli, T., Rabitti, F.: CoPhIR: a test collection for content-based image retrieval. CoRR, abs\/0905.4627v2 (2009)"},{"issue":"3","key":"7_CR4","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"},{"issue":"9","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1109\/TPAMI.2007.70815","volume":"30","author":"E.C. Gonzalez","year":"2008","unstructured":"Gonzalez, E.C., Figueroa, K., Navarro, G.: Effective proximity retrieval by ordering permutations. IEEE Trans. Pattern Anal. Mach. Intell.\u00a030(9), 1647\u20131658 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In: VLDB 1997, pp. 426\u2013435 (1997)","DOI":"10.1145\/275487.275495"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1023\/B:VISI.0000042993.50813.60","volume":"61","author":"J.-M. Geusebroek","year":"2005","unstructured":"Geusebroek, J.-M., Burghouts, G.J., Smeulders, A.W.M.: The Amsterdam Library of Object Images. International Journal of Computer Vision\u00a061(1), 103\u2013112 (2005)","journal-title":"International Journal of Computer Vision"},{"key":"7_CR8","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)"},{"key":"7_CR9","unstructured":"Hettich, S., Bay, S.D.: The UCI KDD archive (1999), http:\/\/kdd.ics.uci.edu"},{"key":"7_CR10","first-page":"121","volume-title":"SISAP 2008: Proceedings of the First International Workshop on Similarity Search and Applications (SISAP 2008)","author":"L. Jakub","year":"2008","unstructured":"Jakub, L., Tom\u00e1\u0161, S.: On Reinsertions in M-tree. In: SISAP 2008: Proceedings of the First International Workshop on Similarity Search and Applications (SISAP 2008), pp. 121\u2013128. IEEE Computer Society, Washington, DC (2008)"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"M.L. Mico","year":"1994","unstructured":"Mico, 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."},{"issue":"4","key":"7_CR12","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_CR13","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann (2006)"},{"key":"7_CR14","unstructured":"Skopal, T.: Pivoting M-tree: A Metric Access Method for Efficient Similarity Search. In: Proceedings of the 4th Annual Workshop DATESO, Desn\u00e1, Czech Republic, pp. 21\u201331 (2004) ISBN 80-248-0457-3; also available at CEUR, vol. 98, ISSN 1613-0073, http:\/\/www.ceur-ws.org\/Vol-98"},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1292609.1292619","volume":"32","author":"T. Skopal","year":"2007","unstructured":"Skopal, T.: Unified framework for fast exact and approximate search in dissimilarity spaces. ACM Transactions on Database Systems\u00a032(4), 1\u201346 (2007)","journal-title":"ACM Transactions on Database Systems"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jda.2008.09.013","volume":"7","author":"T. Skopal","year":"2009","unstructured":"Skopal, T., Loko\u010d, J.: New Dynamic Construction Techniques for M-tree. Journal of Discrete Algorithms\u00a07(1), 62\u201377 (2009)","journal-title":"Journal of Discrete Algorithms"},{"key":"7_CR17","unstructured":"Skopal, T., Loko\u010d, J.: Answering Metric Skyline Queries by PM-tree. In: Proceedings of the Dateso 2010 Workshop, vol.\u00a0567, pp. 22\u201337. Matfyz Press (2010)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11408079_73","volume-title":"Database Systems for Advanced Applications","author":"T. Skopal","year":"2005","unstructured":"Skopal, T., Pokorn\u00fd, J., Sn\u00e1\u0161el, V.: Nearest Neighbours Search Using the PM-Tree. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol.\u00a03453, pp. 803\u2013815. Springer, Heidelberg (2005)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Springer (2005)","DOI":"10.1007\/0-387-29151-2"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32153-5_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T04:10:23Z","timestamp":1714277423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32153-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321528","9783642321535"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32153-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}