Combined Tractability of Query Evaluation via Tree Automata and Cycluits.
Antoine AmarilliPierre BourhisMikaël MonetPierre SenellartPublished in: ICDT (2017)
Keyphrases
- query evaluation
- tree automata
- regular expressions
- query language
- query processing
- finite automata
- conjunctive queries
- data complexity
- data management
- probabilistic databases
- finite state
- transitive closure
- querying xml documents
- tree languages
- np complete
- finite automaton
- efficient query evaluation
- pattern matching
- xml data
- pspace complete
- probabilistic xml
- context free grammars
- data model
- computational complexity
- relational algebra
- signature file
- inverted lists
- data mining
- databases