DBScholar

Back to papers

Approximate String Joins with Abbreviations

Summary: Introduces an end-to-end approximate string-join workflow for domain-dependent abbreviations, combining ambiguity-aware similarity with unsupervised rule discovery. Its filter–verification algorithm avoids prior exponential costs while improving accuracy and scalability. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
11951
Venue
VLDB
Year
2018
Pagerank
6.7268636e-05
Overall Rank
4,396 | 69.85%
DOI
10.14778/3136610.3136615

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{tao_vldb18,
        title = {{Approximate String Joins with Abbreviations}},
        author = {Tao, Wenbo and Deng, Dong and Stonebraker, Michael},
        journal = {PVLDB},
        series = {{VLDB} '18},
        volume = {11},
        number = {1},
        pages = {53--65},
        doi = {10.14778/3136610.3136615},
        url = {https://doi.org/10.14778/3136610.3136615},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

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