Advertisement

Acyclic Hypergraphs and Relational Databases (A Survey)

  • L. Tenenbaum
Part of the International Centre for Mechanical Sciences book series (CISM, volume 347)

Abstract

Structural properties of hypergraphs and relevant features of relational databases having acyclic schemes were intensively investigated during 80s. The investigations resulted in impressive issues for hypergraphs and relational databases theory as well applications. Since interests of database community were switched over from relational to more complicated data models the interest to this topic has ceased. The survey summarizes results of acyclic hypergraphs and database investigations and gives short comparative analysis of different approaches.

Keywords

Relational Database Acyclic HYPERGRAPHS Relational Database Theory Acyclic Scheme 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fagin R. Acyclic database schemes (of various degrees): a painless introduction in: Proceed. 8th Colloq. on Trees in Algebra. and Programming. L’Aquila. (Ttaly), March 1983; (Fds. Ausiello G., Prb tarsi M.) LNCS, v.159, Springer Verlag, 1983, 65–89.Google Scholar
  2. 2.
    D’Atri A., Moscarini M.: Recognition algorithms and design methodologies for acyclic database schemes. Advances in Computing Research, v. 3. (1986), 43–67.Google Scholar
  3. 3.
    Reeri C., Fagin R., Maier D., Mendelson A., Tillman J.T)., Ya.nna.kakis M. Properties of acyclic database schemes. Proceed. 13th Ann. ACM Symp. on Theory of Computing, (Milwa.uker, Wise., May 1981), ACM, New York, 1981, 355–362.Google Scholar
  4. 4.
    Ausiello G., D’Atri A., Moscarini M. Optimal acyclic coverings over hypergraphs, TAST-CNR Rep. #87. Rome 1984.Google Scholar
  5. 5.
    Faigin R., Mendelzon A., Ullman J.1).: A simplified universal relation and its properties. ACM Trans. on Database Systems, v.7, #3. (Sept.. 1982 ), 343–360.Google Scholar
  6. 6.
    Paredaens J., Van Gueht D.: An application of the theory of graphs and hypergraphs to the decomposition of relational database schemas, TR #82–27, Universitaire Installing Antwerpen, August 1982.Google Scholar
  7. 7.
    Ullman J.D.: Principles of data hase and knowledge hase systems, V. 1, Computer Science Press, Rockville MD 1983.Google Scholar
  8. 8.
    Paredaens J., De Rra P., Gyssens,M., Van Giicht. D.: The structure of the relational database model, Springer Verlag, London-Paris-Tokyo 1989.CrossRefGoogle Scholar
  9. 9.
    Atzeni P., Rat.ini C. and De Antonellis V.: Relational database theory, Addison-Wesley, Milano-Paris 1993.Google Scholar
  10. 10.
    Ullman J. T).: The T?. R.. strikes hack, in Proceed. 1st. ACM Symp. on Principles of Database Systems, (Los Angeles, Ca, March 1982 ), ACM, New-York 1982, 10–22.Google Scholar
  11. 11.
    Atzeni P., Parker T).S.: Assumptions in relational database theory, in: Proceed. 1st. ACM Symp. on Principles of Database Systems (Los Angeles, Ca, March. 1982 ) ACM, New-York 1982, 1–9.Google Scholar
  12. 12.
    Berge C.: Graphs and hypergraphs, North-Holland, New York 1976.MATHGoogle Scholar
  13. 13.
    Berge C.: Hypergraphs, North-Holland, Amsterdam-New York-Oxford-Tokyo 1989.MATHGoogle Scholar
  14. 14.
    Ausiello G., D’Atri A., Moscarini M.: Minimal coverings of acyclic database schemata, TAST-CNR Rep. #41, Rome1982.Google Scholar
  15. 15.
    Ausiello G., D’Atri A., Moscarini M.: Minimal coverings of acyclic database schemata, in: Advances in Data Rase Theory, v.2 (Fds. Ga.11aire H., Minker.T.. Nicolas.T.-M.), Plenum Press, New York 1984, 27–51.Google Scholar
  16. 16.
    D’Atri A., Moscarini M.: Acyclic hypergraphs: their recognition and top-down vs bottom-up generation, TAST-CNR. Rep. X29, Rome 1982.Google Scholar
  17. 17.
    F. Harar: Graph Theory, Addison-Wesley, Reading-Menlo Park-London 1969.Google Scholar
  18. 18.
    Oyst.ein Ore: Theory of Graphs. Amer. Math. Soc., Rhode Tsland 1962.Google Scholar
  19. 19.
    Fain R.: Degrees of a.cyclicit.y for hypergraphs and relational database schemes, J. of ACM, v.30. #3, (July 1923). 514–550.Google Scholar
  20. 20.
    Reeri C., Fagin R… Maier D., Yannakakis M. On the desirability of acyclic database schemes. J. of ACM. v.30, #3, (July 1983), 479–513.Google Scholar
  21. 21.
    D’Atri A., Moscarini M.: Recognition and design of acyclic databases, TAST-CNR Rep. 78, Rome: 1923.Google Scholar
  22. 22.
    Graham M.H.: On the universal relation. Tech. Rep. CSR.G, of University of Toronto, Toronto 1979.Google Scholar
  23. 23.
    Zaniolo C.: Analysis and design of relational schemata for database systems. (PhD. Diss), Tech. Rep. UCLA-FNG-7669, UCLA 1976.Google Scholar
  24. 24.
    Fagin R.: Types of a.cyclicity for hypergraphs and relational database schemes. TRM Rep. R.J3330, IBM 1981.Google Scholar
  25. 25.
    Ausiello G.,D’Atri A., Moscarini M.: On the existence of acyclic views in a database scheme, TAST-CNR. Rep. #86, Rome 1984.Google Scholar
  26. 26.
    Chase K.: Join graphs and acyclic databases schemes, in: Proceed. of 7th intern. Conf. on VLDR (Cannes, France, Sept. 1981 ), ACM, New York 1981, 95–100.Google Scholar
  27. 27.
    Paredaens J., Van Giicht D.: An application of the theory of graphs and hypergraphs to the decomposition of relational database schemes, in: Proceed. 8th Colloqium on Trees in Algebra. and Programming, L’Aquila (Italy), March 1983. (F.ds. Ausiello G., Protassi M.), LNCS, v.159, Springer Verlag 1983, 351–366.Google Scholar
  28. 28.
    foodma.n N., Shmueli O.: The tree property is fundamental for query processing, in: Proceed. 1st. ACM Symp. on Principles of Database Systems (Los Angeles, Ca, March 1982), ACM, New York 1922, 40–48.Google Scholar
  29. 29.
    Goodman N., Schmueli O.: Transforming cyclic schemes into trees, in: Proceed. 1st ACM Symposium on Principles of Database Systems (los Angeles Ca, March 1982 ), ACM, New York 1982, 40–48.Google Scholar
  30. 30.
    Hull R..: Acyclic join dependencies and database projections. J. Computer and Systems Science, v.27, #2, (1923), 331–349.Google Scholar
  31. 31.
    Maier D., Ullman J.D.: Connections in acyclic hypergraphs, in: Proceed. 1st ACM Symposium on Principles Database Systems. (Los Angeles Ca, March 1922 ), ACM, New York 1982, 34–39.Google Scholar
  32. 32.
    D’Atri a., Mosca.rini M., Spirat.os N.: Answering queries in relational databases. in: Proceed. of Data Rase Week (San Jose, May 1983), STGMOD Record, v.13. t4 (1983), 173–177.Google Scholar
  33. 33.
    Garet’ M.R. and Johnson D.: Computers and intractability, Freeman 1979.Google Scholar
  34. 34.
    Sacca D.: On the recognition of covering of acyclic database hypergraphs, in: Proceed. 2d ACM Sympos.. on principles of DRS. (Atlanta, Georgia, March 1 983), AIM 1983, 297–304.Google Scholar
  35. 35.
    Maier D., Rosenstein D. and Warren D.S.: Windows on the World. STGMOD Record. v.13. #4(Proceed. Ann. Meeting of STGMOD, May 1983 ), 68–78.Google Scholar
  36. 36.
    Ausiello G., D’Atri A., Moscarini M.: On the ev:ist.ence of acyclic views in a. database scheme, Theoretical Computer Science, v. 35 (1985), 165–177.CrossRefMATHMathSciNetGoogle Scholar
  37. 37.
    Paredaens J. and Van Gucht. D.: Application of the theory of graphs and hypergraphs to the decomposition of relational database schemes, in: Proceed. Rth Colloqium on Trees in Algebra and Programming L’Aquila (Ttaly), 1983), TACS, v. 159. Springer Verlag, Berlin 1983, 65–89.Google Scholar
  38. 38.
    Ullman.T. D.: Universal relat.ion interfaces for database systems, in: Proceed. of T,FTP World Computer Congress, Paris 1923 ), 243–252.Google Scholar
  39. 39.
    Yannakakis M.: Alaorithms for acyclic database schemes, in: Proceed. 7th Conf. on VLDR (Cannes, France, Sept. 1981 ), ACM, New York 1981, 82–94Google Scholar
  40. 40.
    Rissanen J.: Independent. components of relations, ACM Trans. Database Syst, v. 2 1981, 82–94Google Scholar
  41. 41.
    Beeri C. and Rissanen J.: Faithful representation of relational database schemes, TBM Res. Lab, Res. Rep. RJ2722, San Jose 1980.Google Scholar
  42. 42.
    Honeyman P., Landner R.R. and Yannakakis M.,: Testing universal instance assumption, Tnform. Proceed. Lettr, v. 10, #1 (1980), 14–19Google Scholar
  43. 43.
    Vardi M. On decomposition of relational databases, in Proceed. 23th TEEF., New York 1982, 176–185Google Scholar
  44. 44.
    Sciore S.: The universal instance and database design. (PhD. Dissert.) Prinston Univers., Prinston N.J. 1980Google Scholar
  45. 45.
    Korth H.F. and Tillman J.D.: SYSTFM/U: A database system based on universal relation assumption, in: Proceed. XPT Workshop on Relational Database Theory, (Stony Brook, N.J. June 1 980 ).Google Scholar
  46. 46.
    Tien Y.F.: Multivalued dependencies with null values in relational data bases, in: Proceed. 5th Tnt. Conf. on VT,DR (Rio de Janeiro, Brasil, Oct., 1979 ), ACM, New York 1979, 61–66.Google Scholar
  47. 47.
    Maier D.: Discarding the universal instance assumption: preliminary-results, in: Proceed. XPT Workshop on Relational Database Theory, ( Stony Brook. N.J., June 1980 ).Google Scholar
  48. 48.
    Tarjan R.F. and Yannakakis M.: Simple linear-time algorithms to test hordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs. Bell Laboratories, Tech. Rep.,Murray Hill N.J. 1982.Google Scholar
  49. 49.
    Walker A.: Time and space in a lattice of universal relations with blank entries, in: Proceed. XPT Workshop on Relational Database Theory, ( Stony Brook, N.J. June 1980 ).Google Scholar
  50. 50.
    Thalheim R. Dependencies in Relational Databases, R.G. Teuher Verlagsgesellschaft., Stuttgart-Leipzig: 1991.CrossRefGoogle Scholar
  51. 51.
    Aho A.V., Reeri C. and Ullman J.D.: The theory of joins in relational databases, ACM Trans. on Database Systems, v.4, 4i3 (1979), 297–314.Google Scholar
  52. 52.
    Rissanen J.: Theory of relations for databases–a tutorial survey, in: Proceed. 7th Symp. on Math. Found. of Computer Science, T.NCS, v. 64, Springer Verlag, New York 1978, 537–551.Google Scholar
  53. 53.
    Tien Y.F.: On the equivalence of database models, J. of ACM, v.29,.#2, (1982), 333–362.Google Scholar
  54. 54.
    Honeyman P.: Functional dependencies and the universal instance property in relational model of database systems, (PhD. Diss.), Prinston University, Prinston, N.J. 1980.Google Scholar
  55. 55.
    Sciore S.: Some observations on real-world data dependencies, in: Proceed. XPT Workshop on Relational Database Theory, ( Stony Brook, N. J. June 1980 ).Google Scholar
  56. 56.
    Bernstein P.A. and Chiu D.W.: Usi ng semijoins to solve relational queries, J. of ACM, v. 28, #1 (1981) 25–40.Google Scholar
  57. 57.
    Bernstein P.A. and Goodman N.: The power of natural joins, STAM J. Comput, v.10, »4 (1981), 751–771.Google Scholar
  58. 58.
    Vii C.T. and Ozsoyoglu M.7.: An algorithm for tree-query membership of a. dist.rihut.ed query, in: Proceed. TEEF COMPSAC, (Chicago, Nov. 1979 ), TFFF, New York 1979. 306–312.Google Scholar

Copyright information

© Springer-Verlag Wien 1994

Authors and Affiliations

  • L. Tenenbaum
    • 1
  1. 1.Academy Sciences of RussiaMoscowRussia

Personalised recommendations