Deriving generic bounds for time-series constraints based on regular expressions characteristics.
Ekaterina ArafailovaNicolas BeldiceanuHelmut SimonisPublished in: Constraints An Int. J. (2018)
Keyphrases
- regular expressions
- regular path queries
- tree automata
- pattern matching
- finite automata
- query language
- regular languages
- upper bound
- xml schema
- semistructured data
- query evaluation
- deterministic finite automata
- domain specific
- lower bound
- matching algorithm
- query containment
- expressive power
- context free grammars
- data model
- database systems
- high level
- learning algorithm