DBScholar

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
4047
Venue
SIGMOD
Year
2008
Pagerank
6.7290402e-05
Overall Rank
4,391 | 69.88%
DOI
10.1145/1376616.1376635

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{majumder_sigmod08,
        title = {{Scalable Regular Expression Matching on Data Streams}},
        author = {Majumder, Anirban and Rastogi, Rajeev and Vanama, Sriram},
        series = {{SIGMOD} '08},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1376616.1376635},
        url = {https://dl.acm.org/doi/10.1145/1376616.1376635},
        year = {2008}
}

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
875 Towards an Internet-Scale XML Dissemination Service 2004 VLDB 0.00013478623
3,742 RE-Tree: An Efficient Index Structure for Regular Expressions 2002 VLDB 7.1577657e-05
Previous Page 1 / 1 Next

Semantically Similar Papers