Succinct database schemes

References

• Beeri , C. and Bernstein , P. 1979 . Computational problems related to the design of normal form relational schemas . ACM Trans. on Database Systems , 4 : 30 – 59 .
   Google Scholar
• Chan , E. and Hernández , H. 1988 . On the desirability of γ-acyclic BCNF database schemes . Theoretical Computer Science , 62 : 67 – 104 .
   Google Scholar
• Diederich , J. and Milton , J. 1988 . Fast Algorithms for database normalization . ACM Trans. on Database Systems , 13 : 339 – 365 .
   Web of Science ®Google Scholar
• Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , San Francisco : Freeman .
   Google Scholar
• Papadimitriou , C. H. and Yannakakis , M. 1988 . Proceedings of the 20th ACM Symposium on the Theory of Computing . Optimization. approximation and complexity classes . 1988 . pp. 229 – 234 .
   Google Scholar
• Tsou , D. M. and Fischer , P. C. 1982 . Decomposition of a relation scheme into Boyce-Codd normal form . SIGACT News , 14 : 23 – 29 .
   Google Scholar
• Ullman , J. D. 1988 . Principles of Database and Knowledge-Base Systems , Vol. 1 , Rockwell, Maryland : Computer Science Press .
   Google Scholar
• Vardi , M. Y. 1988 . “ Fundamentals of dependency theory ” . In Trends in Theoretical Computer Science , Edited by: Börger , E. 171 – 224 . Rockville, Maryland : Computer Science Press .
   Google Scholar