On the foundations of the universal relation model

ACM Transactions on Database Systems (TODS)

Volumn 9, Issue 2, 1984, Pages 283-308

  Maier, David ^a   Ullman, Jeffrey D ^b   Vardi, Moshe Y ^b  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Access path; database; dependency; losslessness; query; relational algebra; relational model; representative instance; tableau; universal relation; user view; weak universal relations

Indexed keywords

DATABASE SYSTEMS;

EID: 0021439622     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/329.318580     Document Type: Article

References (52)

1. AHO, A.V. Private communication.
2. AHO, A.V., BEERI, C., AND ULLMAN, J.D. The theory of joins in relational databases. ACM Trans. Database Syst. 4 (1979), 297-314.
3. AHO, A.V., SAGIV, Y., AND ULLMAN, J.D. Equivalence of relational expressions. SIAM J. Comp. 8,2 (1979), 218-246. See also, Efficient optimization of a class of relational expressions. ACM Trans. Database Syst. 4 (1979), 435-454.
4. ARAZI-GONCZAROWSKI, Z. A high-level interface for naive users in a relational database. Report, Dept. of Computer Science, Hebrew Univ., Jerusalem, 1981.
5. ATZENI, P., AND PARKER, D.S. Assumptions in relational database theory. In Proceedings ACM Symposium on Principles of Database Systems (Los Angeles, Mar. 29-31,1982), ACM, New York, 1-9.
6. BABB, B. Joined normal form: A storage encoding for relational databases. ACM Trans. Database Syst. 7 (1982), 588-614.
7. BEERI, C., BERNSTEIN, P.A., AND GOODMAN, N. A sophisticate's introduction to database normalization theory. In Proceedings International Conference on Very Large Data Bases (1978), 113-124.
8. BEERI, C., AND RISSANEN, J. Faithful representation on relational database schemes. IBM Res. Rep., IBM Research Laboratory, San Jose, Calif., 1980.
9. BEERI, C., AND VARDI, M.Y. A proof procedure for data dependencies. Tech. Rep., Hebrew Univ., Jerusalem, 1980. Also, J. ACM, to appear.
10. BERNSTEIN, P.A. Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. 1 (1976), 277-298.
11. CARLSON, C.R., AND KAPLAN, R.S. A generalized access path model and its application to a relational database system. In Proceedings ACM SZGMOD International Symposium on Management of Data (1976), ACM, New York, 143-154.
12. CODD, E.F. A relational model for large shared data banks. Commun. ACM 13, 6 (June 1970), 377-387.
13. CODD, E.F. Relational databases: A practical foundation for productivity. Commun. ACM %,2 (Feb. 1982), 109-117.
14. CODD, E.F., ARNOLD, R.S., CADIOU, J.M., CHANG, CL., AND ROUSSOPOULOS, N. Rendezvous version I: An experimental English language query formulation system for casual users of relational databases. RJ2144, IBM, San Jose, Calif., 1978.
15. FAGIN, R. Horn clauses and database dependencies. J. ACM 29 (1982), 952-983.
16. FAGIN, R., MENDELZON, A.O., AND ULLMAN, J.D. A simplified universal relation assumption and its properties. ACM Trans. Database Syst. 7 (1982), 343-360.
17. GALLAIRE, H., AND MINKER, J. (Eds.) Logic and Data Bases. Plenum Press, New York, 1978.
18. GRAHAM, M.H., AND MENDELZON, A.O. Notions of dependency satisfaction. In Proceedings ACM Symposium on Principles of Database Systems (Los Angeles, Mar. 29-31,1982), ACM, New York, 177-188.
19. GRAHAM, M., AND VARDI, M.Y. On the complexity and axiomatizability of consistent database states. In Proceedings Symposium on Principks of Database Systems (Waterloo, 1984), ACM, New York, 281-289.
20. HONEYMAN, P. Testing satisfaction of functional dependencies. J. ACM, 29 (1982), 668-677.
21. HONEYMAN, P., LADNER, R.E., AND YANNAKAKIS, M. Testing the universal instance assumption. Znf. Process. Z&t. 20, 1 (1980), 14-19.
22. TMIIELINSKI, T., AND LIPSKI, W. On representing incomplete information in a relational database. In Proceedings International Conference on Very Large Data Bases (1981), 388-397.
23. KENT, W. Consequences of assuming a universal relation. ACM Trans. Database Syst. 6 (1981), 539-556.
24. KORTH, H.F., KUPER, G.M., AND ULLMAN, J.D. System/U: A database system based on the universal relation assumption. Res. Rep. STAN-CS-82-944, Stanford Univ., Jan. 1983.
25. KOWALSKI, R. Logic as a database language. Report, Dept. of Computing, Imperial College, London, 1981.
26. KUCK, S.M., AND SAGIV, Y. A universal relation database system implemented via the network model. In Proceedings ACM Symposium on Principles of Database Systems (Los Angeles, Mar. 29-31,1982), ACM, New York, 147-157.
27. LOZINSKI, E.L. Construction of relations in relational databases. ACM Trans. Database Syst. 5 (1980), 208-224.
28. MAIER, D. The Theory of Relational Databases. Computer Science Press, Rockville, Md., 1983.
29. MAIER, D. Discarding the universal instance assumption. In Proceedings XP/l Workshop (Stony Brook, N.Y., June, 1980).
30. MAIER, D., MENDELZON, A.O., SADRI, F., AND ULLMAN, J.D. Adequacy of decompositions in relational databases. J. Cornput. Syst. Sci. 21, 3 (1980), 368-380.
31. MAIER, D., MENDELZON, A.O., AND SAGIV, Y. Testing implications of data dependencies. ACM Trans. Database Syst. 4 (1979), 455-469.
32. MAIER, D., ROZENSHTEIN, D., AND WARREN, D.S. Windows on the world. In Proceedings ACM SZGMOD International Symposium on Management of Data (San Jose, Calif, May 23-26, 1983), ACM, New York, 68-78.
33. MAIER, D., ROZENSHTEIN, D., SALVETER, S., STEIN, J., AND WARREN, D.S. Toward logical data independence: A relational query language without relations. In Proceedings ACM SZGMOD International Symposium on Management of Data (Orlando, Fla., June 2-4, 1982), ACM, New York, 51-60.
34. MAIER, D., AND ULLMAN, J.D. Maximal objects and the semantics of universal relation databases. ACM Trans. Database Syst., 8, 1 (1983), 1-14.
35. MAIER, D., ULLMAN, J.D., AND VARDI, M.Y. Beyond representative instances. Manuscript, in preparation, Stanford Univ., Stanford, Calif.
36. MAIER, D., AND WARREN, D.S. Specifying connections for a universal relation scheme database. In Proceedings ACM SZGMOD International Symposium on Management of Data (Orlando, Fla., June 2-4, 1982), ACM, New York, l-7.
37. MENDELZON, A.O. Database states and their tableaux. Proc. XP2 Workshop (State College, Pa., June, 1981). See also, this issue, 264-282.
38. NICOLAS, J.M. First-order logic formalization for functional, multivalued, and mutual dependencies. In Proceedings ACM SZGMOD International Symposium on Management of Data (Austin, Tex., May 31, June 1-2,1978), ACM, New York, 40-46.
39. OSBORN, S.L. Towards a universal relation interface. In Proceedings International Conference on Very Large Data Bases (1979), 52-60.
40. REITER, R. Towards a logical reconstruction of relational database theory. Report, Dept. of Computer Science, Univ. of British Columbia, 1981. Also in On Conceptual Modelling:Perspectiues from Artificial Intelligence, Databases, and Programming Languages. M. L. Brodie, J. Mylopoulous, and J. Schmidt, Eds., Springer Verlag, 1984,191-233.
41. RISSANEN, J. Independent components of relations. ACM Trans. Database Syst. 2 (1977), 317-325.
42. SADRI, F., AND ULLMAN, J.D. Template dependencies: A large class of dependencies in relational databases and its complete axiomatization. J. ACM 29, 2 (1982), 363-372.
43. SAGIV, Y. Can we use the universal instance assumption without using nulls? In Proceedings ACM SIGMOD International Symposium on Management of Data (Ann Arbor, Mich., April 29-May 1, 1981), ACM, New York, 108-120.
44. SAGIV, Y. A characterization of globally consistent databases and their correct access paths. ACM Trans. Database Syst. 8 (1983), 266-286.
45. SCHENK, K.L., AND PINKERT, J.R. An algorithm for servicing multirelational queries. In Proceedings ACM SIGMOD International Symposium on Management of Data (Toronto, Aug. 3-5,1977), ACM, New York, 10-19.
46. ULLMAN, J.D. Principles of Database Systems. Computer Science Press, Potomac, Md., 1983.
47. ULLMAN, J.D. The U.R. strikes back. In Proceedings ACM Symposium on Principles of Database Systems (Los Angeles, Mar 29-31, 1982), ACM, New York, lo-22
48. ULLMAN, J.D. Universal relation interface for database systems. In Proceedings IFZP 1983, R.E.A. Mason, Ed., North-Holland, 243-252.
49. VARDI, M.Y. On decomposition of relational databases. In Proceedings IEEE 23rd Annual Symposium on Foundations of Computer Science (Nov. 1982), IEEE, New York, 176-183.
50. VARDI, M.Y. Axiomatization of functional and join dependencies in the relational model. M. SC. Thesis, Dept. of Applied Math., Weizmann Institute of Science, Rehovot, Israel, 1980.
51. YANNAKAKIS, M. Algorithms for acyclic database schemes. In Proceedings International Conference on Very Large Data Bases (1981), 82-94.
52. YANNAKAKIS, M., AND PAPADIMITRIOU, C.H. Algebraic dependencies. J. Comput. Syst. Sci. 25 (1982), 2-41.