Back to papers
Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme
Summary: Establishes tau+1 as the minimum signature size for exact edit-distance query processing and introduces asymmetric signature schemes that achieve this bound. Proposes fast query processing algorithms and DP-based pruning; empirically beats state-of-the-art across nine baselines.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 4452
- Venue
- SIGMOD
- Year
- 2011
- Pagerank
- 6.7757301e-05
- Overall Rank
- 3,774 | 73.75%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 18 of 18 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 1,396 |
Can We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search |
2012 |
SIGMOD |
0.00012204748 |
| 2,740 |
String Similarity Joins: An Experimental Evaluation |
2014 |
VLDB |
8.1980628e-05 |
| 4,250 |
Local Similarity Search for Unstructured Text |
2016 |
SIGMOD |
6.3241139e-05 |
| 4,684 |
Approximate String Joins with Abbreviations |
2018 |
VLDB |
6.0006406e-05 |
| 5,151 |
String Similarity Measures and Joins with Synonyms |
2013 |
SIGMOD |
5.6609851e-05 |
| 5,291 |
Fast Subtrajectory Similarity Search in Road Networks under Weighted Edit Distance Constraints |
2020 |
VLDB |
5.5826473e-05 |
| 6,074 |
Pigeonring: A Principle for Faster Thresholded Similarity Search |
2019 |
VLDB |
5.2242306e-05 |
| 6,726 |
A Pivotal Prefix Based Filtering Algorithm for String Similarity Search |
2014 |
SIGMOD |
4.9484027e-05 |
| 7,109 |
Efficient Similarity Join and Search on Multi-Attribute Data |
2015 |
SIGMOD |
4.8292998e-05 |
| 7,141 |
Efficient Error-tolerant Query Autocompletion |
2013 |
VLDB |
4.8197901e-05 |
| 7,215 |
SyncSignature: A Simple, Efficient, Parallelizable Framework for Tree Similarity Joins |
2023 |
VLDB |
4.7985991e-05 |
| 9,567 |
META: An Efficient Matching-Based Method for Error-Tolerant Autocompletion |
2016 |
VLDB |
4.3254416e-05 |
| 9,932 |
Local Filtering: Improving the Performance of Approximate Queries on String Collections |
2015 |
SIGMOD |
4.2500258e-05 |
| 9,933 |
Efficient and Effective KNN Sequence Search with Approximate n-grams |
2014 |
VLDB |
4.2500258e-05 |
| 10,068 |
DiskJoin: Large-scale Vector Similarity Join with SSD |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,706 |
Extensible and Robust Evaluation of Similarity Queries |
2025 |
VLDB |
4.1945683e-05 |
| 11,305 |
TokenJoin: Efficient Filtering for Set Similarity Join with Maximum Weighted Bipartite Matching |
2023 |
VLDB |
4.1945683e-05 |
| 11,724 |
ZigZag: Supporting Similarity Queries on Vector Space Models |
2018 |
SIGMOD |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 2 |
R-Trees: A Dynamic Index Structure For Spatial Searching |
1984 |
SIGMOD |
0.0032169493 |
| 34 |
Similarity Search in High Dimensions via Hashing |
1999 |
VLDB |
0.00076637636 |
| 91 |
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces |
1997 |
VLDB |
0.0005181666 |
| 125 |
Approximate String Joins in a Database (Almost) for Free |
2001 |
VLDB |
0.00044847972 |
| 250 |
Efficient set joins on similarity predicates |
2004 |
SIGMOD |
0.00030661988 |
| 266 |
Efficient Exact Set-Similarity Joins |
2006 |
VLDB |
0.00029718727 |
| 1,202 |
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams |
2007 |
VLDB |
0.00013326298 |
| 1,234 |
Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints |
2008 |
VLDB |
0.00013122499 |
| 2,073 |
Extending Autocompletion To Tolerate Errors |
2009 |
SIGMOD |
9.6142791e-05 |
| 2,193 |
Cost-Based Variable-Length-Gram Selection for String Collections to Support Approximate Queries Efficiently |
2008 |
SIGMOD |
9.3178557e-05 |
| 2,376 |
Bed-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance |
2010 |
SIGMOD |
8.9424361e-05 |
| 3,578 |
Efficient Approximate Entity Extraction with Edit Distance Constraints |
2009 |
SIGMOD |
6.9503858e-05 |
| 4,216 |
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints |
2010 |
VLDB |
6.3521675e-05 |
| 4,333 |
An Efficient Index Structure for String Databases |
2001 |
VLDB |
6.2805237e-05 |
| 4,373 |
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance |
2010 |
VLDB |
6.2443809e-05 |
| 5,887 |
Efficient Approximate Search on String Collections (Tutorial) |
2009 |
VLDB |
5.2879769e-05 |
| 7,791 |
Similarity Search on Bregman Divergence: Towards Non-Metric Indexing |
2009 |
VLDB |
4.6502309e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 3,199 |
Similarity Evaluation on Tree-structured Data |
2005 |
SIGMOD |
7.3927291e-05 |
| 7,777 |
Indexing Mixed Types for Approximate Retrieval |
2005 |
VLDB |
4.653704e-05 |
| 9,933 |
Efficient and Effective KNN Sequence Search with Approximate n-grams |
2014 |
VLDB |
4.2500258e-05 |
| 2,376 |
Bed-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance |
2010 |
SIGMOD |
8.9424361e-05 |
| 5,615 |
A Scalable Index for Top-k Subtree Similarity Queries |
2019 |
SIGMOD |
5.4101086e-05 |
| 1,234 |
Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints |
2008 |
VLDB |
0.00013122499 |
| 6,464 |
Reference-Based Indexing of Sequence Databases |
2006 |
VLDB |
5.0532607e-05 |
| 9,932 |
Local Filtering: Improving the Performance of Approximate Queries on String Collections |
2015 |
SIGMOD |
4.2500258e-05 |
| 6,726 |
A Pivotal Prefix Based Filtering Algorithm for String Similarity Search |
2014 |
SIGMOD |
4.9484027e-05 |
| 7,708 |
Efficient Top-k Algorithms for Approximate Substring Matching |
2013 |
SIGMOD |
4.6721808e-05 |