An Evaluation of N-Gram Selection Strategies for Regular Expression Indexing in Contemporary Text Analysis Tasks
Summary: Systematically benchmarks three n-gram selection strategies for regex indexes on five modern workloads, including production logs and genomics. It quantifies construction/storage, false positives, and end-to-end trade-offs, releasing an open evaluation framework and implementations. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Ling Zhang (University of Wisconsin)
- 2. Shaleen Deep (Microsoft)
- 3. Jignesh M. Patel (Carnegie Mellon University)
- 4. Karthikeyan Sankaralingam (University of Wisconsin)
BibTeX Citation
@article{zhang_vldb25,
title = {{An Evaluation of N-Gram Selection Strategies for Regular Expression Indexing in Contemporary Text Analysis Tasks}},
author = {Zhang, Ling and Deep, Shaleen and Patel, Jignesh M. and Sankaralingam, Karthikeyan},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {13},
pages = {5703--5715},
doi = {10.14778/3773731.3773744},
url = {https://doi.org/10.14778/3773731.3773744},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,396 | Regular Expression Indexing for Log Analysis | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 341 | Indexing and Querying XML Data for Regular Path Expressions | 2001 | VLDB | 0.00020704572 |
| 870 | BitWeaving: Fast Scans for Main Memory Data Processing | 2013 | SIGMOD | 0.0001350293 |
| 3,742 | RE-Tree: An Efficient Index Structure for Regular Expressions | 2002 | VLDB | 7.1577657e-05 |
| 9,973 | Exploiting Structure in Regular Expression Queries | 2023 | SIGMOD | 5.1845938e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,477 | Performance and Scalability of Indexed Subgraph Query Processing Methods | 2015 | VLDB |
| 2 | 2,899 | Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance | 2007 | VLDB |
| 3 | 4,359 | Incremental Maintenance of Length Normalized Indexes for Approximate String Matching | 2009 | SIGMOD |
| 4 | 7,692 | Efficient Top-k Algorithms for Approximate Substring Matching | 2013 | SIGMOD |
| 5 | 1,040 | VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams | 2007 | VLDB |
| 6 | 10,086 | Efficient and Effective KNN Sequence Search with Approximate n-grams | 2014 | VLDB |
| 7 | 2,262 | n-Gram/2L: A Space and Time Efficient Two-Level n-Gram Inverted Index Structure | 2005 | VLDB |
| 8 | 3,742 | RE-Tree: An Efficient Index Structure for Regular Expressions | 2002 | VLDB |
| 9 | 2,103 | Cost-Based Variable-Length-Gram Selection for String Collections to Support Approximate Queries Efficiently | 2008 | SIGMOD |
| 10 | 10,396 | Regular Expression Indexing for Log Analysis | 2026 | SIGMOD |