A. V. Aho
Abstract
Answering queries in a relational database often requires that the natural join of two or more relations be computed. However, the result of a join may not be what one expects. In this paper we give efficient algorithms to determine whether the join of several relations has the intuitively expected value (is lossless) and to determine whether a set of relations has a subset with a lossy join. These algorithms assume that all data dependencies are functional. We then discuss the extension of our techniques to the case where data dependencies are multivalued.
- 1 AHO, A.V., HOPCROFT, J.E., AND ULLMAN, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974. Google Scholar
Digital Library
- 2 ARMSTRONG, W.W. Dependency structures of data base relationships. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 580-583.Google Scholar
- 3 ARORA, A.K., AND CARLSON, C.R. The information preserving properties of relational database transformations. Proc. Int. Conf. on Very Large Data Bases, West Berlin, Sept. 1978, pp. 352-359.Google Scholar
- 4 BEF.RI, C. On the membership problem for multivalued dependencies in relational database systems. Tech. Rep. 229, Dept. Elec. Eng. and Comptr. Sci., Princeton U., Princeton, N.J., Sept. 1977. To appear in A CM Trans. Database Syst.Google Scholar
- 5 BEERI, C., BERNSTEIN, P.A., AND GOODMAN, N. A sophisticate's introduction to database normalization theory. Proc. Int. Conf. on Very Large Data Bases, West Ber!in, Sept. 1978, pp. 113-124.Google Scholar
- 6 BERNSTEIN, P.A. Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. 1, 4 (Dec. 1976), 277-298. Google ScholarDigital Library
- 7 BERNSTEIN, P.A., AnD BEERI, C. An algorithmic approach to normalization of relational database schemas. Tech. Rep. CSRG-73, Comptr. Sci. Res. Group, U. of Toronto, Toronto, Canada, Sept. 1976.Google Scholar
- 8 BEERI, C., FAGIN, R., AND HOWARD, J.H. A complete axiomatization for functional and multivalued dependencies. Proc. ACM SIGMOD Int. Conf. on Manage. of Data, Toronto, Canada, Aug. 1977, pp. 47-61. Google ScholarDigital Library
- 9 CARLSON, C.R., AND KAPLAN, R.S. A generalized access path model and its application to a relational data base system. Proc. ACM SIGMOD Conf., Washington, D.C., 1976, pp. 143-154. Google ScholarCross Ref
- 10 CODD, E.F. A relational model for large shared data banks. Comm. ACM 13, 6 (June 1970), 377- 387. Google ScholarDigital Library
- 11 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, pp. 33-64.Google Scholar
- 12 CODD, E.F. Recent investigations in relational data base systems. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 1017-1021.Google Scholar
- 13 DELOBEL, C. Contributions theoretiques a la conception d'un systeme d'informations. Ph.D. Th., U. of Grenoble, Grenoble, France, Oct. 1973.Google Scholar
- 14 DELOBEL, C., AND CASEY, R.G. Decomposition of a data base and the theory of Boolean switching functions. IBM J. Res. and Develop. 17, 5 (Sept. 1972), 370-386.Google Scholar
- 15 FAGIN, R. Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst. 2, 3 (Sept. 1977), 262-278. Google ScholarDigital Library
- 16 GUTHERY, S.B., AND O'NEILL, D.M. The syntax and semantics of functional dependency. Unpub. memo., Bell Laboratories, Holmdel, N.J., 1976.Google Scholar
- 17 MAIER, D., MENDELZON, A.O., SADRI, F., AND ULLMAN, J.D. Adequacy of decompositions of relational databases. Dept. Elec. Eng. and Comptr. Sci., Princeton University, Princeton, N.J., 1979.Google Scholar
- 18 MANACHER, G.K. On the feasibility of implementing a large relational data base with optimal performance on a minicomputer. Proc. Int. Conf. on Very Large Data Bases, Framingham, Mass., Sept. 1975, pp. 175-201.Google ScholarDigital Library
- 19 RISSANEN, J. Independent components of relations. ACM Trans. Database Syst. 2, 4 (Dec. 1977), 317-325. Google ScholarDigital Library
- 20 TARJAN, R.E. Depth-first search and linear graph algorithms. SIAM J. Comptng. 1, 2 (1972), 146-160.Google ScholarCross Ref
- 21 ZANIOLO, C. Analysis and design of relational schemata for database systems. Tech. Rep. UCLA- ENG-7769, Dept. Comptr. Sci., U. of California, Los Angeles, Calif., July 1976.Google ScholarDigital Library
Index Terms
- The theory of joins in relational databases
Recommendations
Hierarchical schemata for relational databases
Most database design methods for the relational model produce a flat database, that is, a family of relations with no explicit interrelational connections. The user of a flat database is likely to be unaware of certain interrelational semantics. In ...
Query Interoperation Among Object-Oriented and Relational Databases
ICDE '95: Proceedings of the Eleventh International Conference on Data EngineeringWe develop an efficient algorithm for the query interoperation among existing heterogeneous object-oriented and relational databases. Our algorithm utilizes a canonical deductive database as a uniform representation of object-oriented schema and data. ...
Cooperative querying in relational databases
SCCC '97: Proceedings of the 17th International Conference of the Chilean Computer Science SocietyThis paper proposes an architecture for cooperative access to databases, and describes a cooperative interface for querying relational databases (i.e., an interface that assists non-experienced and casual users to get useful answers from a relational ...
Comments