skip to main content
10.1145/1559795.1559811acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Relative information completeness

Authors Info & Claims
Published:29 June 2009Publication History

ABSTRACT

The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a closed-world database. We say that a database D is partially closed if it satisfies a set V of containment constraints of the form "q(D) is a subset of p(Dm)", where q is a query in a language Lc and p is a projection query. The part of D not constrained by (Dm,V) is open, from which some tuples may be missing. The database D is said to be complete for a query Q relative to (Dm,V) if for all partially closed extensions D' of D, Q(D')=Q(D), i.e., adding tuples to D either violates some constraints in V or does not change the answer to Q.

We first show that the proposed model can also capture the consistency of data, in addition to its relative completeness. Indeed, integrity constraints studied for consistency can be expressed as containment constraints. We then study two problems. One is to decide, given Dm, V, a query Q in a language Lq and a partially closed database D, whether D is complete for Q relative to (Dm,V). The other is to determine, given Dm, V and Q, whether there exists a partially closed database that is complete for Q relative to (Dm,V). We establish matching lower and upper bounds on these problems for a variety of languages Lq and Lc. We also provide characterizations for a database to be relatively complete, and for a query to allow a relatively complete database, when Lq and Lc are conjunctive queries.

References

  1. S. Abiteboul and O.M. Duschka. Complexity of answering queries using materialized views. In PODS, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Arenas, L. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In PODS, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. Batini and M.Scannapieco. Data Quality: Concepts, Methodologies and Techniques. Springer, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. L. Bravo, W. Fan, and S. Ma. Extending dependencies with conditions. In VLDB, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Cali, D. Lembo, and R. Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In PODS, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. Calvanese, G.D. Giacomo, M. Lenzerini, and M.Y. Vardi. View-based query processing: On the relationship between rewriting, answering and losslessness. TCS, 371(3), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Chomicki. Consistent query answering: Five easy pieces. In ICDT, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. E. Dantsin and A. Voronkov. Complexity of query answering in logic databases with complex values. In LFCS, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Deutsch, B. Ludaescher, and A. Nash. Rewriting queries using views with access patterns under integrity constraints. TCS, 371(3), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. Dreibelbis, E. Hechler, B. Mathews, M. Oberhofer, and G. Sauter. Master data management architecture patterns. IBM, 2007.Google ScholarGoogle Scholar
  12. C. Elkan. Independence of logic database queries and updates. In PODS, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. W. Fan. Dependencies revisited for improving data quality. In PODS, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. W. Fan, F. Geerts, X. Jia, and A. Kementsietsidis. Conditional functional dependencies for capturing data inconsistencies. TODS, 33(1), 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. G. Gottlob and R. Zicari. Closed world databases opened through null values. In VLDB, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. G. Grahne. The Problem of Incomplete Information in Relational Databases. Springer, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. T. Imielinski and W. Lipski, Jr. Incomplete information in relational databases. JACM, 31(4), 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A.Y. Levy. Obtaining complete answers from incomplete databases. In VLDB, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. A.Y. Levy and Y. Sagiv. Queries independent of updates. In VLDB, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. C. Li. Computing complete answers to queries in the presence of limited access patterns. VLDB J., 12(3), 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. D. Loshin. Master Data Management. Knowledge Integrity, Inc., 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. A. Motro. Integrity = validity + completeness. TODS, 14(4), 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google ScholarGoogle Scholar
  24. J. Radcliffe and A. White. Key issues for master data management. Gartner, 2008.Google ScholarGoogle Scholar
  25. L. Segoufin and V. Vianu. Views and queries: determinacy and rewriting. In PODS, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. M. Spielmann. Abstract state machines: Verification problems and complexity. PhD thesis, RWTH Aachen, 2000.Google ScholarGoogle Scholar
  27. R. van der Meyden. Logical approaches to incomplete information: A survey. In J. Chomicki and G. Saake, editors, Logics for Databases and Information Systems. Kluwer, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. M. Vardi. On the integrity of databases with incomplete information. In PODS, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Relative information completeness

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
        June 2009
        298 pages
        ISBN:9781605585536
        DOI:10.1145/1559795
        • General Chair:
        • Jan Paredaens,
        • Program Chair:
        • Jianwen Su

        Copyright © 2009 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 29 June 2009

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate476of1,835submissions,26%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!