Approximate string joins in a database (almost) for free

VLDB 2001 - Proceedings of 27th International Conference on Very Large Data Bases

Volumn , Issue , 2001, Pages 491-500

  Gravano, Luis ^a   Ipeirotis, Panagiotis G ^a   Jagadish, H V ^b   Koudas, Nick ^c   Muthukrishnan, S ^c   Srivastava, Divesh ^c  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE QUERY; APPROXIMATE STRING JOIN; APPROXIMATE STRING MATCHES; COMMERCIAL DATABASE SYSTEM; COMPLEX QUERIES; PROTOTYPE IMPLEMENTATIONS; TYPOGRAPHICAL ERRORS; USER DEFINED FUNCTIONS;

DATABASE SYSTEMS;

EID: 84944318804     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. R. Baeza-Yates and G. Gonnet. A fast algorithm on average for all-against-all sequence matching. In Proceedings of String Processing and Information Retrieval Symposium (SPIRE'99), pages 16-23, 1999.
2. T. Bozkaya and Z. M. Ozsoyoglu. Distance based indexing for high dimensional metric spaces. In Proceedings of the 1997 ACM SIGMOD Conference on Management of Data, pages 357-368,1997.
3. S. Brin. Near neighbor search in large metric spaces. In Proceedings of the 21st International Conference on Very Large Databases (VLDB'95), pages 574-584, 1995.
4. A. Cobbs. Fast approximate matching using suffix trees. In Combinatorial Pattern Matching, 6th Annual Symposium (CPM'95), pages 41-54, 1995.
5. W. Cohen. Integration of heterogeneous databases without common domains using queries based on textual similarity. In Proceedings of the 1998 ACM SIGMOD Conferenceon Managementof Data, pages 201-212, 1998.
6. D. J. DeWitt, J. F. Naughton, and D. A. Schneider. An evaluation of non-equijoin algorithms. In Proceedings of the 17th International Conference on Very Large Databases (VLDB'91), pages 443-452, 1991.
7. D. A. Grossman, O. Frieder, D. O. Holmes, and D. C. Roberts. Integrating structured data and text: A relational approach. In Journal of the American Society for Information Science (JASIS), 48(2):122-132, 1997.
8. C. Lundquist, O. Frieder, D. O. Holmes, and D. A. Grossman. A parallel relational database management system approach to relevance feedback in information retrieval. In Journal of the American Society for Information Science (JASIS), 50(5):413-426, 1999.
9. U. Manber and S. Wu. GLIMPSE: A tool to search through entire file systems. In Proceedings of USENIX Winter 1994 Technical Conference, pages 23-32, 1994.
10. G. Navarro. A guided tour to approximate string matching. To appear in ACM Computing Surveys, 2001.
11. S. Sahinalp and U. Vishkin. Efficient approximate and dynamic matching of patterns using a labeling paradigm (extended abstract). In 37th Annual Symposium on Foundations of Computer Science, pages 320-328, 1996.
12. T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. In Journal of Molecular Biology, 147:195-197, 1981.
13. E. Sutinen and J. Tarhio. On using q-gram locations in approximate string matching. In Proceedings of Third Annual European Symposium (ESA'95), pages 327-340, 1995.
14. E. Sutinen and J. Tarhio. Filtration with q -samples in approximate string matching. In Combinatorial Pattern Matching, 7th Annual Symposium (CPM'96), pages 50-63, 1996.
15. E. Ukkonen. Approximate string matching with q-grams and maximal matches. In Theoretical Computer Science (TCS), 92(1):191-211, 1992
16. J. Ullman. A binary n-gram technique for automatic correction of substitution, deletion, insertion, and reversal errors in words. In The Computer Journal 20(2):141-147, 1977.