Obtaining Complete Answers from Incomplete Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Views and queries: determinacy and rewriting
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Relative information completeness
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards a logical reconstruction of a theory for locally closed databases
ACM Transactions on Database Systems (TODS)
Capturing missing tuples and missing values
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incomplete databases: missing records and missing values
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
Towards unified and native enrichment in event processing systems
Proceedings of the 7th ACM international conference on Distributed event-based systems
| Hi-index | 0.00 |
We study the problem of query completeness (QC) over partially complete databases. Query completeness is an important goal of data quality assurance. Incomplete databases can occur in many contexts, especially whenever many users are supposed to insert data into the same database. Although the overall data can often not be guaranteed to be complete, some information may exist about completeness of parts of the data, e.g., completeness of parts of tables. Given a query, the question arises whether that information implies that the query returns the same set of answers over the available data as it would over the complete database.