An information-theoretic analysis of worst-case redundancy in database design

ACM Transactions on Database Systems

Volumn 35, Issue 1, 2010, Pages

  Kolahi, Solmaz ^a   Libkin, Leonid ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Database design; Functional dependency; Redundancy; Third normal form (3NF)

Indexed keywords

CASE REDUNDANCY; DATABASE DESIGN; DATABASE SCHEMAS; FUNCTIONAL DEPENDENCY; INFORMATION CONTENTS; INFORMATION-THEORETIC ANALYSIS; INTEGRITY CONSTRAINTS; NORMAL FORM; QUANTITATIVE ANALYSIS; QUANTITATIVE COMPARISON; REDUNDANT INFORMATIONS; RELATIONAL SCHEMAS; SCHEMA DESIGN; THIRD NORMAL FORM (3NF);

DATABASE SYSTEMS; DESIGN; INFORMATION THEORY; QUALITY ASSURANCE;

REDUNDANCY;

EID: 77249147548     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1670243.1670248     Document Type: Article

References (34)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley.
2. AHO, A. V., BEERI, C., AND ULLMAN, J. D. 1979. The theory of joins in relational databases. ACM Trans. Datab. Syst. 4, 3, 297-314.
3. ARENAS, M. AND LIBKIN, L. 2004. A normal form for XML documents. ACM Trans. Datab. Syst. 29, 195-232.
4. ARENAS, M. AND LIBKIN, L. 2005. An information-theoretic approach to normal forms for relational and XML data. J. ACM 52, 2, 246-283.
5. BEERI, C., BERNSTEIN, P. A., AND GOODMAN, N. 1978. A sophisticate's introduction to database normalization theory. In Proceedings of the 4th International Conference on Very Large Data Bases. 113-124.
6. BEERI, C., DOWD, M., FAGIN, R., AND STATMAN, R. 1984. On the structure of Armstrong relations for functional dependencies. J. ACM 31, 1, 30-46.
7. BERNSTEIN, P. A. 1976. Synthesizing third normal form relations from functional dependencies. ACM Trans. Datab. Syst. 1, 4, 277-298.
8. BERNSTEIN, P. A. AND GOODMAN, N. 1980. What does boyce-codd normal form do? In Proceedings of the 6th International Conference on Very Large Data Bases. IEEE Computer Society, 245-259.
9. BISKUP, J. 1995. Achievements of relational database schema design theory revisited. In Semantics in Databases. 29-54.
10. BISKUP, J., DAYAL, U., AND BERNSTEIN, P. A. 1979. Synthesizing independent database schemas. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, 143-151.
11. BISKUP, J. AND MEYER, R. 1987. Design of relational database schemes by deleting attributes in the canonical decomposition. J. Comput. Syst. Sci. 35, 1, 1-22.
12. CAVALLO, R. AND PITTARELLI, M. 1987. The theory of probabilistic databases. In Proceedings of the 13th International Conference on Very Large Data Bases. 71-81.
13. COVER, T. M. AND THOMAS, J. A. 1991. Elements of Information Theory. John Wiley and Sons.
14. DALKILIC, M. M. AND ROBERTSON, E. L. 2000. Information dependencies. In Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 245-253.
15. DEMETROVICS, J. AND THI, V. 1987. Keys, antikeys and prime attributes. Annales Univ. Sci., Sect. Comp., Budapest 8, 35-52.
16. DEWSON, R. 2006. Beginning SQL Server 2005 for Developers: From Novice to Professional. Apress.
17. FAGIN, R. 1979. Normal forms and relational database operators. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 153-160.
18. FAGIN, R. 1981. A normal form for relational databases that is based on domians and keys. ACM Trans. Datab. Syst. 6, 3, 387-415.
19. GREENWALD, R., STACKOWIAK, R., AND STERN, J. 2007. Oracle Essentials: Oracle Database 11g, 4th Ed. O'Reilly Media.
20. KANELLAKIS, P. C. 1990. Elements of relational database theory. In Handbook of Theoretical Computer Science, Vol.B: Formal Models and Semantics, 1073-1156.
21. KIFER, M., BERNSTEIN, A., AND LEWIS, P. M. 2006. Database Systems: An Application-Oriented Approach. Addison-Wesley.
22. KOLAHI, S. 2007. Dependency-Preserving normalization of relational and XML data. J. Comput. Syst. Sci. 73, 4, 636-647.
23. KOLAHI, S. AND LIBKIN, L. 2006. On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF. In Proceedings of the 25th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 114-123.
24. LEDOUX, C. H. AND PARKER, D. S. 1982. Reflections on boyce-codd normal form. In Proceedings of the 8th International Conference on Very Large Data Bases. Morgan Kaufmann, 131-141.
25. LEE, T. T. 1987. An information-theoretic analysis of relational databases-Part i: Data dependencies and information metric. IEEE Trans. Softw. Engin. 13, 10, 1049-1061.
26. LEVENE, M., LEVENE, M., AND LOIZOU, G. 1999. A Guided Tour of Relational Databases and Beyond. Springer.
27. LEVENE, M. AND LOIZOU, G. 2003. Why is the snowflake schema a good data warehouse design? Inf. Syst. 28, 3, 225-240.
28. LEVENE, M. AND VINCENT, M. W. 2000. Justification for inclusion dependency normal form. IEEE Trans. Knowl. Data Engin. 12, 2, 281-291.
29. LING, T. W., TOMPA, F. W., AND KAMEDA, T. 1981. An improved third normal form for relational databases. ACM Trans. Datab. Syst. 6, 2, 329-346.
30. MANNILA, H. AND RÄIHÄ, K.-J. 1986. Design by example: An application of Armstrong relations. J. Comput. Syst. Sci. 33, 3, 126-141.
31. STEPHENS, R. K. AND PLEW, R. R. 2002. Sams Teach Yourself SQL in 21 Days 4th Ed. Sams.
32. VALIANT, L. G. 1979. The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 3, 410-421.
33. VINCENT, M.W. 1999. Semantic foundations of 4NF in relational database design. Acta Inf. 36, 3, 173-213.
34. ZANIOLO, C. 1982. A new normal form for the design of relational database schemata. ACMTrans. Datab. Syst. 7, 3, 489-499.