Skip to main content
SpringerLink
Log in

A polynomial-time join dependency implication algorithm for unary multi-valued dependencies

  • Contributed Papers
  • Conference paper
  • First Online:
ICDT '86 (ICDT 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 243))

Included in the following conference series:

  • 128 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A. V., Beeri, C. and Ullman, J. D.: The theory of joins in relational databases. ACM Trans. Database Syst. 4, 297–314 (1979)

    Google Scholar 

  2. Aho, A. V., Hopcroft, J. E. and Ullman, J. D.: Data Structures and Algorithms. Addison-Wesley, Reading, Mass., 1983.

    Google Scholar 

  3. Aho, A. V., Sagiv, Y. and Ullman, J. D.: Equivalences among relational expressions. SIAM J. Comput. 8, 218–246 (1979)

    Google Scholar 

  4. Beeri, C. and Vardi, M. Y.:A proof procedure for data dependencies. J. Assoc. Comput. Mach. 31, 718–741 (1984)

    Google Scholar 

  5. Beeri, C. and Vardi, M. Y.: On the complexity of testing implications of data dependencies. Technical Report, Computer Science Dept., The Hebrew University of Jerusalem, 1980.

    Google Scholar 

  6. Fagin, R.:Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst. 2, 262–278 (1977)

    Google Scholar 

  7. Fischer, P. C. and Tsou, D-M.:Whether a set of multivalued dependencies implies a join dependency is NP-hard. SIAM J. Comput. 12, 259–266 (1983)

    Google Scholar 

  8. Galil, Z.:An almost linear-time algorithm for computing a dependency basis in a relational database. J. Assoc. Comput. Mach. 29, 96–102 (1982)

    Google Scholar 

  9. Kanellakis, P. C., Cosmadakis, S. S. and Vardi, M. Y.:Unary inclusion dependencies have polynomial time inference problems. In Proceedings 15th Annual ACM Symposium on Theory of Computing, pp. 264–277, Boston, 1983.

    Google Scholar 

  10. Maier, D.:The Theory of Relational Databases. Computer Science Press, Rockville, Maryland, 1983.

    Google Scholar 

  11. Maier, D., Mendelzon, A. O. and Sagiv, Y.:Testing implications of data dependencies. ACM Trans. Database Syst. 4, 455–469 (1979)

    Google Scholar 

  12. Maier, D., Ullman, J. D. and Vardi, M. Y.:On the foundations of the universal relation model. ACM Trans. Database Syst. 9, 283–308 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Heriot-Watt University, 79 Grassmarket, EH1 2HJ, Edinburgh, Scotland

    P. Thanisch

  2. Department of Computer Science, Birkbeck College, University of London, Malet Street, WC1E 7HX, London, England

    G. Loizou

Authors
  1. P. Thanisch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Loizou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Paolo Atzeni

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thanisch, P., Loizou, G. (1986). A polynomial-time join dependency implication algorithm for unary multi-valued dependencies. In: Ausiello, G., Atzeni, P. (eds) ICDT '86. ICDT 1986. Lecture Notes in Computer Science, vol 243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17187-8_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-17187-8_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17187-4

  • Online ISBN: 978-3-540-47346-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation