DBScholar

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
4317
Venue
SIGMOD
Year
2010
Pagerank
6.5268783e-05
Overall Rank
4,743 | 67.46%
DOI
10.1145/1807167.1807204

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{jestes_sigmod10,
        title = {{Probabilistic String Similarity Joins}},
        author = {Jestes, Jeffrey and Li, Feifei and Yan, Zhepeng and Yi, Ke},
        series = {{SIGMOD} '10},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1807167.1807204},
        url = {https://dl.acm.org/doi/10.1145/1807167.1807204},
        year = {2010}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
2,186 String Similarity Joins: An Experimental Evaluation 2014 VLDB 9.0001436e-05
7,839 Set Similarity Join on Probabilistic Data 2010 VLDB 5.5340666e-05
8,114 Approximate Substring Matching over Uncertain Strings 2011 VLDB 5.484341e-05
12,103 Indexing Metric Uncertain Data for Range Queries 2015 SIGMOD 5.093636e-05
12,177 Similarity Joins for Uncertain Strings 2014 SIGMOD 5.093636e-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