Recognition and top-down generation of β-acyclic database schemes

  • V. S. Lakshmanan
  • N. Chandrasskaran
  • C. E. Veni Madhavan
Session 6 Data Bases
Part of the Lecture Notes in Computer Science book series (LNCS, volume 181)


Database schemes can be viewed as hypergraphs with individual relation schemes corresponding to the edges of a hypergraph. Under this setting, a new class of "acyclic" database schemes was recently introduced and was shown to have a claim to a number of desirable properties. However, unlike the case of ordinary undirected graphs, there are several unequivalent notions of acyclicity of hypergraphs. Of special interest among these are α-, β-, and γ-, degrees of acyclicity, each characterizing an equivalence class of desirable properties for database schemes, represented as hypergraphs. In this paper, two complementary approaches to designing β-acyclic database schemes have been presented. For the first part, a new notion called "independent cycle" is introduced. Based on this, a criterion for β-acyclicity is developed and is shown equivalent to the existing definitions of β-acyclicity. From this and the concept of the dual of a hypergraph, an efficient algorithm for testing β-acyclicity is developed. As for the second part, a procedure is evolved for top-down generation of β-acyclic schemes and its correctness is established. Finally, extensions and applications of ideas are described.


Database Scheme Universal Relation Distinct Edge Hereditary Property Independent Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    ARMSTRONG, W.W. Dependency structures of database relationships. In Proc. IFIP 74, North Holland, Amsterdam, 1974, pp. 580–583.Google Scholar
  2. 2.
    BATINI, C., D'ATRI, A., AND MOSCARINI, M. Formal tools for top-down and bottom-up generation of acyclic relational schemata. In Proc. Int. Conf. on Graph-Theoretic Concepts in Computer Science, Linz, Austria, 1981.Google Scholar
  3. 3.
    BEERI, C., FAGIN, R., MAIER, D., MENDELZON, A.O., ULLMAN, J.D., AND YANNAKAKIS, M. Properties of acyclic database schemes. In Proc. 13th Ann. ACM Symp. on Theory of Computing, ACM, New York, 1981, pp. 355–362.Google Scholar
  4. 4.
    BEERI, C., FAGIN, R., MAIER, D., AND YANNAKAKIS, M. On the desirability of acyclic database schemes. J. ACM 30, 3 (July 1983), pp. 479–513.Google Scholar
  5. 5.
    BEERI, C., AND VARDI, M.Y. On the properties of join dependencies, in Advances in Database Theory, H. Gallaire, J. Minker, and J-M Nicolas, Eds., Plenum, New York, 1981, pp. 25–72.Google Scholar
  6. 6.
    BERGE, C., Graphs and Hypergraphs. North Holland, Amsterdam, 1976.Google Scholar
  7. 7.
    CHASE, K. Join graphs and acyclic database schemes. In Proc. 7th Int. Conf. on Very Large Databases, ACM, New York, 1981, pp. 95–100.Google Scholar
  8. 8.
    CODD, E.F., A relational model of data for large shared data banks. Commun. ACM 13, 6 (June 1970), pp. 377–387.Google Scholar
  9. 9.
    CODD, E.F., Further normalization of the relational database model. In Data Base Systems, Courant Computer Science Symposia 6, R. Rustin, Ed., Prentice Hall, 1971, pp. 65–98.Google Scholar
  10. 10.
    D'ATRI, A., AND MOSCARINI, M. Acyclic hypergraphs: Their recognition and top-down versus bottom-up generation. Tech.Rep. R.29, Consiglio Nazionale Delle Richerche, Institute di Analisi dei Sistemi ed Informatica, 1982.Google Scholar
  11. 11.
    FAGIN, R. Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM 30, 3(July 1983), pp. 514–550.Google Scholar
  12. 12.
    FAGIN, R., MENDELZON, A.O., AND ULLMAN, J.D., A simplified universal relation assumption and its properties. ACM Trans. Database Syst. 7,3 (Sept. 1982), pp. 343–360.Google Scholar
  13. 13.
    GOODMAN, N., AND SCHMUELI, O. Tree queris: A simple class of queries. ACM Trans. Database Syst. 7,4 (Dec. 1982), pp. 653–677.Google Scholar
  14. 14.
    LAKSHMANAN, V.S., VENI MADHAVAN, C.E., AND CHANDRASEKARAN, N. A structural characterization of α-acyclic database schemes, under preparation.Google Scholar
  15. 15.
    LIEN, Y.E. On the equivalence of database models. J. ACM 29,2 (Apr. 1982), pp. 333–362.Google Scholar
  16. 16.
    SCIORE, E. Real-world MVDs. In Proc. Int. Conf. on Management of Data, ACM, New York, 1981, pp.121–132.Google Scholar
  17. 17.
    ULLMAN, J.D., Principles of Database Systems. Computer Science Press, Potmac, Md., 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • V. S. Lakshmanan
    • 1
  • N. Chandrasskaran
    • 1
  • C. E. Veni Madhavan
    • 1
  1. 1.School of AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations