DBScholar

Back to papers

Similarity Joins for Uncertain Strings

Summary: First similarity-join for uncertain strings under possible-world semantics using edit distance; finds pairs with Pr(ed(R,S) ≤ k) > τ. Employs pruning bounds, indexing, and a shared-verification trie to avoid enumerating all worlds and speed practical joins. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4973
Venue
SIGMOD
Year
2014
Pagerank
5.093636e-05
Overall Rank
12,177 | 16.46%
DOI
10.1145/2588555.2612178

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{patil_sigmod14,
        title = {{Similarity Joins for Uncertain Strings}},
        author = {Patil, Manish and Shah, Rahul},
        series = {{SIGMOD} '14},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2588555.2612178},
        url = {https://dl.acm.org/doi/10.1145/2588555.2612178},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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