Abstract
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate on sets of constraints that consist of key dependencies. Most of the existing work has focused on identifying intractable cases of this problem. In contrast, in this paper we give an algorithm that computes the consistent answers for a large and practical class of conjunctive queries. Given a query q, the algorithm returns a first-order query Q (called a query rewriting) such that for every (potentially inconsistent) database I, the consistent answers for q can be obtained by evaluating Q directly on I.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: PODS, pp. 68–79 (1999)
Abiteboul, S., Duschka, O.M.: Complexity of answering queries using materialized views. In: PODS, pp. 254–263 (1998)
Bravo, L., Bertossi, L.: Logic programs for consistently querying data integration systems. In: IJCAI, pp. 10–15 (2003)
Calì, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: PODS, pp. 260–271 (2003)
Calì, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: IJCAI, pp. 16–21 (2003)
Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. To appear in Information and Computation (2004)
Fagin, R., Kolaitis, P., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. In: ICDT, pp. 207–224 (2003)
Halevy, A.: Answering queries using views: A survey. VLDB Journal 10(4), 270–294 (2001)
Imielinski, T., van der Meyden, R., Vadaparty, K.: Complexity tailored design: A new design methodology for databases with incomplete information. J. Computer and System Sciences 51(3), 405–432 (1995)
Ladner, R.E.: On the structure of polynomial time reducibility. J. of the ACM 22(1), 155–171 (1975)
Transaction Processing Performance Council: TPC. TPC Benchmark H (Decision Support). Standard Specification Revision 2.1.0 (2003)
van der Meyden, R.: Logical approaches to incomplete information: A survey. In: Logics for Databases and Inf. Systems, pp. 307–356. Kluwer, Dordrecht (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fuxman, A.D., Miller, R.J. (2004). First-Order Query Rewriting for Inconsistent Databases. In: Eiter, T., Libkin, L. (eds) Database Theory - ICDT 2005. ICDT 2005. Lecture Notes in Computer Science, vol 3363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30570-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-30570-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24288-8
Online ISBN: 978-3-540-30570-5
eBook Packages: Computer ScienceComputer Science (R0)