DBScholar

Back to papers

RE-Tree: An Efficient Index Structure for Regular Expressions

Summary: RE-tree is a novel index for large databases of regular expressions that speeds up input-string matching by pruning to a small subset of candidate REs. It uses new size measures for infinite languages, node splitting, tight bounding REs, and sampling-based approximations to outperform naive sequential search. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9040
Venue
VLDB
Year
2002
Pagerank
7.1577657e-05
Overall Rank
3,742 | 74.33%
DOI
10.1016/B978-155860869-6/50030-5

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{chan_vldb02,
        title = {{RE-Tree: An Efficient Index Structure for Regular Expressions}},
        author = {Chan, Chee-Yong and Garofalakis, Minos and Rastogi, Rajeev},
        journal = {PVLDB},
        series = {{VLDB} '02},
        doi = {10.1016/B978-155860869-6/50030-5},
        url = {https://doi.org/10.1016/B978-155860869-6/50030-5},
        year = {2002}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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