# A view of directions in relational database theory

Session 5: E. Shamir, Chairman

First Online:

## Abstract

We shall briefly survey what the author believes are some of the most fruitful directions in relational database theory. These directions include dependency inferences, support for the universal relation concept, null value semantics, and an exploration of the properties of acyclic database schemes.

Download
to read the full conference paper text

## References

- [ABU]Aho, A. V., C. Beeri, and J. D. Ullman, “The theory of joins in relational databases,”
*ACM Transactions on Database Systems*4:3 (1979), pp. 297–314.Google Scholar - [BBG]Beeri, C., P. A. Bernstein, and N. Goodman, “A sophisticate's introduction to database normalization theory,”
*Proc. International Conference on Very Large Data Bases*, pp. 113–124, 1978.Google Scholar - [BFH]Beeri, C., R. Fagin, and J. H. Howard, “A complete axiomatization for functional and multivalued dependencies,”
*ACM SIGMOD International Symposium on Management of Data*, pp. 47–61, 1977.Google Scholar - [BFMY]Beeri, C., R. Fagin, D. Maier, and M. Yannakakis, “On the desirable properties of acyclic database schemas,” manuscript in preparation.Google Scholar
- [BV1]Beeri, C. and M. Y. Vardi, “On the properties of join dependencies,”
*Proc. Workshop on Formal Bases for Databases*, Toulouse, Dec., 1979.Google Scholar - [BV2]Beeri, C. and M. Y. Vardi, “Complete axiomatizations for generalized dependencies,” Hebrew Univ., 1980.Google Scholar
- [B*]Beeri, C., R. Fagin, D. Maier, A. O. Mendelzon, J. D. Ullman, and M. Yannakakis, “Properties of acyclic database schemes,” to appear in
*Proc. 1981 ACM Symposium on Theory of Computing*.Google Scholar - [B]Bernstein, P. A., “Synthesizing third normal form relations from functional dependencies,”
*ACM Transactions on Database Systems*1:4 (1976), pp. 277–298.Google Scholar - [BG1]Bernstein, P. A. and N. Goodman, “What does Boyce-Codd normal form do?,”
*Proc. International Conference on Very Large Data Bases*, 1980.Google Scholar - [BG2]Bernstein, P. A. and N. Goodman, “The theory of semijoins,” TR CCA-79-27, Computer Corp. of America, Cambridge, Mass., 1979.Google Scholar
- [CLM]Chandra, A. K., H. R. Lewis, and J. A. Makowsky, “Embedded implicational dependencies and their inference problem,” Harvard Univ., 1980.Google Scholar
- [C1]Codd, E. F., “A relational model for large shared data banks,”
*Comm. ACM*13:6 (1970), pp. 377–387.Google Scholar - [C2]Codd, E. F., “Further normalization of the data base relational model,” in
*Data Base Systems*(R. Rustin, ed.), Prentice Hall, Englewood Cliffs, N. J., 1972.Google Scholar - [F1]Fagin, R., “Multivalued dependencies and a new normal form for relational databases,”
*ACM Transactions on Database Systems*2:3 (1977), pp. 262–278.Google Scholar - [F2]Fagin, R., “Horn clauses and database dependencies,”
*Proc. Twelfth Annual ACM Symposium on the Theory of Computing*, pp. 123–134, 1981.Google Scholar - [FMU]Fagin, R., A. O. Mendelzon, and J. D. Ullman, “A simplified universal relation assumption and its properties,” RJ2900, IBM, San Jose, Calif., 1980.Google Scholar
- [G]Graham, M. H., “On the universal relation,” technical report, Univ. of Toronto, Sept., 1979.Google Scholar
- [GZ]Ginsburg, S. and S. M. Zaiddan, “Properties of functional dependency databases,” Dept. of C. S., USC, 1980.Google Scholar
- [H]Honeyman, P., “Properties of the universal relation assumption,” Ph. D. thesis, Princeton Univ., Princeton, N. J., 1980.Google Scholar
- [K]Kent, W., “Consequences of assuming a universal relation,” IBM technical report, Dec., 1979, to appear in
*TODS*.Google Scholar - [KU]Korth, H. F. and J. D. Ullman, “SYSTEM/U: a database system based on the universal relation assumption,”
*Proc. XP1 Conference*, Stonybrook, N. Y., June, 1980.Google Scholar - [L1]Lien, Y. E., “On the equivalence of database models,” private communication, June, 1980.Google Scholar
- [L2]Lien, Y. E., “Multivalued dependencies with null values in relational data bases,”
*Proc. International Conference on Very Large Data Bases*, pp. 61–66, 1979.Google Scholar - [M]Maier, D., “Discarding the universal instance assumption: preliminary results,”
*Proc. XP1 Conference*, Stonybrook, N. Y., June, 1980.Google Scholar - [MU1]Maier, D. and J. D. Ullman, “Maximal objects and the semantics of universal relation databases,” TR-80-016, Dept. of C. S., SUNY, Stonybrook, N. Y., 1980.Google Scholar
- [MU2]Maier, D. and J. D. Ullman, “Paths in acyclic hypergraphs,” manuscript in preparation.Google Scholar
- [MMS]Maier, D., Y. Sagiv, and A. O. Mendelzon, “Testing implications of data dependencies,”
*ACM Transactions on Database Systems*4:4 (1979), pp. 455–469.Google Scholar - [P]Paredaens, J., “A universal formalism to express decompositions, functional dependencies, and other constraints in a relational database.” To appear in
*TCS*. To appear,*JACM*.Google Scholar - [PJ]Paredaens, J. and D. Jannsens, “Decomposition of relations: a comprehensive approach,” in
*Formal Bases for Databases*(H. Gallaire and J.-M. Nicolas, eds.), CERT workshop, Toulouse, 1979.Google Scholar - [R1]Rissanen, J., “Theory of joins for relational databases—a tutorial survey,”
*Proc. Seventh Symp. on Mathematical Foundations of Computer Science*, Lecture Notes in CS, 64, Springer-Verlag, pp. 537–551.Google Scholar - [R2]Rissanen, J., “Independent components of relations,”
*ACM Transactions on Database Systems*2:4 (1977), pp. 317–325.Google Scholar - [S1]Sciore, E., “Null values, updates, and normalization in relational databases,” doctoral dissertation, Princeton Univ., Princeton, N. J., 1980.Google Scholar
- [S2]Sciore, E., “A complete axiomatization for full join dependencies.” To appear in
*JACM*.Google Scholar - [SW]Sagiv, Y. and S. Walecka, “Subset dependencies as an alternative to embedded multivalued dependencies.” To appear in
*JACM*.Google Scholar - [SU1]Sadri, F. and J. D. Ullman, “A complete axiomatization for a large class of dependencies in relational databases,”
*Proc. Twelfth Annual ACM Symposium on the Theory of Computing*, pp. 117–122, 1980.Google Scholar - [SU2]Sadri, F. and J. D. Ullman, “The interaction between functional dependencies and template dependencies,”
*ACM SIGMOD International Symposium on Management of Data*, pp. 45–51, 1980.Google Scholar - [U]Ullman, J. D.,
*Principles of Database Systems*, Computer Science Press, Potomac, Md., 1980.Google Scholar - [V]Vassilou, Y., “Null values in database management—a denotational semantics approach,”
*ACM SIGMOD International Symposium on Management of Data*, pp. 162–169, 1979.Google Scholar - [W]Walker, A., “Time and space in a lattice of universal relations with bank entries,”
*Proc. XP1 Conference*, Stonybrook, N. Y., June, 1980.Google Scholar - [Y]Yannakakis, M., “Properties of acyclic databases,” unpublished memorandum, Bell Laboratories, Murray Hill, N. J., 1981.Google Scholar
- [YO]Yu, C. T. and M. Z. Ozsoyoglu, “An algorithm for tree-query membership of a distributed query,”
*Proc. Compsac-79*, pp. 306–312, 1979.Google Scholar - [YP]Yannakakis, M. and C. H. Papadimitriou, “Algebraic dependencies,”
*Proc. Twenty First Annual IEEE Symposium on Foundations of Computer Science*, pp. 328–332, 1980.Google Scholar - [Z]Zaniolo, C., “Analysis and design of relational schemata for database systems,” Ph. D. thesis, UCLA, 1976.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1981