First-Order Query Rewriting for Inconsistent Databases

  • Ariel D. Fuxman
  • Renée J. Miller
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3363)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABC99]
    Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: PODS, pp. 68–79 (1999)Google Scholar
  2. [AD98]
    Abiteboul, S., Duschka, O.M.: Complexity of answering queries using materialized views. In: PODS, pp. 254–263 (1998)Google Scholar
  3. [BB03]
    Bravo, L., Bertossi, L.: Logic programs for consistently querying data integration systems. In: IJCAI, pp. 10–15 (2003)Google Scholar
  4. [CLR03a]
    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)Google Scholar
  5. [CLR03b]
    Calì, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: IJCAI, pp. 16–21 (2003)Google Scholar
  6. [CM04]
    Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. To appear in Information and Computation (2004)Google Scholar
  7. [FKMP03]
    Fagin, R., Kolaitis, P., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. In: ICDT, pp. 207–224 (2003)Google Scholar
  8. [Hal01]
    Halevy, A.: Answering queries using views: A survey. VLDB Journal 10(4), 270–294 (2001)MATHCrossRefGoogle Scholar
  9. [IvdMV95]
    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)CrossRefGoogle Scholar
  10. [Lad75]
    Ladner, R.E.: On the structure of polynomial time reducibility. J. of the ACM 22(1), 155–171 (1975)MATHCrossRefMathSciNetGoogle Scholar
  11. [TPC03]
    Transaction Processing Performance Council: TPC. TPC Benchmark H (Decision Support). Standard Specification Revision 2.1.0 (2003)Google Scholar
  12. [vdM98]
    van der Meyden, R.: Logical approaches to incomplete information: A survey. In: Logics for Databases and Inf. Systems, pp. 307–356. Kluwer, Dordrecht (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Ariel D. Fuxman
    • 1
  • Renée J. Miller
    • 1
  1. 1.Department of Computer ScienceUniversity of Toronto 

Personalised recommendations