Abstract
Similarity join in distance spaces constrained by the metric postulates is the necessary complement of more famous similarity range and the nearest neighbor search primitives. However, the quadratic computational complexity of similarity joins prevents from applications on large data collections. We present the eD-Index, an extension of D-index, and we study an application of the eD-Index to implement two algorithms for similarity self joins, i.e. the range query join and the overloading join. Though also these approaches are not able to eliminate the intrinsic quadratic complexity of similarity joins, significant performance improvements are confirmed by experiments.
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
Chavez, E., Navarro, G., Baeza-Yates, R., Marroquin, J.: Searching in Metric Spaces. ACM Computing Surveys 33(3), 273–321 (2001)
Dohnal, V., Gennaro, C., Savino, P., Zezula, P.: D-Index: Distance Searching Index for Metric Data Sets. In: ACM Multimedia Tools and Applications 21(1) (September 2003) (to appear)
Dohnal, V., Gennaro, C., Zezula, P.: A Metric Index for Approximate Text Management. In: Proceedings of IASTED International Conference on Information Systems and Databases (ISDB 2002), Tokyo, Japan, pp. 37–42 (2002)
Galhardas, H., Florescu, D., Shasha, D., Simon, E., Saita, C.A.: Declarative Data Cleaning: Language, Model, and Algorithms. In: Proceedings of the 27th VLDB Conference, Rome, Italy, pp. 371–380 (2001)
Gennaro, C., Savino, P., Zezula, P.: Similarity Search in Metric Databases through Hashing. In: Proceedings of ACM Multimedia 2001 Workshops, Ottawa, Canada, pp. 1–5 (October 2001)
Gravano, L., Ipeirotis, P.G., Jagadish, H.V., Koudas, N., Muthukrishnan, S., Srivastava, D.: Approximate String Joins in a Database (Almost) for Free. In: Proceedings of the 27th VLDB Conference, Rome, Italy, pp. 491–500 (2001)
Guha, S., Jagadish, H.V., Koudas, N., Srivastava, D., Yu, T.: Approximate XML Joins. In: Proceedings of ACM SIGMOD 2002, Madison,Wisconsin, June 3–6 (2002)
Kukich, K.: Techniques for automatically correcting words in text. ACM Computing Surveys 24(4), 377–439 (1992)
Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys 33(1), 31–88 (2001)
Yianilos, P.N.: Excluded Middle Vantage Point Forests for Nearest Neighbor Search. Tech. rep., NEC Research Institute, 1999, Presented at Sixth DIMACS Implementation Challenge: Nearest Neighbor Searches workshop, January 15 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dohnal, V., Gennaro, C., Zezula, P. (2003). Similarity Join in Metric Spaces Using eD-Index. In: MaÅ™Ãk, V., Retschitzegger, W., Å tÄ›pánková, O. (eds) Database and Expert Systems Applications. DEXA 2003. Lecture Notes in Computer Science, vol 2736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45227-0_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-45227-0_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40806-2
Online ISBN: 978-3-540-45227-0
eBook Packages: Springer Book Archive