MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay.
Guillaume BaganPublished in: CSL (2006)
Keyphrases
- monadic second order logic
- tree structures
- tree like structures
- tree patterns
- query language
- tree automata
- boolean expressions
- xml query languages
- query processing
- expressive power
- range queries
- query evaluation
- regular expressions
- user queries
- database
- r tree
- index structure
- indexing schemes
- tree structure
- web search engines
- query patterns
- data complexity
- response time
- indexing structure
- np complete
- linear space
- structural features
- turing machine
- efficient processing
- data sources
- first order logic