skip to main content
10.1145/1807085.1807109acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
tutorial

Capturing missing tuples and missing values

Authors Info & Claims
Published:06 June 2010Publication History

ABSTRACT

Databases in real life are often neither entirely closed-world nor entirely open-world. Indeed, databases in an enterprise are typically partially closed, in which a part of the data is constrained by master data that contains complete information about the enterprise in certain aspects [21]. It has been shown that despite missing tuples, such a database may turn out to have complete information for answering a query [9].

This paper studies partially closed databases from which both tuples and values may be missing. We specify such a database in terms of conditional tables constrained by master data, referred to as c-instances. We first propose three models to characterize whether a c-instance T is complete for a query Q relative to master data. That is, depending on how missing values in T are instantiated, the answer to Q in T remains unchanged when new tuples are added. We then investigate four problems, to determine (a) whether a given c-instance is complete for a query Q, (b) whether there exists a c-instance that is complete for Q relative to master data available, (c) whether a c-instance is a minimal-size database that is complete for Q, and (d) whether there exists a c-instance of a bounded size that is complete for Q. We establish matching lower and upper bounds on these problems for queries expressed in a variety of languages, in each of the three models for specifying relative completeness.

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. S. Abiteboul, P. C. Kanellakis, and G. Grahne. On the representation and querying of sets of possible worlds. TCS, 78(1):158--187, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In PODS, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Arenas, J. Pérez, J. Reutter, and C. Riveros. Composition and inversion of schema mappings. SIGMOD Record, 38(3), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Chomicki. Consistent query answering: Five easy pieces. In ICDT, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Elkan. Independence of logic database queries and updates. In PODS, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. W. Fan. Dependencies revisited for improving data quality. In PODS, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. W. Fan and F. Geerts. Relative information completeness. In PODS, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. In JACM, 49(3), 368--406, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. F. Geerts and B. Marnette. Static analysis of schema-mappings ensuring oblivious termination. In ICDT, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. G. Gottlob and R. Zicari. Closed world databases opened through null values. In VLDB, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. G. Grahne. The Problem of Incomplete Information in Relational Databases. Springer, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. T. Imielinski and W. Lipski, Jr. Incomplete information in relational databases. JACM, 31(4), 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. P. G. Kolaitis. Schema mappings, data exchange, and metadata management. In PODS, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M. W. Krentel. Generalizations of Opt P to the poly-nomial hierarchy. Theor. Comput. Sci., 97(2):183--198, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. Lenzerini. Data integration: A theoretical perspective. In PODS, 2002. 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, I. S. Mumick, Y. Sagiv, and O. Shmueli. Equivalence, query-reachability, and satisfiability in datalog extensions. In PODS, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. A. Y. Levy and Y. Sagiv. Queries independent of updates. In VLDB, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. D. Loshin. Master Data Management. Knowledge Integrity, Inc., 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Microsoft. SQL Server 2008 R2 master data services, 2008. http://www.microsoft.com/sqlserver/2008/en/us/MDS.aspx.Google ScholarGoogle Scholar
  23. D. W. Miller et al. Missing prenatal records at a birth center: A communication problem quantified. In AMIA Annu Symp Proc., 2005.Google ScholarGoogle Scholar
  24. A. Motro. Integrity = validity + completeness. TODS, 14(4), 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. D. Olteanu, C. Koch, and L. Antova. World-set decompositions: Expressiveness and efficient algorithms. TCS, 403(2-3):265--284, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. C. H. Papadimitriou. Computational Complexity. AW, 1994.Google ScholarGoogle Scholar
  27. J. Radcli e and A. White. Key issues for master data management. Gartner, 2008.Google ScholarGoogle Scholar
  28. L. Segoufin and V. Vianu. Views and queries: determinacy and rewriting. In PODS, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. M. Spielmann. Abstract State Machines: Verification Problems and Complexity. PhD thesis, RWTH Aachen, 2000.Google ScholarGoogle Scholar
  30. R. van der Meyden. Logical approaches to incomplete information: A survey. In Logics for Databases and Information Systems. Kluwer, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. M. Vardi. On the integrity of databases with incomplete information. In PODS, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Capturing missing tuples and missing values

        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 '10: Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
          June 2010
          350 pages
          ISBN:9781450300339
          DOI:10.1145/1807085

          Copyright © 2010 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 6 June 2010

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • tutorial

          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!