DBScholar

Back to papers

Approximate String Joins in a Database (Almost) for Free

Summary: Proposes approximate string joins on commercial DBs via q-grams; encodes match positions and counts, rewriting the predicate as a relational expression. Shows gains vs UDFs for full-string and substring joins; validated on real data and a prototype. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hee20d4f8857d69bc
Venue
VLDB
Year
2001
Pagerank
0.00032945275
Overall Rank
108 | 99.28%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{gravano_vldb01,
        title = {{Approximate String Joins in a Database (Almost) for Free}},
        author = {Gravano, Luis and Ipeirotis, Panagiotis G. and Jagadish, H. V. and Koudas, Nick and Muthukrishnan, S. and Srivastava, Divesh},
        journal = {PVLDB},
        series = {{VLDB} '01},
        year = {2001}
}

Incoming Citations (Sorted by Pagerank)

Showing 50 of 78 citing papers.

Rank Citing Paper Year Venue Pagerank
162 Robust and Efficient Fuzzy Match for Online Data Cleaning 2003 SIGMOD 0.00027626077
169 Efficient Exact Set-Similarity Joins 2006 VLDB 0.00027077763
202 Efficient set joins on similarity predicates 2004 SIGMOD 0.00025244506
206 Declarative Data Cleaning: Language, Model, and Algorithms 2001 VLDB 0.00025121652
229 Robust and Fast Similarity Search for Moving Object Trajectories 2005 SIGMOD 0.00023850907
308 Eliminating Fuzzy Duplicates in Data Warehouses 2002 VLDB 0.0002143466
359 Efficient Parallel Set-Similarity Joins Using MapReduce 2010 SIGMOD 0.00019963275
435 Mining Database Structure; Or, How to Build a Data Quality Browser 2002 SIGMOD 0.00018277436
535 On Active Learning of Record Matching Packages 2010 SIGMOD 0.00016768308
934 Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints 2008 VLDB 0.00012973416
966 Can We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search 2012 SIGMOD 0.00012777679
1,068 VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams 2007 VLDB 0.00012170201
1,582 Example-driven Design of Efficient Record Matching Queries 2007 VLDB 0.0001015019
1,751 Extending Autocompletion To Tolerate Errors 2009 SIGMOD 9.7128647e-05
1,769 Structured Querying of Web Text: A Technical Challenge 2007 CIDR 9.6796356e-05
1,941 Pass-Join: A Partition-based Method for Similarity Joins 2012 VLDB 9.3141839e-05
2,084 Bed-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance 2010 SIGMOD 9.0533042e-05
2,120 Comparative Analysis of Approximate Blocking Techniques for Entity Resolution 2016 VLDB 8.9985078e-05
2,158 Cost-Based Variable-Length-Gram Selection for String Collections to Support Approximate Queries Efficiently 2008 SIGMOD 8.9272802e-05
2,235 String Similarity Joins: An Experimental Evaluation 2014 VLDB 8.7832223e-05
2,271 ZeroER: Entity Resolution using Zero Labeled Examples 2020 SIGMOD 8.7110698e-05
2,362 Hashed Samples: Selectivity Estimators For Set Similarity Selection Queries 2008 VLDB 8.5601252e-05
2,757 Approximate XML Joins 2002 SIGMOD 8.0313227e-05
2,957 Spatio-Textual Similarity Joins 2013 VLDB 7.799694e-05
2,981 Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance 2007 VLDB 7.7739779e-05
3,118 Similarity Evaluation on Tree-structured Data 2005 SIGMOD 7.6114853e-05
3,270 Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme 2011 SIGMOD 7.4613275e-05
3,412 Benchmarking Declarative Approximate Selection Predicates 2007 SIGMOD 7.3073062e-05
3,511 An Efficient Filter for Approximate Membership Checking 2008 SIGMOD 7.22602e-05
3,522 Efficient Approximate Entity Extraction with Edit Distance Constraints 2009 SIGMOD 7.2167201e-05
3,596 Merging the Results of Approximate Match Operations 2004 VLDB 7.1625707e-05
3,745 BLAST: a Loosely Schema-aware Meta-blocking Approach for Entity Resolution 2016 VLDB 7.0370829e-05
3,822 Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints 2010 VLDB 6.9814064e-05
4,080 Smurf: Self-Service String Matching Using Random Forests 2019 VLDB 6.8020845e-05
4,138 Selectivity Estimation for Fuzzy String Predicates in Large Data Sets 2005 VLDB 6.7706361e-05
4,462 Incremental Maintenance of Length Normalized Indexes for Approximate String Matching 2009 SIGMOD 6.5751733e-05
4,515 Approximate String Joins with Abbreviations 2018 VLDB 6.5529885e-05
4,679 Approximate Matching of Hierarchical Data Using pq-Grams 2005 VLDB 6.4567077e-05
4,878 Probabilistic String Similarity Joins 2010 SIGMOD 6.3569172e-05
5,036 Discovering Related Data At Scale 2021 VLDB 6.2907736e-05
5,070 BEER: Blocking for Effective Entity Resolution 2021 SIGMOD 6.2760011e-05
5,085 Supervised Meta-blocking 2014 VLDB 6.2672402e-05
5,135 SEAL: Spatio-Textual Similarity Search 2012 VLDB 6.245475e-05
5,167 Schema-agnostic vs Schema-based Configurations for Blocking Methods on Homogeneous Data 2016 VLDB 6.2335794e-05
5,215 Fast Subtrajectory Similarity Search in Road Networks under Weighted Edit Distance Constraints 2020 VLDB 6.2135023e-05
5,233 String Similarity Measures and Joins with Synonyms 2013 SIGMOD 6.2049921e-05
5,348 On Indexing Error-Tolerant Set Containment 2010 SIGMOD 6.1551499e-05
5,467 Pigeonring: A Principle for Faster Thresholded Similarity Search 2019 VLDB 6.1037173e-05
5,566 Faerie: Efficient Filtering Algorithms for Approximate Dictionary-based Entity Extraction 2011 SIGMOD 6.0651335e-05
5,811 Efficient Approximate Search on String Collections (Tutorial) 2009 VLDB 5.9701598e-05
Previous Page 1 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers