On the consistent rewriting of conjunctive queries under primary key constraints

Information Systems

Volumn 34, Issue 7, 2009, Pages 578-601

  Wijsen, Jef ^a  

^a UNIVERSITY OF MONS   (Belgium)

Author keywords

Certain query answering; Consistent query answering; Database repairing

Indexed keywords

CERTAIN QUERY ANSWERING; CONJUNCTIVE QUERIES; CONSISTENT QUERY ANSWERING; DATABASE REPAIRING; FIRST-ORDER; FOLLOWING PROBLEM; INCONSISTENT DATABASE; NON-EXISTENCE; NOVEL TECHNIQUES; PRIMARY KEYS; RELATIONAL DATABASE;

QUERY LANGUAGES;

REPAIR;

EID: 67649580751     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2009.03.011     Document Type: Article

References (19)

1. Arenas M., Bertossi L.E., and Chomicki J. Consistent query answers in inconsistent databases. PODS (1999), ACM Press, New York 68-79
2. Chomicki J. Consistent query answering: five easy pieces. In: Schwentick T., and Suciu D. (Eds). ICDT, Lecture Notes in Computer Science vol. 4353 (2007), Springer, Berlin 1-17
3. Fuxman A., and Miller R.J. First-order query rewriting for inconsistent databases. J. Comput. Syst. Sci. 73 4 (2007) 610-635
4. Wijsen J. On the consistent rewriting of conjunctive queries under primary key constraints. In: Arenas M., and Schwartzbach M.I. (Eds). DBPL, Lecture Notes in Computer Science vol. 4797 (2007), Springer, Berlin 112-126
5. Beeri C., Fagin R., Maier D., and Yannakakis M. On the desirability of acyclic database schemes. J. ACM 30 3 (1983) 479-513
6. A. Fuxman, R.J. Miller, Towards inconsistency management in data integration systems, in: S. Kambhampati, C.A. Knoblock (Eds.), IIWeb, 2003, pp. 143-148.
7. Abiteboul S., Hull R., and Vianu V. Foundations of Databases (1995), Addison-Wesley, Reading, MA
8. Lin J., and Mendelzon A.O. Merging databases under constraints. Int. J. Cooperative Inf. Syst. 7 1 (1998) 55-76
9. Wijsen J. Database repairing using updates. ACM Trans. Database Syst. 30 3 (2005) 722-768
10. A. Fuxman, E. Fazli, R.J. Miller, Conquer: efficient management of inconsistent databases, in: F. Özcan (Ed.), SIGMOD Conference, ACM, New York, 2005, pp. 155-166.
11. L. Grieco, D. Lembo, R. Rosati, M. Ruzzi, Consistent query answering under key and exclusion dependencies: algorithms and experiments, in: O. Herzog, H.-J. Schek, N. Fuhr, A. Chowdhury, W. Teiken (Eds.), CIKM, ACM, New York, 2005, pp. 792-799.
12. Lembo D., Rosati R., and Ruzzi M. On the first-order reducibility of unions of conjunctive queries over inconsistent databases. In: Grust T., Höpfner H., Illarramendi A., Jablonski S., Mesiti M., Müller S., Patranjan P.-L., Sattler K.-U., Spiliopoulou M., and Wijsen J. (Eds). EDBT Workshops, Lecture Notes in Computer Science vol. 4254 (2006), Springer, Berlin 358-374
13. Fuxman A., and Miller R.J. First-order query rewriting for inconsistent databases. In: Eiter T., and Libkin L. (Eds). ICDT, Lecture Notes in Computer Science vol. 3363 (2005), Springer, Berlin 337-351
14. A. Calì, D. Lembo, R. Rosati, On the decidability and complexity of query answering over inconsistent and incomplete databases, in: PODS, ACM, New York, 2003, pp. 260-271.
15. Chomicki J., and Marcinkowski J. Minimal-change integrity maintenance using tuple deletions. Inf. Comput. 197 1-2 (2005) 90-121
16. Gottlob G., Leone N., and Scarcello F. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64 3 (2002) 579-627
17. J. Wijsen, Consistent query answering under primary keys: a characterization of tractable queries, in: R. Fagin (Ed.), ICDT, ACM, New York, 2009.
18. Gottlob G., Leone N., and Scarcello F. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64 3 (2002) 579-627
19. Libkin L. Elements of Finite Model Theory (2004), Springer, Berlin