Summary
Checking a database scheme for the lossless join property with respect to a set, M, of multivalued dependencies (MVDs) is NP-hard. We prove that, for a class of MVDs that includes the set of projected full MVDs, this check can be performed in polynomial time. Even with a lossless database scheme and a consistent database, joining the set of relations in the database can take time and space that is exponential in the size of the relation finally obtained. Joining the set of relations of such a database can be performed in polynomial time if the database scheme is project-join constructible with respect to M. We prove that project-join constructibility, a stricter condition than the lossless join property, can be detected in a database scheme in polynomial time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.References
Aho, A.V., Beeri, C., Ullman, J.D.: The theory of joins in relational databases. ACM Trans. Database Syst. 4, 297–314 (1979)
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data structures and algorithms. Reading, Mass: Addison-Wesley 1983
Beeri, C., Vardi, M.Y.: On the properties of join dependencies. In: Gallaire, H., Minker, J., Nicolas, J.M., (eds.) Advances in Data Base Theory, vol. 1, pp. 25–71. New York: Plenum 1981
Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. J. Assoc. Comput. Mach. 31, 718–741 (1984)
Fagin, R.: Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst. 2, 262–278 (1977)
Fagin, R., Vardi, M.Y.: The theory of data dependencies — A survey. I.B.M. Research Report RJ4321, San Jose, California, 1984
Fischer, P.C., Tsou, D.M.: Whether a set of multivalued dependencies implies a join dependency is NP-hard. SIAM J. Comput. 12, 259–266 (1983)
Galil, Z.: An almost linear-time algorithm for computing a dependency basis in a relational database. J. Assoc. Comput. Mach. 29, 96–102 (1982)
Gyssens, M.: On the complexity of join dependencies. ACM Trans. Database Syst. 11, 81–108 (1986)
Honeyman, P.: Extension joins. In: Proc. 6th Intl. Conf. on Very Large Databases, Montreal, Canada, pp. 239–244, 1980
Honeyman, P.: Testing satisfaction of functional dependencies. J. Assoc. Comput. Mach. 29, 668–677 (1982)
Honeyman, P., Ladner, R.E., Yannakakis, M.: Testing the universal instance assumption. Inf. Process. Lett. 10, 14–19 (1980)
Maier, D.: The theory of relational databases. Rockville, Maryland: Computer Science Press 1983
Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4, 455–469 (1979)
Maier, D., Ullman, J.D., Vardi, M.Y.: On the foundations of the universal relation model. ACM Trans. Database Syst. 9, 283–308 (1984)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Loizou, G., Thanisch, P. Losslessness and project-join constructibility in relational databases. Acta Informatica 24, 131–144 (1987). https://doi.org/10.1007/BF00264360
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264360