Skip to main content
Springer Nature Link
Log in

Learning an Extension of the Class of Functional Dependencies with Queries

  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

Data dependencies are a useful tool to design relational databases. In particular, functional and multivalued dependencies are used to obtain relation schemes that satisfy the 4th normal form, a property that is considered good enough for most applications. It is known that the class of sets of functional dependencies is learnable in the exact model of learning with queries. Also a subclass of multivalued dependencies, the class of consequent-restricted multivalued dependencies has been shown to be learnable in this model. Here, we present an algorithm that learns a generalization of both classes. We also show an algorithm that learns a non-trivial subclass of 2-quasi Horn formulas, closely related to the classes mentioned above.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Angluin, D., “Learning k-term DNF using queries and counterexamples,” TR-YALEU/DCS/RR-559, Yale University, August 1987.

  2. Angluin D.: “Queries and Concept Learning”. Machine Learning 2(4), 319–342 (1988)

    Google Scholar 

  3. Angluin D.: “Negative Results for Equivalence Queries”. Machine Learning 5, 121–150 (1990)

    Google Scholar 

  4. Angluin D., Frazier M., Pitt L.: “Learning Conjunctions of Horn Clauses”. Machine Learning 9, 147–164 (1992)

    Google Scholar 

  5. Balcázar, J. L. and Baixeries, J., “Characterizations of Multivalued Dependencies and Related Expressions,” Proc. DS 2004, LNAI, 3245, Springer, Berlin, pp. 306–313, 2004.

  6. Bernstein P.A.: “Synthesizing Third Normal Form Relations from Functional Dependencies”. ACM Trans. on Database Systems 1(4), 277–298 (1976)

    Article  Google Scholar 

  7. Codd E.F.: “A Relational Model for Large Shared Data Banks”. Comm. of the ACM 13(6), 377–387 (1970)

    Article  MATH  Google Scholar 

  8. Delobel C.: “Normalization and Hierarchical Dependencies in the Relational Model”. ACM Trans. on Database Systems 3(3), 201–222 (1978)

    Article  Google Scholar 

  9. Elmasri R., Navathe S.B.: Fundamentals of Database Systems. Benjamin-Cummings Pub., Redwood City, California (1994)

    MATH  Google Scholar 

  10. Fagin R.: “Multivalued Dependencies and a new Normal Form for Relational Databases”. ACM Trans. on Database Systems 2(3), 262–278 (1977)

    Article  MathSciNet  Google Scholar 

  11. Hermo, M. and Lavín, V., “Learning Minimal Covers of Functional Dependencies with Queries,” Proc. ALT 1999, LNCS, 1720, Springer, Berlin, pp. 291–300, 2008.

  12. Hermo, M. and Lavín, V., “Negative Results on Learning Multivalued Dependencies with Queries,” 7th Symposium on Artificial Intelligence and Mathematics, 2002.

  13. Khardon R., Mannila H., Roth D.: “Reasoning with Examples: Propositional Formulae and Database Dependencies”. Acta Informatica 36, 267–286 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kivinen J., Mannila H.: “Approximate Inference of Functional Dependencies from Relations”. Theoretical Computer Science 149, 129–149 (1995)

    Article  MathSciNet  Google Scholar 

  15. Lavín Puente V.: “On Learning Multivalued Dependencies with Queries”. Theoretical Computer Science 412(22), 2331–2339 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  16. Mahadevan S., Tadepalli P.: “Quantifying Prior Determination Knowledge using PAC Learning Model”. Machine Learning 17(1), 69–105 (1994)

    Google Scholar 

  17. Pillaipakkamnatt K., Raghavan V.: “Read twice DNF formulas are properly learnable”. Information and Computation 122, 236–267 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  18. Sagiv Y., Delobel C., Stott Parker D., Fagin R.: “An Equivalence between Relational Database Dependencies and a Fragment of Propositional Logic”. Journal of the Association for Computing Machinery 28(3), 435–453 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  19. Tadepalli P., Russel S.: “Learning from Examples and Membership Queries with Structured Determinations”. Machine Learning 32, 245–295 (1998)

    Article  MATH  Google Scholar 

  20. Tsou D. M., Fisher P. C.: “Decomposition of a Relation Scheme into Boyce-Codd Normal Form”. SIGACT News 14(3), 23–29 (1982)

    Article  Google Scholar 

  21. Ullman, J. D., “Principles of Database and Knowledge-Base Systems,” Computer Science Press, Inc., 1988.

  22. Zaniolo, D. C., “Analysis and Design of Relational Schemata for Database Systems,” Doctoral Dissertation, UCLA, July 1976.

Download references

Author information

Authors and Affiliations

  1. Dpto. Sistemas Informáticos y Computación, Universidad Complutense, E-28040, Madrid, Spain

    Víctor Lavín Puente

Authors
  1. Víctor Lavín Puente
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Víctor Lavín Puente.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Puente, V.L. Learning an Extension of the Class of Functional Dependencies with Queries. New Gener. Comput. 33, 319–340 (2015). https://doi.org/10.1007/s00354-015-0301-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00354-015-0301-8

Keywords