Abstract
Large multimedia repositories often call for a highly efficient index supported by external memories, in order to fast retrieve the desired information. The M-tree, one of the metric trees, is a well-tested and dynamic index structure for similarity search in metric spaces where various distance measures can be applied. Nevertheless, its performance is undermined dramatically by the number of paths it has to traverse, which consequently increases CPU and I/O costs both. In this paper, an analysis has been performed to demonstrate the gravity of this issue. As a result, we propose a novel index structure called the MX-tree. It introduces the super node, which is inspired by the X-tree in the spatial search area, and the MX-tree fully extends the super node to metric spaces. Besides, a new node split method is presented in the MX-tree to meet the need of the low cost of index construction. This proposed method uses only O(n 2) runtime to split the overfull node without tuning any parameter while the search performance of the whole index is still guaranteed compared to the node split policy with O(n 2) in the M-tree. In addition, an internal index is proposed in the MX-tree to seamlessly handle the CPU costs in the extended leaf nodes due to the introduction of the super node. Compared to other former improvements of the M-tree, the MX-tree retains all the merits of the M-tree without any post-processing steps or losing the applicability. To survey the proposed index, we conduct extensive experiments, and experimental evaluations illustrate the efficiency of the MX-tree with regard to both CPU and I/O costs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ciaccia, P., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In: VLDB, pp. 426–435 (1997)
Comer, D.E.: The Ubiquitous B-tree. ACM Computing Surveys 11(2), 121–137 (1979)
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. 1777, pp. 51–65. Springer, Heidelberg (2000)
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–177 (2004)
Skopal, T.: Pivoting M-tree: A Metric Access Method for Efficient Similarity Search. In: DATESO, pp. 27–37 (2004)
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–226 (2002)
Zhou, X., Wang, G., Yu, J.X., Yu, G.: M + -tree: A New Dynamical Multidimensional Index for Metric Spaces. In: ADC, pp. 161–168 (2003)
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. 3453, pp. 398–409. Springer, Heidelberg (2005)
Ciaccia, P., Patella, M.: The M2-tree: Processing Complex Multi-feature Queries with Just One Index. In: DELOS Workshop (2000)
Ciaccia, P., Patella, M.: Bulk Loading the M-tree. In: ADC, pp. 15–26 (1998)
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–12 (2006)
Guttman, A.: R-trees: A Dynamic Index Structure for Special Searching. In: SIGMOD, pp. 47–57 (1984)
Sellis, T., Roussopoulos, N., Faloutsos, C.: The R + -tree: A Dynamic Index for Multi-dimensional Data. In: VLDB (1987)
Kriegel, H.-P., Schneider, R., Seeger, B., Beckmann, N.: The R*-tree: A Efficient and Robust Access Method for Points and Rectangles. Sigmod Record 19(2), 322–331 (1990)
Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An Index Structure for High-dimensional Data. In: VLDB, pp. 28–39 (1996)
Kruskal, J.B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. The American Mathematical Society 7(1), 48–50 (1956)
Prim, R.C.: Shortest Connection Networks and Some Generalizations. Bell System Technical Journal 36(6), 1389–1401 (1957)
Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized Search Trees for Databases Systems. In: VLDB, pp. 562–573 (1995)
Levenshtein, V.I.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady 10 (1966)
Yianilos, P.N.: Data Structures and Algorithms for Nearest Neighbour Search in General Metric Spaces. In: SODA, pp. 311–321 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jin, S., Kim, O., Feng, W. (2013). MX-tree: A Double Hierarchical Metric Index with Overlap Reduction. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2013. ICCSA 2013. Lecture Notes in Computer Science, vol 7975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39640-3_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-39640-3_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39639-7
Online ISBN: 978-3-642-39640-3
eBook Packages: Computer ScienceComputer Science (R0)