Consistent query answering in databases
Author:
Open Access
- 1 June 2006
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 35 (2) , 68-76
Abstract
For several reasons databases may become inconsistent with respect to a given set of integrity constraints (ICs): (a) The DBMS have no mechanism to maintain certain classes of ICs. (b) New constraints are imposed on preexisting, legacy data. (c) The ICs are soft, user, or informational constraints that are considered at query time, but without being necessarily enforced. (d) Data from different and autonomous sources are being integrated, in particular in mediator-based approaches.Keywords
This publication has 36 references indexed in Scilit:
- Exchange, integration, and consistency of dataACM SIGMOD Record, 2005
- Deductive databases for computing certain and consistent answers from mediated data integration systemsJournal of Applied Logic, 2005
- A logical framework for querying and repairing inconsistent databasesIEEE Transactions on Knowledge and Data Engineering, 2003
- Answer sets for consistent query answering in inconsistent databasesTheory and Practice of Logic Programming, 2003
- Scalar aggregation in inconsistent databasesTheoretical Computer Science, 2003
- An efficient fixed-parameter algorithm for 3-Hitting SetJournal of Discrete Algorithms, 2003
- Parameterized complexity for the database theoristACM SIGMOD Record, 2002
- Complexity and expressive power of logic programmingACM Computing Surveys, 2001
- Recursive query plans for data integrationThe Journal of Logic Programming, 2000
- Complexity models for incremental computationTheoretical Computer Science, 1994