Tractable database design through bounded treewidth.
Georg GottlobReinhard PichlerFang WeiPublished in: PODS (2006)
Keyphrases
- bounded treewidth
- database design
- np complete
- decision problems
- data modeling
- database systems
- database management
- database applications
- object oriented
- database development
- conjunctive queries
- relational database design
- data model
- boolean functions
- functional dependencies
- normal form
- sql server
- relational learning
- core concepts
- microsoft access
- database administrators
- database theory
- fixed parameter tractable
- tractable classes
- data mining
- np hard
- monadic datalog
- data integrity
- inductive logic programming
- design process
- knowledge representation