Abstract
In this chapter classes of acyclic hypergraphs associated with classes of relational database schemata are investigated. Various concepts of minimal coverings over a given set of nodes are considered, their interpretation in terms of the relational model is given and their properties studied with respect to the acyclicity degree of the hypergraphs. Several results concerning the computational complexity of determining minimal coverings are provided.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A. V., Sagiv, Y. and Ullman, J. D. [1979] “Equivalence of relational expressions,” SIAM Journal of Computing 8(2) (May 1979) 218–246.
Beeri, C., Fagin, R., Maier, D., Mendelzon, A. O., Ullman, J. D., and Yannakakis, M. [1981a] “Properties of acyclic database schemes,” Proceedings 13th Annual ACM Symposium on Theory of Computing ,Milwaukee, Wisconsin (May 1981) 355–362.
Beeri, C., Fagin, R., Maier, D. and Yannakakis, M. [1981b] “On the desirability of acyclic database schemes”, IBM Report RJ 3131 ,San Jose, California (May 1981) to appear in Journal of the ACM.
Berge, C. [1973] Graphs and Hypergraphs, North-Holland, Amsterdam, The Netherlands (1973).
D’Atri, A. and Moscarini, M. [1982] “Acyclic hypergraphs: their recognition and top-down vs. bottom-up generation”, Report IASI-CNR R.29 ,Roma, Italy (January 1982).
D’Atri, A., Moscarini, M. and Spyratos, N. [1983] “Answering queries in relational databases”, Proceedings Annual Meeting of SIGMOD, SIGMOD RECORD 13(4) (May 1983) 173–177.
Fagin, R. [1982] “Types of acyclicity for hypergraphs and relational database schemes”, IBM Report RJ 3330 ,San Jose, California (version Sept. 1982), to appear in Journal of the ACM.
Fagin, R. [1983] “Acyclic Database Schemes (of Various Degrees): a Painless Introduction”, Proceedings 8th Colloquium on Trees in Algebra and Programming ,L’Aquila, Italy (March 1983), to appear in Lecture Notes in Computer Science, Springer Verlag.
Fagin, R., Mendelzon, A. O. and Ullman, J. D. [1982] “A simplified universal relation assumption and its properties,” ACM Transactions on Database Systems 7(3) (Sept.’82) 343–360.
Garey, M. R. and Johnson, D. [1979] Computers and Intractability ,Freeman, San Francisco, California (1979).
Graham, M. H. [1979] “On the universal relation”, unpublished memorandum, Dept. of Computer Science, University of Toronto, Canada (Sept. 1979).
Goodman, N. and Shmueli, O. [1982a] “Transforming cyclic Schemas into trees”, Proceedings First SIGACT-SIGMOD ACM Symposium on Principles of Database Systems ,Los Angeles, California (March 1982) 49–54.
Goodman, N. and Shmueli, O. [1982b] “The tree property is fundamental for query processing”, Proceedings First SIGACT-SIGMOD Symposium on Principles of Database Systems ,Los Angeles California (March 1982) 40–48.
Johnson, D. [1973] “Approximation algorithms for combinatorial problems”, Proceedings 5th Annual ACM Symposium on Theory of Computing ,Austin, Texas (May 1973) 38–49.
Korth, H. F., Kuper, G. M. and Ullman, J. D. [1983] “System/U: a database system based on the universal relation assumption”, Report No. STAN-CS-82-944 ,Dept. of Computer Science, Stanford University, Stanford, California (January 1983).
Kuck, S. M. and Sagiv, Y. [1982] “A universal relation data-base system implemented via the network model”, Proceedings First SIGACT-SIGMOD ACM Symposium on Principles of Database Systems ,Los Angeles, California (March 1982) 147–157.
Maier, D., Rozenhstein, D., Salveter, S.C., Stein, J. and Warren, D.S. [1982] “Toward logical data independence. A relational query language without relations”, Proceedings ACM SIGMOD International Conference on Management of Data ,Orlando, Florida (June 1982) 51–60.
Maier, D., Rozenshtein, D. and Warren, D. S. [1983] “Windows on the world”, Proceedings Annual Meeting of SIGMOD, SIGMOD Record 13(4) (May 1983) 68–78.
Maier, D. and Ullman, J. D. [1982] “Connections in acyclic hypergraphs”, Proceedings First SIGACT-SIGMOD Symposium on Principles of Database Systems ,Los Angeles, California (March 1982) 34–39.
Osborn, S. L. [1979] “Towards a universal relation interface”, Proceedings 5th Conference on Very Large Data Bases ,Rio de Janeiro, Brazil (October 1979) 52–60.
Paredaens, J. and Van Gucht, D. [1983] “An application of the theory of graphs and hypergraphs to the decomposition of relational database schemes”, Proceedings 8th Colloquium on Trees in Algebra and Programming ,L’Aquila, Italy (March 1983), to appear in Lecture Notesin Computer Science, Springer Verlag.
Ullman, J. D. [1-982] Principles of Database Systems ,Second Edition, Computer Science Press, Potomac, Maryland (1982).
Ullman, J. D. [1983] “Universal relation interfaces for database systems”, unpublished manuscript, Dept. of Computer Science, Stanford University, Stanford, California (1983).
Yannakakis, M. [1981] “Algorithms for acylic database schemes”, Proceedings 7th Conference on Very Large Data Bases ,Cannes, France (September 1981) 82–94.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Plenum Press, New York
About this chapter
Cite this chapter
Ausiello, G., D’Atri, A., Moscarini, M. (1984). Minimal Coverings of Acyclic Database Schemata. In: Gallaire, H., Minker, J., Nicolas, J.M. (eds) Advances in Data Base Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-9385-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-9385-0_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4615-9387-4
Online ISBN: 978-1-4615-9385-0
eBook Packages: Springer Book Archive