Skip to main content

Characterizations of Multivalued Dependencies and Related Expressions

  • Conference paper
Discovery Science (DS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3245))

Included in the following conference series:

Abstract

We study multivalued dependencies, as well as the propositional formulas whose deduction calculus parallels that of multivalued dependencies, and the variant known as degenerated multivalued dependencies. For each of these sorts of expressions, we provide intrinsic characterizations in purely semantic terms. They naturally generalize similar properties of functional dependencies or Horn clauses.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, I.: Fast Discovery of Association Rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI Press, Menlo Park (1996)

    Google Scholar 

  2. Balcázar, J.L., Baixeries, J.: Using Concept Lattices to Model Multivalued Dependencies. Submitted, http://www.lsi.upc.es/~jbaixer/recerca/index_recerca.html

  3. Baixeries, J.: A Formal Concept Analysis Framework to Model Functional Dependencies. Mathematical Methods for Learning (2004)

    Google Scholar 

  4. Balcázar, J.L., Baixeries, J.: Discrete Deterministic Data Mining as Knowledge Compilation. In: Workshop on Discrete Mathematics and Data Mining in SIAM International Conference on Data Mining (2003)

    Google Scholar 

  5. Castellanos, M., Saltor, F.: Extraction of Data Dependencies. In: Information Modelling and Knowledge Bases V, pp. 400–420. IOS Press, Amsterdam (1994)

    Google Scholar 

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

    Article  Google Scholar 

  7. Fagin, R., Beeri, C., Howard, J.H.: A complete axiomatization for functional and multivalued dependencies in database relations. In: Smith, D.C.P. (ed.) Jr. Proc. 1977 ACM SIGMOD Symposium, Toronto, pp. 47–61 (1977)

    Google Scholar 

  8. Fagin, R., Vardi, Y.V.: The theory of data dependencies: a survey. Mathematics of Information Processing. In: Proceedings of Symposia in Applied Mathematics, vol. 34, pp. 19–72. AMS (1986)

    Google Scholar 

  9. Flach, P., Savnik, I.: Database dependency discovery: a machine learning approach. AI Communications 12(3), 139–160 (1999)

    MathSciNet  Google Scholar 

  10. Flach, P., Savnik, I.: Discovery of multivalued dependencies from relations. Intelligent Data Analysis 4(3,4), 195–211 (2000)

    MATH  Google Scholar 

  11. Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  12. Huhtala, Y., Kärkkäinen, J., Porkka, P., Toivonen, H.: TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. The Computer Journal 42(2), 100–111 (1999)

    Article  MATH  Google Scholar 

  13. Khardon, R., Roth, D.: Reasoning with Models Artificial Intelligence 87, November 1996, pp. 187–213 (1996)

    Google Scholar 

  14. Kivinen, J., Mannila, H.: Approximate inference of functional dependencies from relations. Theoretical Computer Science 149(1), 129–149 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  15. Pfaltz, J.L., Taylor, C.M.: Scientific Discovery through Iterative Transformations of Concept Lattices. In: Workshop on Discrete Mathematics and Data Mining at 2nd SIAM Conference on Data Mining, Arlington, April 2002, pp. 65–74 (2002)

    Google Scholar 

  16. Sagiv, Y., Delobel, D., Scott Parker, D., Fagin, R.: An equivalence between relational database dependencies and a fragment of propositional logic. Jr. J. ACM 28(3), 435–453 (1981); Corrigendum: J. ACM 34(4), 1016–1018 (1987)

    Article  MATH  Google Scholar 

  17. Savnik, I., Flach, P.: Bottom-up Induction of Functional Dependencies from Relations. In: Proc. of AAAI 1993 Workshop: Knowledge Discovery in Databases (1993)

    Google Scholar 

  18. Selman, B., Kautz, H.: Knowledge compilation and theory approximation. Journal of the ACM 43(2), 193–224 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  19. Ullman, J.D.: Principles of Database and Knowledge-Base Systems. Computer Science Press, Inc. (1988)

    Google Scholar 

  20. Zaniolo, C., Melkanoff, M.A.: On the Design of Relational Database Schemata. ACM TODS 6(1), 1–47 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Balcázar, J.L., Baixeries, J. (2004). Characterizations of Multivalued Dependencies and Related Expressions. In: Suzuki, E., Arikawa, S. (eds) Discovery Science. DS 2004. Lecture Notes in Computer Science(), vol 3245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30214-8_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30214-8_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23357-2

  • Online ISBN: 978-3-540-30214-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics