Tractable database design and datalog abduction through bounded treewidth.
Georg GottlobReinhard PichlerFang WeiPublished in: Inf. Syst. (2010)
Keyphrases
- bounded treewidth
- database design
- logic programming
- conjunctive queries
- np complete
- datalog programs
- query answering
- data modeling
- data model
- deductive databases
- query language
- database applications
- database management
- database systems
- data complexity
- expressive power
- normal form
- object oriented
- relational database design
- background knowledge
- integrity constraints
- functional dependencies
- tractable classes
- logical design
- decision problems
- data exchange
- boolean functions
- relational learning
- logic programs
- inductive logic programming
- database theory
- sql server
- database administrators
- query evaluation
- fixed parameter tractable
- np hard
- database management systems
- relational algebra
- entity relationship
- data integrity
- design process
- data integration
- special case
- computational complexity
- databases