Advertisement

The theory of data dependencies — An overview

  • Ronald Fagin
  • Moshe Y. Vardi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)

Abstract

Dependencies are certain sentences of first-order logic that are of special interest for database theory and practice. There has been quite a bit of research in the last decade in investigating dependencies. A selective overview of this research is presented. In particular, the focus is on the implication problem for dependencies, and on issues related to the universal relation model.

Keywords

Relational Database Axiom System Database Scheme Universal Relation Access Path 
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.

Bibliography

  1. [ABU]
    A. V. Aho, C. Beeri, and J. D. Ullman, The theory of joins in relational data bases. ACM Trans. on Database Systems 4,3 (Sept. 1979), 297–314.Google Scholar
  2. [ASU]
    A. V. Aho, Y. Sagiv, and J. D. Ullman, Equivalences among relational expressions. SIAM J. Computing 8,2 (May 1979), 218–246.Google Scholar
  3. [Ar]
    W. W. Armstrong, Dependency structures of database relationships. Proc. IFIP 74, North Holland, 1974, 580–583.Google Scholar
  4. [Bee]
    C. Beeri, On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans. on Database Systems 5,3 (Sept. 1980), 241–259.Google Scholar
  5. [BB]
    C. Beeri and P. A. Bernstein, Computational problems related to the design of normal form relational schemas. ACM Trans. on Database Systems 4,1 (March 1979), 30–59.Google Scholar
  6. [BBG]
    C. Beeri, P. A. Bernstein, and N. Goodman, A sophisticate's introduction to database normalization theory. Proc. Int. Conf. on Very Large Data Bases, 1978, Berlin, 113–124.Google Scholar
  7. [BFH]
    C. Beeri, R. Fagin, and J.H. Howard, A complete axiomatization for functional and multivalued dependencies in database relations. Proc. ACM SIGMOD Conf. on Management of Data, 1977, Toronto, 47–61.Google Scholar
  8. [BFMY]
    C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the desirability of acyclic database schemes. J. ACM 30,3 (July 1983), 479–513.Google Scholar
  9. [BH]
    C. Beeri and P. Honeyman, Preserving functional dependencies. SIAM J. Computing 10,3 (Aug. 1981), 647–656.Google Scholar
  10. [BK]
    C. Beeri and H. F. Korth, Proc. 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1982, Los Angeles, 51–62.Google Scholar
  11. [BMSU]
    C. Beeri, A. O. Mendelzon, Y. Sagiv, and J. D. Ullman, Equivalence of relational database schemes, SIAM J. Computing 10,2 (June 1981), 352–370.Google Scholar
  12. [BR]
    C. Beeri and J. Rissanen, Faithful representation of relational database schemes. IBM Research Report, San Jose, California, 1980.Google Scholar
  13. [BV1]
    C. Beeri and M. Y. Vardi, On the properties of join dependencies. In Advances in Database Theory (H. Gallaire, J. Minker, and J. M. Nicolas, Eds.), Plenum Press, 1981, 25–72.Google Scholar
  14. [BV2]
    C. Beeri and M. Y. Vardi, A proof procedure for data dependencies. Hebrew University of Jerusalem Technical Report, Dec. 1980.Google Scholar
  15. [BV3]
    C. Beeri and M. Y. Vardi, On the complexity of testing implications of data dependencies. Hebrew University of Jerusalem Technical Report, Dec. 1980.Google Scholar
  16. [BV4]
    C. Beeri and M. Y. Vardi, Formal systems for tuple and equality-generating dependencies. SIAM J. Computing 13,1 (Feb 1984), 76–98.Google Scholar
  17. [BV5]
    C. Beeri and M. Y. Vardi, Formal systems for join dependencies. Hebrew Univ. of Jerusalem Technical Report, 1981. To appear in Theoretical Computer Science.Google Scholar
  18. [BV6]
    C. Beeri and M. Y. Vardi, The implication problem for data dependencies. Proc. XP1 Workshop on Relational Database Theoery, Stony Brook, NY, June 1980.Google Scholar
  19. [BV7]
    C. Beeri and M. Y. Vardi, The implication problem for data dependencies. Proc. 8th Int. Colloq. on Languages Automata and Programming, 1981, Acre Israel. Appeared in: Lecture Notes in Computer Science-Vol. 115, Springer-Verlag, 1981, 73–85.Google Scholar
  20. [Ber]
    P. A. Bernstein, Synthesizing third normal form relations from functional dependencies. ACM Trans. on Database Systems 1,4 (Dec. 1976), 277–298.Google Scholar
  21. [CFP]
    M. A. Casanova, R. Fagin, and C. Papadimitriou, Inclusion dependencies and their interaction with functional dependencies. Proc. 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Systems (1982), Los Angeles, 171–176. To appear in J. Computer and System Sciences.Google Scholar
  22. [CM]
    E. P. F. Chan and A. O. Mendelzon, Independent and separable database schemes. Proc. 2nd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1983, Atlanta, 288–296.Google Scholar
  23. [CLM1]
    A. K. Chandra, H. R. Lewis, and J. A. Makowsky, Embedded implicational dependencies and their inference problem. Proc. XP1 Workshop on Relational Database Theoery, Stony Brook, NY, June 1980.Google Scholar
  24. [CLM2]
    A. K. Chandra, H. R. Lewis, and J. A. Makowsky, Embedded implicational dependencies and their inference problem. Proc. 13th ACM Symp. on Theory of Computing, 1981, Milwaukee, 342–354.Google Scholar
  25. [CV]
    A. K. Chandra and M. Y. Vardi, The implication problem for functional and inclusion dependencies is undecidable. IBM Research Report RC 9980, May 1983.Google Scholar
  26. [Co1]
    E. F. Codd, A relational model of data for large shared data banks. Comm. ACM 13,6 (June 1970), 377–387.Google Scholar
  27. [Co2]
    E. F. Codd, Further normalization of the data base relational model. Courant Computer Science Symposia 6: Data Base Systems, 1971, Prentice Hall, 33–64.Google Scholar
  28. [Co3]
    E. F. Codd, Relational databases: a practical foundation for productivity. Comm. ACM 25,2 (1982), 109–117.Google Scholar
  29. [DP]
    P. De Bra and J. Paredaens, Conditional dependencies for horizontal decompositions. Proc. 10th Int. Colloq. on Languages Automata and Programming, 1981, Barcelona. Appeared in: Lecture Notes in Computer Science-Vol. 154, Springer-Verlag, 1983, 67–82.Google Scholar
  30. [DST]
    P. J. Downey, R. Sethi, and R. E. Tarjan, Variations on the common subexpression problem. J. ACM 27,4 (Oct. 1980), 758–771.Google Scholar
  31. [DG]
    B. S. Dreben and W. D. Goldfarb, The Decision Problem: Solvable Classes of Quantificational Formulas. Addison Wesley, 1979.Google Scholar
  32. [Fa1]
    R. Fagin, Multivalued dependencies and a new normal form for relational databases. ACM Trans. on Database Systems 2,3 (Sept. 1977), 262–278.Google Scholar
  33. [Fa2]
    R. Fagin, A normal form for relational databases that is based on domains and keys. ACM Trans. on Database Systems 6,3 (Sept. 1981), 387–415.Google Scholar
  34. [Fa3]
    R. Fagin, Armstrong databases. Proc. 7th IBM Symp. on Mathematical Foundations of Computer Science, Kanagawa, Japan, May 1982. Also appeared as IBM Research Report RJ3440 (April 1982), San Jose, California.Google Scholar
  35. [Fa4]
    R. Fagin, Horn clauses and database dependencies. J. ACM 29,4 (Oct. 1982), 952–985.Google Scholar
  36. [Fa5]
    R. Fagin, Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM 30,3 (July 1983), 514–550.Google Scholar
  37. [FMU]
    R. Fagin, A. O. Mendelzon, and J. D. Ullman, A simplified universal relation assumption and its properties. ACM Trans. on Database Systems 7,3 (Sept. 1982), 343–360.Google Scholar
  38. [TF]
    P. C. Fischer and D.-M. Tsou, Whether a set of multivalued dependencies implies a join dependencies is NP-hard. To appear in Theoretical Computer Science.Google Scholar
  39. [Ga]
    Z. Galil, An almost linear-time algorithm for computing a dependency basis in a relational database. J. ACM 29,1 (Jan. 1982), 96–102.Google Scholar
  40. [GJ]
    M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. Freeman, 1979.Google Scholar
  41. [GZ]
    S. Ginsburg and S. M. Zaiddan, Properties of functional dependency families. J ACM 29,4 (July 1982), 678–698.Google Scholar
  42. [Gr1]
    M. H. Graham, Path expressions in databases. Proc. 2nd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1983, Atlanta, 366–378.Google Scholar
  43. [Gr2]
    M. H. Graham, Functions in databases. ACM Trans. on Database Systems 8,1 (March 1983), 81–109.Google Scholar
  44. [GM]
    M. H. Graham and A. O. Mendelzon, Notions of dependency satisfaction. Proc. 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1983, Los Angeles, 177–188.Google Scholar
  45. [GMV]
    M. H. Graham, A. O. Mendelzon, and M. Y. Vardi, Notions of dependency satisfaction. Stanford University Technical Report STAN-CS-83-979, Aug. 1983.Google Scholar
  46. [GY]
    M. H. Graham and M. Yannakakis, Independent database schemes. Proc. 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1982, Los Angeles, 199–204. To appear in J. Computer and Systems Sciences.Google Scholar
  47. [GJ]
    J. Grant and B. E. Jacobs, On the family of generalized dependency constraints. J. ACM 29,4 (Oct. 1982).Google Scholar
  48. [GL]
    Y. Gurevich and H. R. Lewis, The inference problem for template dependencies. Proc. First ACM SIGACT-SIGMOD Principles of Database Systems (1982), Los Angeles, 221–229.Google Scholar
  49. [HITK]
    K. Hagihara, M. Ito, K. Taniguchi, and T. Kasami, Decision problems for multivalued dependencies in relational databases. SIAM J. Computing 8,2 (May 1979), 247–264.Google Scholar
  50. [He]
    I. J. Heath, Unacceptable file operations in a relational data base. Proc. 1971 ACM-SIGFIDET Workshop on Data Description, Access, and Control, 1971, San Diego.Google Scholar
  51. [Ho]
    P. Honeyman, Testing satisfaction of functional dependencies. J. ACM 29,3 (July 1982), 668–677.Google Scholar
  52. [HLY]
    P. Honeyman, R. E. Ladner, and M. Yannakakis, Testing the universal instance assumption. Inf. Proc. Letters, 10,1 (1980), 14–19.Google Scholar
  53. [Hu]
    R. Hull, Finitely specifiable implicational dependency families. Univ. of Southern California Technical Report, 1981. To appear in J. ACM.Google Scholar
  54. [JK]
    D. S. Johnson and A. Klug, Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. Proc. 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1982, Los Angeles, 164–169. To appear in J. Computer and Systems Sciences.Google Scholar
  55. [KCV]
    P. C. Kannelakis, S. S. Cosmadakis, and M. Y. Vardi, Unary inclusion dependencies have polynomial-time inference problems. Proc. 15th ACM SIGACT Symp. on Theory of Computing, 1983, Boston, 264–277.Google Scholar
  56. [LMG]
    [LMG]K. Laver, A. O. Mendelzon, and M. H. Graham, Functional dependencies on cyclic database schemes. Proc. ACM SIGMOD Symp. on Management of Data, 1983, San Jose, 79–91.Google Scholar
  57. [Le]
    H. Lewis, Complexity results for classes of quantificational formulas. J. Computer and Systems Sciences 21,3 (Dec. 1980), 317–353.Google Scholar
  58. [LD]
    L. Liu and A. Demers, An algorithm for testing lossless join property in relational databases. Information Processing Letters 11,2 (1980), 73–76.Google Scholar
  59. [Ma]
    D. Maier, The Theory of Relational Databases. Computer Science Press, Rockville, Maryland, 1983.Google Scholar
  60. [MMSU]
    D. Maier, A. O. Mendelzon, F. Sadri, and J. D. Ullman, Adequacy of decompositions of relational databases. J. Computer and Systems Sciences 21,3 (Dec. 1980), 368–379.Google Scholar
  61. [MMS]
    D. Maier, A. Mendelzon, and Y. Sagiv, Testing implications of data dependencies. ACM Trans. on Database Systems 4,4 (Dec. 1979), 455–469.Google Scholar
  62. [MRW]
    D. Maier, D. Rozenshtein, and D. S. Warren, Windows on the world. Proc. ACM SIGMOD Symp. on Management of Data, 1983, San Jose, 68–78.Google Scholar
  63. [MSY]
    D. Maier, Y. Sagiv, and M. Yannakakis, On the complexity of testing implications of functional and join dependencies. J. ACM 28,4 (Oct. 1981), 680–695.Google Scholar
  64. [MUV]
    D. Maier, J. D. Ullman, and M. Y. Vardi, The revenge of the JD. Proc. 2nd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1983, Atlanta, 279–287.Google Scholar
  65. [Me]
    A. Mendelzon, Database states and their tablueax. Proc. XP2 Workshop on Relational Database Theory, June 1981.Google Scholar
  66. [MM]
    Mendelzon, A. O. and D. Maier, Generalized mutual dependencies and the decomposition of database relations. Proc. Int. Conf. on Very Large Data Bases, (A. L. Furtado and H. L. Morgan, eds.), 1979, 75–82.Google Scholar
  67. [Mi1]
    J. C. Mitchell, Inference rules for functional and inclusion dependencies. Proc. 2nd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1983, Atlanta, 58–69.Google Scholar
  68. [Mi2]
    J. C. Mitchell, The implication problem for functional and inclusion dependencies. MIT Technical Report. To appear in Information and Control.Google Scholar
  69. [Ni]
    J-M. Nicolas, First order logic formalization for functional, multivalued, and mutual dependencies. Proc. ACM SIGMOD Symp. on Management of Data, 1978, 40–46.Google Scholar
  70. [Pa]
    J. Paredaens, Transitive dependencies in a database scheme. MBLE Research Report R387, 1979.Google Scholar
  71. [PJ]
    J. Paredanes and D. Janssens, Decompositions of relations: a comprehensive approach. In Advances in Data Base Theory — Vol. 1 (H. Gallaire, J. Minker, and J-M. Nicolas, eds.), Plenum Press, 1981, 73–100.Google Scholar
  72. [PP]
    D. S. Parker and K. Parsaye-Ghomi, Inference involving embedded multivalued dependencies and transitive dependencies. Proc. ACM SIGMOD Symp. on Management of Data, 1980, 52–57.Google Scholar
  73. [Ri1]
    J. Rissanen, Independent components of relations, ACM Trans. on Database Systems 2,4 (1977), 317–325.Google Scholar
  74. [Ri2]
    J. Rissanen, Theory of relations for databases — a tutorial survey. Proc. 7th Symp. on Math. Found. of Comp. Science, 1978, Lecture Notes in Computer Science — Vol. 64, Springer-Verlag, 537–551.Google Scholar
  75. [Ri3]
    J. Rissanen, On equivalence of database schemes. Proc. 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1982, Los Angeles, 23–26.Google Scholar
  76. [Ro]
    H. Rogers, Theory of Recursive Functions and Èffective Computability. McGraw-Hill, 1967.Google Scholar
  77. [SU]
    F. Sadri and J. D. Ullman, Template dependencies: A large class of dependencies in relational databases and their complete axiomatization. J. ACM 29,2 (April 1981), 363–372.Google Scholar
  78. [Sag1]
    Y. Sagiv, An algorithm for inferring multivalued dependencies with an application to propositional logic. J. ACM 27,2 (April 1980), 250–262.Google Scholar
  79. [Sag2]
    Y. Sagiv, Can we use the universal instance assumption without using nulls? Proc. ACM SIGMOD Symp. on Management of Data, 1981, 108–120.Google Scholar
  80. [Sag3]
    Y. Sagiv, A characterization of globally consistent databases and their correct access paths. ACM Trans. on Database Systems 8,2 (June 1983), 266–286.Google Scholar
  81. [SW]
    Y. Sagiv and S. Walecka, Subset dependencies and a completeness result for a subclass of embedded multivalued dependencies. J. ACM 29,1 (Jan. 1982), 103–117.Google Scholar
  82. [SS]
    M. Schkolnick and P. Sorenson, The effects of denormalization on database performance. The Australian Computer Journal 14,1 (Feb. 1982), 12–18.Google Scholar
  83. [Sc1]
    E. Sciore, Real-world MVDs. Proc. ACM SIGMOD Symp. on Management of Data, 1981, 121–132.Google Scholar
  84. [Sc2]
    E. Sciore, Inclusion dependencies and the universal instance. Proc. 2nd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1983, Atlanta, 48–57.Google Scholar
  85. [Sc3]
    E. Sciore, A complete axiomatization of full join dependencies. J. ACM 29,2 (April 1982), 373–393.Google Scholar
  86. [Ul]
    J. D. Ullman, Principles of Database Systems. Computer Science Press, Rockville, Maryland (1982)Google Scholar
  87. [Va1]
    M. Y. Vardi, The implication problem for data dependencies in relational databases. Ph.D. Dissertation (in Hebrew), The Hebrew University in Jerusalem, Sept. 1981.Google Scholar
  88. [Va2]
    M. Y. Vardi, The implication and finite implication problems for typed template dependencies. Proc. 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1982, Los Angeles, 230–238. To appear in J. Computer and Systems Sciences.Google Scholar
  89. [Va3]
    M. Y. Vardi, On decomposition of relational databases. Proc. 23rd IEEE Symp. on Foundation of Computer Science, Chicago, 1982, 176–185.Google Scholar
  90. [Va4]
    M. Y. Vardi, Inferring multivalued dependencies from functional and join dependencies. Acta Informatica, 19(1983), 305–324.Google Scholar
  91. [Va5]
    M. Y. Vardi, A note on lossless database decompositions. To appear in Information Processing Letters.Google Scholar
  92. [Ya]
    M. Yannakakis, Algorithms for acyclic database schemes. Proc. Int. Conf. on Very Large Data Bases, 1981, 82–94.Google Scholar
  93. [YP]
    M. Yannakakis and C. Papadimitriou, Algebraic dependencies. J. Computer and System Sciences 25,2 (1982), 3–41.Google Scholar
  94. [Za]
    C. Zaniolo, Analysis and design of relational schemata for database systems, Ph.D. Dissertation, Tech. Rep. UCLA-ENG-7669, UCLA, July 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Ronald Fagin
    • 1
  • Moshe Y. Vardi
    • 1
  1. 1.IBM Research LaboratorySan Jose

Personalised recommendations