{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:03:00Z","timestamp":1775638980228,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642396397","type":"print"},{"value":"9783642396403","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39640-3_42","type":"book-chapter","created":{"date-parts":[[2013,6,21]],"date-time":"2013-06-21T02:25:58Z","timestamp":1371781558000},"page":"574-589","source":"Crossref","is-referenced-by-count":11,"title":["MX-tree: A Double Hierarchical Metric Index with Overlap Reduction"],"prefix":"10.1007","author":[{"given":"Shichao","family":"Jin","sequence":"first","affiliation":[]},{"given":"Okhee","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Wenya","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","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, pp. 426\u2013435 (1997)","DOI":"10.1145\/275487.275495"},{"issue":"2","key":"42_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D.E. Comer","year":"1979","unstructured":"Comer, D.E.: The Ubiquitous B-tree. ACM Computing Surveys\u00a011(2), 121\u2013137 (1979)","journal-title":"ACM Computing Surveys"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","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.J.M., 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, pp. 51\u201365. Springer, Heidelberg (2000)"},{"key":"42_CR4","unstructured":"Vieira, M.R., Traina Jr., C., Chino, F.J.T., Traina, A.J.M.: DBM-tree: A Dynamic Metric Access Method Sensitive to Local Density Data. In: SBBD, pp. 163\u2013177 (2004)"},{"key":"42_CR5","unstructured":"Skopal, T.: Pivoting M-tree: A Metric Access Method for Efficient Similarity Search. In: DATESO, pp. 27\u201337 (2004)"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Traina Jr., C., Traina, A.J.M., Filho, R.F.S., Faloutsos, C.: How to Improve the Pruning Ability of Dynamic Metric Access Methods. In: CIKM, pp. 219\u2013226 (2002)","DOI":"10.1145\/584792.584831"},{"key":"42_CR7","unstructured":"Zhou, X., Wang, G., Yu, J.X., Yu, G.: M\u2009+\u2009-tree: A New Dynamical Multidimensional Index for Metric Spaces. In: ADC, pp. 161\u2013168 (2003)"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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\u2009+\u2009-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)"},{"key":"42_CR9","unstructured":"Ciaccia, P., Patella, M.: The M2-tree: Processing Complex Multi-feature Queries with Just One Index. In: DELOS Workshop (2000)"},{"key":"42_CR10","unstructured":"Ciaccia, P., Patella, M.: Bulk Loading the M-tree. In: ADC, pp. 15\u201326 (1998)"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.-L., Vu, Q.H., Zhang, R.: Speeding Up Search in Peer-to-Peer Networks with a Multi-way Tree Structure. In: SIGMOD, pp. 1\u201312 (2006)","DOI":"10.1145\/1142473.1142475"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A Dynamic Index Structure for Special Searching. In: SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"42_CR13","unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: The R\u2009+\u2009-tree: A Dynamic Index for Multi-dimensional Data. In: VLDB (1987)"},{"issue":"2","key":"42_CR14","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"H.-P. Kriegel","year":"1990","unstructured":"Kriegel, H.-P., Schneider, R., Seeger, B., Beckmann, N.: The R*-tree: A Efficient and Robust Access Method for Points and Rectangles. Sigmod Record\u00a019(2), 322\u2013331 (1990)","journal-title":"Sigmod Record"},{"key":"42_CR15","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An Index Structure for High-dimensional Data. In: VLDB, pp. 28\u201339 (1996)"},{"issue":"1","key":"42_CR16","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. The American Mathematical Society\u00a07(1), 48\u201350 (1956)","journal-title":"The American Mathematical Society"},{"issue":"6","key":"42_CR17","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest Connection Networks and Some Generalizations. Bell System Technical Journal\u00a036(6), 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"key":"42_CR18","unstructured":"Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized Search Trees for Databases Systems. In: VLDB, pp. 562\u2013573 (1995)"},{"key":"42_CR19","unstructured":"Levenshtein, V.I.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady\u00a010 (1966)"},{"key":"42_CR20","unstructured":"Yianilos, P.N.: Data Structures and Algorithms for Nearest Neighbour Search in General Metric Spaces. In: SODA, pp. 311\u2013321 (1993)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39640-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T17:49:56Z","timestamp":1674496196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-39640-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396397","9783642396403"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39640-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}