Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
Lecture notes in computer science2005pp. 262–278
Citations Over TimeTop 10% of 2005 papers
Related Papers
- → Optimal implementation of conjunctive queries in relational data bases(1977)1,230 cited
- → A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries(2015)28 cited
- → Containment and minimization of positive conjunctive queries in OODB's(1992)55 cited
- → On the First-Order Reducibility of Unions of Conjunctive Queries over Inconsistent Databases(2006)12 cited
- → A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries(2014)7 cited