Abstract
We present an index structure that, for a given keyword T and a tolerance value k, can find all documents in the database that contain the keyword T or other words that match T approximately (We say that two words match each other approximately if the edit distance between them does not exceed the tolerance value k). Let M denote the sum of the lengths of all words in the vocabulary and z the number of words in the vocabulary. The index takes O(M log z) time to construct and occupies O(M) storage. The locations of all the documents in the database that contain the keyword T or words that match T approximately, can be found in O(n(log z + on)) expected time where n is the length of the keyword T, z the number of words in the vocabulary, and o the number of words in the vocabulary that match T with an edit distance of at most k.
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
Aho, A.V., Hirschberg, D.S., Ullman, J.D.: Bounds on the Complexity of the Longest Common Subsequence Problem. Journal of the ACM 23(1), 1–12 (1976)
Noltmeier, H., Verbarg, K., Zirkelbach, C.: Monotonous bisector* trees - a tool for efficient partitioning of complex scenes of geometric objects. In: Monien, B., Ottmann, T. (eds.) Data Structures and Efficient Algorithms. LNCS, vol. 594, Springer, Heidelberg (1992)
Owolabi, O., McGregor, D.R.: Fast approximate string matching. Software - Practice and Experience 18(4), 387–393 (1988)
Shannon, C.E.: A mathematical theory of communications. The Bell Systems Techn. Journal 27, 379–423 (1948)
Sankoff, D., Kruskal, J.B. (eds.): TimeWarps, String Edits, And Macromolecules: The Theory And Practice Of Sequence Comparison. Addison-Wesley Publishing Company, Inc, Reading (1983)
Sutinen, E., Tarhio, J.: On Using q-gram Locations in Approximate String Matching. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 327–340. Springer, Heidelberg (1995)
Shaw, W.M., Wood, J.B., Wood, R.E., Tibbo, H.R.: The Cystic Fibrosis Database: Content and Research Opportunities. Library and Information Science Research 13, 347–366 (1991)
Ukkonen, E.: Approximate string matching with q-grams and maximal matches. Theoretical computer Science 92, 191–211 (1992)
Wong, C.K., Chandra, A.K.: Bounds for the string editing problem. Journal of the ACM 23(1), 13–16 (1976)
Zirkelbach, C.: Monotonous bisector trees and clustering problems, Report, Department of Computer Science, University ofWürzburg, Germany (1990)
Zirkelbach, C.: Geometrisches Clustern - ein metrischer Ansatz, Dissertation, Department of Computer Science, University of Würzburg, Germany (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shi, F. (2004). Fast Approximate Search in Text Databases. In: Li, Q., Wang, G., Feng, L. (eds) Advances in Web-Age Information Management. WAIM 2004. Lecture Notes in Computer Science, vol 3129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27772-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-27772-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22418-1
Online ISBN: 978-3-540-27772-9
eBook Packages: Springer Book Archive