Database Paper Browser

Back to papers

Scalable Regular Expression Matching on Data Streams

Summary: End-to-end high-performance RE matching on data streams by marrying DFA throughput with NFA space efficiency. Core ideas: cache the frequent DFA states, cluster interacting REs to cap state blowup, enabling scalable matching under tight memory and outperforming a leading IDS. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3985
Venue
SIGMOD
Year
2008
Pagerank
6.06476e-05
Overall Rank
4,589 | 68.08%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
622 Towards an Internet-Scale XML Dissemination Service 2004 VLDB 0.00019000333
3,526 RE-Tree: An Efficient Index Structure for Regular Expressions 2002 VLDB 7.0078308e-05
Previous Page 1 / 1 Next

Semantically Similar Papers