{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:49:21Z","timestamp":1771699761372,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540751847","type":"print"},{"value":"9783540751854","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75185-4_14","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T15:47:58Z","timestamp":1189007278000},"page":"172-188","source":"Crossref","is-referenced-by-count":14,"title":["Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Skopal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Hoksza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1093\/nar\/28.1.15","volume":"28","author":"D.A. Benson","year":"2000","unstructured":"Benson, D.A., Karsch-Mizrachi, I., Lipman, D.J., Ostell, J., Rapp, B.A., Wheeler, D.L.: Genbank. Nucleic Acids Res.\u00a028(1), 15\u201318 (2000)","journal-title":"Nucleic Acids Res."},{"issue":"14","key":"14_CR2","doi-asserted-by":"publisher","first-page":"2357","DOI":"10.1016\/S0167-8655(03)00065-5","volume":"24","author":"B. Bustos","year":"2003","unstructured":"Bustos, B., Navarro, G., Ch\u00e1vez, E.: Pivot selection techniques for proximity searching in metric spaces. Pattern Recognition Letters\u00a024(14), 2357\u20132366 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/1178677.1178698","volume-title":"Proceedings of ACM Multimedia, MIR workshop","author":"B. Bustos","year":"2006","unstructured":"Bustos, B., Skopal, T.: Dynamic Similarity Search in Multi-Metric Spaces. In: Proceedings of ACM Multimedia, MIR workshop, pp. 137\u2013146. ACM Press, New York (2006)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-44808-X_12","volume-title":"Algorithm Engineering and Experimentation","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G.: A Probabilistic Spell for the Curse of Dimensionality. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol.\u00a02153, pp. 147\u2013160. Springer, Heidelberg (2001)"},{"key":"14_CR5","unstructured":"Ciaccia, P., Patella, M.: The M2-tree: Processing Complex Multi-Feature Queries with Just One Index. In: DELOS Workshop: Information Seeking, Searching and Querying in Digital Libraries, Zurich, Switzerland (June 2000)"},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/582410.582412","volume":"27","author":"P. Ciaccia","year":"2002","unstructured":"Ciaccia, P., Patella, M.: Searching in metric spaces with user-defined and approximate distances. ACM Database Systems\u00a027(4), 398\u2013437 (2002)","journal-title":"ACM Database Systems"},{"key":"14_CR7","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"},{"key":"14_CR8","unstructured":"Hettich, S., Bay, S.: The UCI KDD archive (1999), http:\/\/kdd.ics.uci.edu"},{"key":"14_CR9","unstructured":"Mic \u00f3, M.L., Oncina, J., Vidal, E.: An algorithm for finding nearest neighbour in constant average time with a linear space complexity. In: Int. Cnf. on Pattern Recog. (1992)"},{"key":"14_CR10","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. CEUR, vol.\u00a098, pp. 21\u201331 (2004), http:\/\/www.ceur-ws.org\/Vol-98 ISBN 80-248-0457-3, ISSN 1613-0073"},{"key":"14_CR11","unstructured":"Skopal, T., Hoksza, D.: Electronic supplement for this paper (2007), http:\/\/siret.ms.mff.cuni.cz\/skopal\/pub\/suppADBIS07.pdf"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-540-39403-7_13","volume-title":"Advances in Databases and Information Systems","author":"T. Skopal","year":"2003","unstructured":"Skopal, T., Pokorn\u00fd, J., Kr\u00e1tk\u00fd, M., Sn\u00e1\u0161el, V.: Revisiting M-tree Building Principles. In: Kalinichenko, L.A., Manthey, R., Thalheim, B., Wloka, U. (eds.) ADBIS 2003. LNCS, vol.\u00a02798, pp. 148\u2013162. Springer, Heidelberg (2003)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46439-5_4","volume-title":"Advances in Database Technology - EDBT 2000","author":"C. Traina Jr.","year":"2000","unstructured":"Traina Jr., C., Traina, A., Seeger, B., Faloutsos, C.: Slim-Trees: High performance metric trees minimizing overlap between nodes. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, Springer, Heidelberg (2000)"},{"key":"14_CR15","volume-title":"Similarity Search: The Metric Space Approach (Advances in Database Systems","author":"P. Zezula","year":"2005","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach (Advances in Database Systems. Springer, New York (2005)"},{"key":"14_CR16","unstructured":"Zhou, X., Wang, G., Xu, J.Y., Yu, G.: M\u2009+\u2009-tree: A New Dynamical Multidimensional Index for Metric Spaces. In: Proceedings of the Fourteenth Australasian Database Conference - ADC 2003, Adelaide, Australia (2003)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/11408079_36","volume-title":"Database Systems for Advanced Applications","author":"X. Zhou","year":"2005","unstructured":"Zhou, X., Wang, G., Zhou, X., Yu, G.: BM+-Tree: A Hyperplane-Based Index Method for High-Dimensional Metric Spaces. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol.\u00a03453, pp. 398\u2013409. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75185-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T19:26:26Z","timestamp":1708197986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75185-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751847","9783540751854"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75185-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}