Relative information completeness

ACM Transactions on Database Systems

Volumn 35, Issue 4, 2010, Pages

  Fan, Wenfei ^a   Geerts, Floris ^a,b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b School of Informatics   (United Kingdom)

Author keywords

Complexity; Incomplete information; Master data management; Partially closed databases; Relative completeness

Indexed keywords

COMPLEXITY; INCOMPLETE INFORMATION; MASTER DATA MANAGEMENT; PARTIALLY CLOSED DATABASES; RELATIVE COMPLETENESS;

INFORMATION MANAGEMENT; QUERY LANGUAGES;

QUERY PROCESSING;

EID: 78650642617     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1862919.1862924     Document Type: Conference Paper

References (33)

1. ABITEBOUL, S. AND DUSCHKA, O. M. 1998. Complexity of answering queries using materialized views. In Proceedings of the Symposium on Principles of Database Systems (PODS). 254-263.
2. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley.
3. ARENAS, M., BERTOSSI, L. E., AND CHOMICKI, J. 1999. Consistent query answers in inconsistent databases. In Proceedings of the Symposium on Principles of Database Systems (PODS). 68-79.
4. BATINI, C. AND SCANNAPIECO, M. 2006. Data Quality: Concepts, Methodologies and Techniques. Springer.
5. BRAVO, L., FAN, W., AND MA, S. 2007. Extending dependencies with conditions. In Proceedings of International Conference on Very Large Databases (VLDB). 243-254.
6. CALI, A., LEMBO, D., AND ROSATI, R. 2003. On the decidability and complexity of query answering over inconsistent and incomplete databases. In Proceedings of the Symposium on Principles of Database Systems (PODS). 260-271.
7. CALVANESE, D., GIACOMO, G. D., LENZERINI, M., AND VARDI, M. Y. 2007. View-based query processing: On the relationship between rewriting, answering and losslessness. Theor. Comput. Sci. 371, 3, 169-182.
8. CHANDRA, A. K. ANDMERLIN, P.M. 1977. Optimal implementation of conjunctive queries in relational data bases. In Proceedings of ACM Symposium on Theory of Computing (STOC). 77-90.
9. CHOMICKI, J. 2007. Consistent query answering: Five easy pieces. In Proceedings of the International Conference on Database Theory (ICDT). 1-17.
10. DANTSIN, E. AND VORONKOV, A. 1997. Complexity of query answering in logic databases with complex values. In Proceedings of the International Symposium Logical Foundations of Computer Science (LFCS). 56-66.
11. DEUTSCH, A., LUDÄSCHER, B., AND NASH, A. 2007. Rewriting queries using views with access patterns under integrity constraints. Theor. Comput. Sci. 371, 3, 200-226.
12. DREIBELBIS, A., HECHLER, E., MATHEWS, B., OBERHOFER, M., AND SAUTER, G. 2007. Master data management architecture patterns. Tech. rep. IBM.
13. ELKAN, C. 1990. Independence of logic database queries and updates. In Proceedings of the Symposium on Principles of Database Systems (PODS). 154-160.
14. FAN, W. 2008. Dependencies revisited for improving data quality. In Proceedings of the Symposium on Principles of Database Systems (PODS). 159-170.
15. FAN, W. AND GEERTS, F. 2009. Relative information completeness. In Proceedings of the Symposium on Principles of Database Systems (PODS). 97-106.
16. FAN, W. AND GEERTS, F. 2010. Capturing missing tuples and missing values. In Proceedings of the Symposium on Principles of Database Systems (PODS).
17. FAN, W., GEERTS, F., JIA, X., AND KEMENTSIETSIDIS, A. 2008. Conditional functional dependencies for capturing data inconsistencies. ACM Trans. Database Syst. 33, 2, 1-48.
18. GAREY, M. AND JOHNSON, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company.
19. GOTTLOB, G. AND ZICARI, R. 1988. Closed world databases opened through null values. In Proceedings of International Conference on Very Large Databases (VLDB). 50-61.
20. GRAHNE, G. 1991. The Problem of Incomplete Information in Relational Databases. Springer.
21. HERZOG, T. N., SCHEUREN, F. J., AND WINKLER, W. E. 2007. Data Quality and Record Linkage Techniques. Springer.
22. IMIELIŃSKI, T. AND LIPSKI, JR,W. 1984. Incomplete information in relational databases. J. ACM 31, 4, 761-791.
23. LEVY, A. Y. 1996. Obtaining complete answers from incomplete databases. In Proceedings of International Conference on Very Large Databases (VLDB). 402-412.
24. LEVY, A. Y. AND SAGIV, Y. 1993. Queries independent of updates. In Proceedings of International Conference on Very Large Databases (VLDB). 171-181.
25. LI, C. 2003. Computing complete answers to queries in the presence of limited access patterns. VLDB J. 12, 3, 211-227.
26. LOSHIN, D. 2008. Master Data Management. Morgan Kaufmann.
27. MOTRO, A. 1989. Integrity = validity + completeness. ACM Trans. Datab. Syst. 14, 4, 480-502.
28. PAPADIMITRIOU, C. H. 1994. Computational Complexity. Addison-Wesley.
29. RADCLIFFE, J. AND WHITE, A. 2008. Key issues for master data management. Tech. rep. Gartner.
30. SEGOUFIN, L. AND VIANU, V. 2005. Views and queries: determinacy and rewriting. In Proceedings of the Symposium on Principles of Database Systems (PODS). 49-60.
31. SPIELMANN, M. 2000. Abstract state machines: Verification problems and complexity. Ph.D. thesis, RWTH Aachen.
32. VAN DER MEYDEN, R. 1998. Logical approaches to incomplete information: A survey. In Logics for Databases and Information Systems, J. Chomicki and G. Saake, Eds., Kluwer.
33. VARDI, M. 1986. On the integrity of databases with incomplete information. In Proceedings of the Symposium on Principles of Database Systems (PODS). 252-266.