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.
- S. Abiteboul and O.M. Duschka. Complexity of answering queries using materialized views. In PODS, 1998. Google Scholar
Digital Library
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In PODS, 1999. Google Scholar
Digital Library
- M. Arenas, J. Pérez, J. Reutter, and C. Riveros. Composition and inversion of schema mappings. SIGMOD Record, 38(3), 2009. Google Scholar
Digital Library
- J. Chomicki. Consistent query answering: Five easy pieces. In ICDT, 2007. Google Scholar
Digital Library
- C. Elkan. Independence of logic database queries and updates. In PODS, 1990. Google Scholar
Digital Library
- W. Fan. Dependencies revisited for improving data quality. In PODS, 2008. Google Scholar
Digital Library
- W. Fan and F. Geerts. Relative information completeness. In PODS, 2009. Google Scholar
Digital Library
- W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. In JACM, 49(3), 368--406, 2002. Google Scholar
Digital Library
- F. Geerts and B. Marnette. Static analysis of schema-mappings ensuring oblivious termination. In ICDT, 2010. Google Scholar
Digital Library
- G. Gottlob and R. Zicari. Closed world databases opened through null values. In VLDB, 1988. Google Scholar
Digital Library
- G. Grahne. The Problem of Incomplete Information in Relational Databases. Springer, 1991. Google Scholar
Digital Library
- T. Imielinski and W. Lipski, Jr. Incomplete information in relational databases. JACM, 31(4), 1984. Google Scholar
Digital Library
- P. G. Kolaitis. Schema mappings, data exchange, and metadata management. In PODS, 2005. Google Scholar
Digital Library
- M. W. Krentel. Generalizations of Opt P to the poly-nomial hierarchy. Theor. Comput. Sci., 97(2):183--198, 1992. Google Scholar
Digital Library
- M. Lenzerini. Data integration: A theoretical perspective. In PODS, 2002. Google Scholar
Digital Library
- A. Y. Levy. Obtaining complete answers from incomplete databases. In VLDB, 1996. Google Scholar
Digital Library
- A. Y. Levy, I. S. Mumick, Y. Sagiv, and O. Shmueli. Equivalence, query-reachability, and satisfiability in datalog extensions. In PODS, 1993. Google Scholar
Digital Library
- A. Y. Levy and Y. Sagiv. Queries independent of updates. In VLDB, 1993. Google Scholar
Digital Library
- D. Loshin. Master Data Management. Knowledge Integrity, Inc., 2009. Google Scholar
Digital Library
- Microsoft. SQL Server 2008 R2 master data services, 2008. http://www.microsoft.com/sqlserver/2008/en/us/MDS.aspx.Google Scholar
- D. W. Miller et al. Missing prenatal records at a birth center: A communication problem quantified. In AMIA Annu Symp Proc., 2005.Google Scholar
- A. Motro. Integrity = validity + completeness. TODS, 14(4), 1989. Google Scholar
Digital Library
- D. Olteanu, C. Koch, and L. Antova. World-set decompositions: Expressiveness and efficient algorithms. TCS, 403(2-3):265--284, 2008. Google Scholar
Digital Library
- C. H. Papadimitriou. Computational Complexity. AW, 1994.Google Scholar
- J. Radcli e and A. White. Key issues for master data management. Gartner, 2008.Google Scholar
- L. Segoufin and V. Vianu. Views and queries: determinacy and rewriting. In PODS, 2005. Google Scholar
Digital Library
- M. Spielmann. Abstract State Machines: Verification Problems and Complexity. PhD thesis, RWTH Aachen, 2000.Google Scholar
- R. van der Meyden. Logical approaches to incomplete information: A survey. In Logics for Databases and Information Systems. Kluwer, 1998. Google Scholar
Digital Library
- M. Vardi. On the integrity of databases with incomplete information. In PODS, 1986. Google Scholar
Digital Library
Index Terms
Capturing missing tuples and missing values
Recommendations
Capturing Missing Tuples and Missing Values
Invited Paper from SIGMOD 2014 and Regular PapersDatabases in real life are often neither entirely closed-world nor entirely open-world. 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 ...
Relative information completeness
PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsThe 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 ...
Missing Value Imputation Method Using Separate Features Nearest Neighbors Algorithm
Computational Science – ICCS 2021AbstractMissing value imputation is a problem often meet when working with medical and biometric data sets. Prior to working on these datasets, missing values have to be eliminated. It could be done by imputing estimated values. However, imputation should ...






Comments