Fast, memory-efficient regular expression matching with NFA-OBDDs.
Liu YangRezwana KarimVinod GanapathyRandy SmithPublished in: Comput. Networks (2011)
Keyphrases
- regular expressions
- memory efficient
- pattern matching
- matching algorithm
- approximate matching
- string matching
- finite automata
- deterministic finite automata
- matching process
- semistructured data
- integral image
- external memory
- query language
- regular languages
- boolean functions
- graph matching
- image matching
- static analysis
- xml schema
- approximate string matching
- graph databases
- feature matching
- query evaluation
- iterative deepening
- regular path queries
- finite state machines
- edit distance
- path expressions
- building blocks
- databases