Article

Approximate String Joins in a Database (Almost) for Free

Authors:

Luis Gravano,

Panagiotis G. Ipeirotis,

H. V. Jagadish,

Nick Koudas,

S. Muthukrishnan,

Divesh SrivastavaAuthors Info & Claims

VLDB '01: Proceedings of the 27th International Conference on Very Large Data Bases

Pages 491 - 500

Published: 11 September 2001 Publication History

Get Access

Abstract

No abstract available.

References

[1]

{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.

Digital Library

Google Scholar

[2]

{2} T. Bozkaya and Z. M. Ozsoyoglu. Distance based indexing for high dimensional metric spaces. In Proceedings of the 1997 ACM SIG-MOD Conference on Management of Data, pages 357-368, 1997.

Digital Library

Google Scholar

[3]

{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.

Digital Library

Google Scholar

[4]

{4} A. Cobbs. Fast approximate matching using suffix trees. In Combinatorial Pattern Matching, 6th Annual Symposium (CPM'95), pages 41-54, 1995.

Google Scholar

[5]

{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.

Digital Library

Google Scholar

[6]

{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.

Digital Library

Google Scholar

[7]

{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.

Digital Library

Google Scholar

[8]

{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.

Digital Library

Google Scholar

[9]

{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.

Digital Library

Google Scholar

[10]

{10} G. Navarro. A guided tour to approximate string matching. To appear in ACM Computing Surveys, 2001.

Digital Library

Google Scholar

[11]

{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.

Digital Library

Google Scholar

[12]

{12} T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. In Journal of Molecular Biology, 147:195-197, 1981.

Crossref

Google Scholar

[13]

{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.

Digital Library

Google Scholar

[14]

{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.

Digital Library

Google Scholar

[15]

{15} E. Ukkonen. Approximate string matching with q-grams and maximal matches. In Theoretical Computer Science (TCS), 92(1):191- 211, 1992.

Digital Library

Google Scholar

[16]

{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.

Crossref

Google Scholar

Cited By

View all

Wang JLi YBoehm MVarma PXin D(2022)MinunProceedings of the Sixth Workshop on Data Management for End-To-End Machine Learning10.1145/3533028.3533304(1-11)Online publication date: 12-Jun-2022
https://dl.acm.org/doi/10.1145/3533028.3533304
Siddiqui TChaudhuri SNarasayya V(2021)COMPAREProceedings of the VLDB Endowment10.14778/3476249.347629114:11(2419-2431)Online publication date: 27-Oct-2021
https://dl.acm.org/doi/10.14778/3476249.3476291
Bharadwaj SGupta PBhagwan RGuha S(2021)Discovering related data at scaleProceedings of the VLDB Endowment10.14778/3457390.345740314:8(1392-1400)Online publication date: 21-Oct-2021
https://dl.acm.org/doi/10.14778/3457390.3457403
Show More Cited By

Recommendations

Approximate string joins
SSDBM '03: Proceedings of the 15th International Conference on Scientific and Statistical Database Management

String data is ubiquitous and is commonly used to correlate (or join) entities across autonomous, heterogeneous databases. The main challenge is to effectively deal with the noisy nature of string data, due to, for example, transcription errors, ...
Locating maximal approximate runs in a string

An exact run in a string T is a non-empty substring of T that is a repetition of a smaller substring possibly followed by a prefix of it. Finding maximal exact runs in strings is an important problem and therefore a well-studied one in the area of ...
Probabilistic string similarity joins
SIGMOD '10: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data

Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific computing have to deal with fuzzy information in string attributes. Despite the ...

Comments

Information & Contributors

Information

Published In

VLDB '01: Proceedings of the 27th International Conference on Very Large Data Bases

September 2001

709 pages

ISBN:1558608044

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 11 September 2001

Qualifiers

Article

Conference

VLDB01

VLDB01: 27th International Conference on Very Large Data Bases

September 11 - 14, 2001

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

185
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang JLi YBoehm MVarma PXin D(2022)MinunProceedings of the Sixth Workshop on Data Management for End-To-End Machine Learning10.1145/3533028.3533304(1-11)Online publication date: 12-Jun-2022
https://dl.acm.org/doi/10.1145/3533028.3533304
Siddiqui TChaudhuri SNarasayya V(2021)COMPAREProceedings of the VLDB Endowment10.14778/3476249.347629114:11(2419-2431)Online publication date: 27-Oct-2021
https://dl.acm.org/doi/10.14778/3476249.3476291
Bharadwaj SGupta PBhagwan RGuha S(2021)Discovering related data at scaleProceedings of the VLDB Endowment10.14778/3457390.345740314:8(1392-1400)Online publication date: 21-Oct-2021
https://dl.acm.org/doi/10.14778/3457390.3457403
Galhotra SFirmani DSaha BSrivastava DLi GLi ZIdreos SSrivastava D(2021)BEERProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3452747(2711-2715)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3452747
Galhotra SFirmani DSaha BSrivastava D(2021)Efficient and effective ER with progressive blockingThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-021-00656-730:4(537-557)Online publication date: 13-Mar-2021
https://dl.acm.org/doi/10.1007/s00778-021-00656-7
Wu YZhang YWu J(2021)Configurable In-Database Similarity Search of Electronic Medical RecordsWeb Information Systems and Applications10.1007/978-3-030-87571-8_6(62-73)Online publication date: 24-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-87571-8_6
Koide SXiao CIshikawa Y(2020)Fast subtrajectory similarity search in road networks under weighted edit distance constraintsProceedings of the VLDB Endowment10.14778/3407790.340781813:12(2188-2201)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3407790.3407818
Ge TLi Z(2020)Approximate substring matching over uncertain stringsProceedings of the VLDB Endowment10.14778/3402707.34027174:11(772-782)Online publication date: 3-Jun-2020
https://dl.acm.org/doi/10.14778/3402707.3402717
Zhang HZhang QGupta RLiu YShah MRajan STang JPrakash B(2020)MinSearch: An Efficient Algorithm for Similarity Search under Edit DistanceProceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3394486.3403099(566-576)Online publication date: 23-Aug-2020
https://dl.acm.org/doi/10.1145/3394486.3403099
Papadakis GSkoutas DThanos EPalpanas T(2020)Blocking and Filtering Techniques for Entity ResolutionACM Computing Surveys10.1145/337745553:2(1-42)Online publication date: 20-Mar-2020
https://dl.acm.org/doi/10.1145/3377455
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations