Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4353 LNCS, Issue , 2006, Pages 179-193

  Lopatenko, Andrei ^a   Bertossi, Leopoldo ^b  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTE VALUES; CARDINALITIES; CONSISTENT QUERY ANSWERING; DYNAMIC FRAMEWORK; INTEGRITY CONSTRAINTS; REPAIR SEMANTICS; SYMMETRIC DIFFERENCE;

DATABASE SYSTEMS; PARALLEL PROCESSING SYSTEMS; QUERY PROCESSING; SEMANTICS;

REPAIR;

EID: 84878700965     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11965893_13     Document Type: Conference Paper

References (29)

1. Arenas, M., Bertossi, L. and Chomicki, J. Consistent Query Answers in Inconsistent Databases. Proc. ACM Symposium on Principles of Database Systems (PODS 99), ACM Press, 1999, pp. 68-79.
2. Arenas, M., Bertossi, L. and Chomicki, J. Answer Sets for Consistent Query Answering in Inconsistent Databases. Theory and Practice of Logic Programming, 2003, 3(4-5):393-424.
3. Arenas, M., Bertossi, L., Chomicki, J., He, X., Raghavan, V. and Spinrad, J. Scalar Aggregation in Inconsistent Databases. Theoretical Computer Science, 2003, 296:405-434.
4. Bertossi, L., Bravo, L., Franconi, E. and Lopatenko, A. Fixing Numerical Attributes under Integrity Constraints. Proc. Tenth International Symposium on Database Programming Languages (DBPL 05), Springer LNCS 3774, 2005, pp. 262-278.
5. Bertossi, L. and Chomicki, J. Query Answering in Inconsistent Databases. In Logics for Emerging Applications of Databases. Springer, 2003, pp. 43-83.
6. Buccafurri, F., Leone, N. and Rullo, P. Enhancing Disjunctive Datalog by Constraints. IEEE Transactions on Knowledge and Data Engineering, 2000, 12(5):845-860.
7. Calí, A., Lembo, D. and Rosati, R. Complexity of Query Answering over Inconsistent and Incomplete Databases. Proc. ACM Symposium on Principles of Database Systems (PODS 03), ACM Press, 2003, pp. 260-271.
8. Chen, J., Kanj, I. and Jia, W. Vertex Cover: Further Observations and Further Improvements. In Proc. 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 99), Springer LNCS 1665, 1999, pp. 313-324.
9. Chomicki, J. and Marcinkowski, J. Minimal-Change Integrity Maintenance using Tuple Deletions. Information and Computation, 2005, 197(1-2):90-121.
10. Downey, R.G. and Fellows, M.R. Parameterized Complexity. Springer, Monographs in Computer Science, 1999.
11. Eiter, T. and Gottlob, G. On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. Artificial Intelligence, 1992, 57(2-3):227-270.
12. Flesca, S., Furfaro, F. Parisi, F. Consistent Query Answers on Numerical Databases under Aggregate Constraints. Proc. Tenth International Symposium on Database Programming Languages (DBPL 05), Springer LNCS 3774, 2005, pp. 279-294.
13. Flum, J. and Grohe, M. Parameterized Complexity Theory. Texts in Theoretical Computer Science, Springer Verlag, 2006.
14. Franconi, E., Laureti Palma, A., Leone, N., Perri, S. and Scarcello, F. Census Data Repair: a Challenging Application of Disjunctive Logic Programming. In Proc. Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 01), Springer LNCS 2250, 2001, pp. 561-578.
15. Fuxman, A. and Miller, R. First-Order Query Rewriting for Inconsistent Databases. Proc. International Conference on Database Theory (ICDT 05), Springer LNCS 3363, 2004, pp. 337-351.
16. Garey, M., Johnson, D. and Stockmeyer, L. Some Simplified NP-Complete Graph Problems. Theoreti cal Computer Science, 1976, 1(3):237-267.
17. Gelfond, M. and Lifschitz, V. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 1991, 9:365-385.
18. Greco, G. and Scarcello, F. On the Complexity of Computing Peer Agreements for Consistent Query Answering in Peer-to-Peer Data Integration Systems. Proc. International Conference on Information and Knowledge Management (CIKM 05), ACM Press, 2005, pp. 36-43.
19. Grohe, M. Parameterized Complexity for the Data-base Theorist. SIGMOD Record, 2002, 31(4):86-96.
20. Immerman, N. Descriptive Complexity. Graduate Texts in Computer Science. Springer, 1999.
21. Krentel, M. The Complexity of Optimization Problems. J. Computer and Systems Sciences, 1988, 36:490-509.
22. Lopatenko, A. and Bertossi, L. Complexity of Consistent Query Answering in Databases under Cardinality-Based and Incremental Repair Semantics. Corr Archiv paper cs.DB/0604002.
23. Miltersen, P.B., Subramanian, S., Vitter, J.S. and Tamassia, R. Complexity Models for Incremental Computation. Theoretical Computer Science, 1994, 130(1):203-236.
24. Niedermeier, R. and Rossmanith, P. An Efficient Fixed-Parameter Algorithm for 3-Hitting Set. Journal of Discrete Algorithms, 2003, 1(1):89-102.
25. Papadimitriou, C.H. and Yannakakis, M. On the Complexity of Database Queries. J. Comput. Syst. Sci., 1999, 58(3):407-427.
26. Papadimitriou, C. Computational Complexity. Addison-Wesley, 1994.
27. Robertson, N., Sanders, D.P., Seymour, P. and Thomas, R. Eficiently Four-Coloring Planar Graphs. In Proc. 28th ACM Symposium on the Theory of Computing (STOC 96), ACM Press, 1996, pp. 571-575.
28. Weber, V. and Schwentick, T. Dynamic Complexity Theory Revisited. Proc. Annual Symposium on Theoretical Aspects of Computer Science (STACS 05), Springer LNCS 3404, 2005, pp. 256-268.
29. Wijsen, J. Condensed Representation of Database Repairs for Consistent Query Answering. Proc. International Conference on Database Theory (ICDT 03), Springer LNCS 2572, 2003, pp. 378-393.