DBScholar

Back to papers

VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams

Summary: VGRAM selects variable-length grams to speed up approximate string queries. It derives query grams from selected grams and links gram-set similarity to edit distance, enabling adoption by algorithms with minimal changes; experiments show speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9776
Venue
VLDB
Year
2007
Pagerank
0.00012466499
Overall Rank
1,040 | 92.87%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{li_vldb07,
        title = {{VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams}},
        author = {Li, Chen and Wang, Bin and Yang, Xiaochun},
        journal = {PVLDB},
        series = {{VLDB} '07},
        pages = {303--314},
        year = {2007}
}

Incoming Citations (Sorted by Pagerank)

Showing 28 of 28 citing papers.

Rank Citing Paper Year Venue Pagerank
528 On Active Learning of Record Matching Packages 2010 SIGMOD 0.00017100838
871 Framework for Evaluating Clustering Algorithms in Duplicate Detection 2009 VLDB 0.00013496531
911 Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints 2008 VLDB 0.00013283031
975 Can We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search 2012 SIGMOD 0.00012870645
2,103 Cost-Based Variable-Length-Gram Selection for String Collections to Support Approximate Queries Efficiently 2008 SIGMOD 9.1621686e-05
2,459 WHAM: A High-throughput Sequence Alignment Method 2011 SIGMOD 8.550768e-05
3,193 Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme 2011 SIGMOD 7.649474e-05
3,446 Efficient Approximate Entity Extraction with Edit Distance Constraints 2009 SIGMOD 7.4087786e-05
3,545 Astrid: Accurate Selectivity Estimation for String Predicates using Deep Learning 2021 VLDB 7.3249967e-05
3,731 Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints 2010 VLDB 7.1663952e-05
4,743 Probabilistic String Similarity Joins 2010 SIGMOD 6.5268783e-05
5,071 Fast Subtrajectory Similarity Search in Road Networks under Weighted Edit Distance Constraints 2020 VLDB 6.3761034e-05
5,412 Faerie: Efficient Filtering Algorithms for Approximate Dictionary-based Entity Extraction 2011 SIGMOD 6.2272563e-05
5,667 Efficient Approximate Search on String Collections (Tutorial) 2009 VLDB 6.1279762e-05
5,726 Pigeonring: A Principle for Faster Thresholded Similarity Search 2019 VLDB 6.1079184e-05
6,182 Reference-Based Alignment in Large Sequence Databases 2009 VLDB 5.9493566e-05
6,484 A Pivotal Prefix Based Filtering Algorithm for String Similarity Search 2014 SIGMOD 5.8665833e-05
6,716 SigMatch: Fast and Scalable Multi-Pattern Matching 2010 VLDB 5.7958663e-05
6,827 Sampling Dirty Data for Matching Attributes 2010 SIGMOD 5.7616041e-05
6,858 A Generic Framework for Efficient and Effective Subsequence Retrieval 2012 VLDB 5.7523396e-05
6,906 Efficient Similarity Join and Search on Multi-Attribute Data 2015 SIGMOD 5.7418509e-05
7,692 Efficient Top-k Algorithms for Approximate Substring Matching 2013 SIGMOD 5.5664611e-05
9,613 On-the-Fly Token Similarity Joins in Relational Databases 2014 SIGMOD 5.2447096e-05
9,979 Balance-Aware Distributed String Similarity-Based Query Processing System 2019 VLDB 5.1845938e-05
10,085 Local Filtering: Improving the Performance of Approximate Queries on String Collections 2015 SIGMOD 5.1559617e-05
10,086 Efficient and Effective KNN Sequence Search with Approximate n-grams 2014 VLDB 5.1559617e-05
10,505 The Case For Language Model Approximated LIKE Predicate 2026 SIGMOD 5.093636e-05
11,929 ZigZag: Supporting Similarity Queries on Vector Space Models 2018 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
107 Approximate String Joins in a Database (Almost) for Free 2001 VLDB 0.00033511706
158 Robust and Efficient Fuzzy Match for Online Data Cleaning 2003 SIGMOD 0.00028199923
160 Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textual Similarity 1998 SIGMOD 0.0002802209
200 Efficient set joins on similarity predicates 2004 SIGMOD 0.00025597287
254 Record Linkage: Similarity Measures and Algorithms 2006 SIGMOD 0.00023199211
1,140 Estimating Alphanumeric Selectivity in the Presence of Wildcards 1996 SIGMOD 0.0001200574
1,427 Substring Selectivity Estimation 1999 PODS 0.00010812749
2,262 n-Gram/2L: A Space and Time Efficient Two-Level n-Gram Inverted Index Structure 2005 VLDB 8.8440146e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 11,081 An Evaluation of N-Gram Selection Strategies for Regular Expression Indexing in Contemporary Text Analysis Tasks 2025 VLDB
2 4,359 Incremental Maintenance of Length Normalized Indexes for Approximate String Matching 2009 SIGMOD
3 3,193 Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme 2011 SIGMOD
4 6,484 A Pivotal Prefix Based Filtering Algorithm for String Similarity Search 2014 SIGMOD
5 10,086 Efficient and Effective KNN Sequence Search with Approximate n-grams 2014 VLDB
6 10,085 Local Filtering: Improving the Performance of Approximate Queries on String Collections 2015 SIGMOD
7 107 Approximate String Joins in a Database (Almost) for Free 2001 VLDB
8 2,899 Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance 2007 VLDB
9 7,692 Efficient Top-k Algorithms for Approximate Substring Matching 2013 SIGMOD
10 2,103 Cost-Based Variable-Length-Gram Selection for String Collections to Support Approximate Queries Efficiently 2008 SIGMOD