Database Paper Browser

Back to papers

Probabilistic String Similarity Joins

Summary: Probabilistic string joins via expected edit distance (EED) for uncertain strings; two models: full string-level and compact character-level. Pruning enables efficient EED computation inside standard RDBMSs, with experiments showing order-of-magnitude gains over baselines. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4255
Venue
SIGMOD
Year
2010
Pagerank
5.8411648e-05
Overall Rank
4,901 | 65.91%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
2,740 String Similarity Joins: An Experimental Evaluation 2014 VLDB 8.1980628e-05
7,847 Set Similarity Join on Probabilistic Data 2010 VLDB 4.6365272e-05
8,143 Approximate Substring Matching over Uncertain Strings 2011 VLDB 4.5768015e-05
11,904 Indexing Metric Uncertain Data for Range Queries 2015 SIGMOD 4.1945683e-05
11,979 Similarity Joins for Uncertain Strings 2014 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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