Skip to main content
SpringerLink
Log in

Learning Minimal Covers of Functional Dependencies with Queries

  • Conference paper
  • First Online:
Algorithmic Learning Theory (ALT 1999)

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

Included in the following conference series:

Abstract

Functional dependencies play an important role in the design of databases. We study the learnability of the class of minimal covers of functional dependencies (MCFD) within the exact learning model via queries. We prove that neither equivalence queries alone nor membership queries alone suffice to learn the class. In contrast, we show that learning becomes feasible if both types of queries are allowed. We also give some properties concerning minimal covers.

Partially supported by the Spanish DGICYT through project PB95-0787 (KOALA).

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

Access this chapter

Log in via an institution
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. D. Angluin. “Learning Regular Sets from Queries and Counterexamples”. Information and Computation, 75, 87–106, 1987.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

  5. R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Benjamin-Cummings Pub. Redwood City, California, 1994.

    MATH  Google Scholar 

  6. J. Castro, D. Guijarro and V. Lavín. “Learning Nearly Monotone k-term DNF”. Information Processing Letters, 67(2), 75–79, 1998.

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. D. Guijarro, V. Lavín and V. Raghavan. “Learning Monotone Term Decision Lists”. To appear in Theoretical Computer Science. Proceedings of EUROCOLT’97, 16–26, 1997.

    Google Scholar 

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

    Google Scholar 

  10. P. Tadepalli and S. Russell. “Learning from Examples and Membership Queries with Structured Determinations”. Machine Learning, 32, 245–295, 1998.

    Article  MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. Lenguajes y Sistemas Informáticos, UPV/EHU, P.O. Box 649, E-20080, San Sebastián, Spain

    Montserrat Hermo

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

    Víctor Lavín

Authors
  1. Montserrat Hermo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Víctor Lavín
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, 152-8552, Japan

    Osamu Watanabe

  2. Waseda University, 1-6-1 Nishiwaseda, Shinjuku-ku, Tokyo, 169-8050, Japan

    Takashi Yokomori

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hermo, M., Lavín, V. (1999). Learning Minimal Covers of Functional Dependencies with Queries. In: Watanabe, O., Yokomori, T. (eds) Algorithmic Learning Theory. ALT 1999. Lecture Notes in Computer Science(), vol 1720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46769-6_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-46769-6_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66748-3

  • Online ISBN: 978-3-540-46769-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation