Efficient evaluation of n-ary conjunctive queries over trees and graphs.
François BryTim FurcheBenedikt LinseAndreas SchroederPublished in: WIDM (2006)
Keyphrases
- conjunctive queries
- query answering
- query evaluation
- integrity constraints
- data complexity
- boolean expressions
- bounded treewidth
- data exchange
- np complete
- query language
- special case
- pattern matching
- decision trees
- query rewriting
- query containment
- regular path queries
- unions of conjunctive queries
- probabilistic databases
- directed graph
- relational databases