Skip to main content
Log in

Learning Sets of Antecedent-restricted Functional and Multivalued Dependencies with Queries

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

Identifying dependencies that hold in relational databases is essential to produce good databases designs. In particular, functional and multivalued dependencies are used to obtain relation schemes that satisfy the 4th normal form, a property that is considered satisfactory 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. In this paper, we present an algorithm that learns a class that contains sets of both functional and multivalued dependencies under some restrictions imposed on the antecedents of dependencies. We also show, as a by-product, an algorithm that learns a non-trivial subclass of 2-quasi Horn formulas, closely related to the class just mentioned.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Angluin, D.: Learning k-term DNF Using Queries and Counterexamples. TR-YALEU/DCS/RR-559 (1987)

  2. Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319–342 (1988)

    Google Scholar 

  3. Angluin, D.: Negative results for equivalence queries. Mach. Learn. 5, 121–150 (1990)

    Google Scholar 

  4. Angluin, D., Frazier, M., Pitt, L.: Learning conjunctions of horn clauses. Mach. Learn. 9, 147–164 (1992)

    MATH  Google Scholar 

  5. Balcázar, J.L., Baixeries, J.: Characterizations of multivalued dependencies and related expressions. In: Proceedings DS 2004, LNAI, vol. 3245, pp 306–313. Springer, Berlin (2004)

  6. Bernstein, P.A.: Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. 1(4), 277–298 (1976)

    Article  Google Scholar 

  7. Codd, E.F.: A relational model for large shared data banks. Comm. ACM 13(6), 377–387 (1970)

    Article  MATH  Google Scholar 

  8. Delobel, C.: Normalization and hierarchical dependencies in the relational model. ACM Trans. Database Syst. 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. Database Syst. 2(3), 262–278 (1977)

    Article  MathSciNet  Google Scholar 

  11. Hermo, M., Lavín, V.: Learning minimal covers of functional dependencies with queries. In: Proceedings ALT 1999, LNCS, vol. 1720, pp 291–300. Springer, Berlin (1999)

  12. Khardon, R., Mannila, H., Roth, D.: Reasoning with examples: propositional formulae and database dependencies. Acta Inf. 36, 267–286 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kivinen, J., Mannila, H.: Approximate inference of functional dependencies from relations. Theor. Comput. Sci. 149, 129–149 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lavín Puente, V.: On learning multivalued dependencies with queries. Theor. Comput. Sci. 412(22), 2331–2339 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lavín Puente, V.: Learning a subclass of k-quasi-horn formulas with membership queries. Inf. Process. Lett. 111(11), 550–555 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lavín Puente, V., Hermo, M.: Negative results on learning multivalued dependencies with queries. Inf. Process. Lett. 111(19), 968–972 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  17. Lavín Puente, V.: Learning an extension of the class of functional dependencies with queries. N. Gener. Comput. 33(3), 319–340 (2015)

  18. Mahadevan, S., Tadepalli, P.: Quantifying prior determination knowledge using pac learning model. Mach. Learn. 17(1), 69–105 (1994)

    Google Scholar 

  19. Pillaipakkamnatt, K., Raghavan, V.: Read twice DNF formulas are properly learnable. Inf. Comput. 122, 236–267 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  20. Sagiv, Y., Delobel, C., Stott Parker, D., Fagin, R.: An equivalence between relational database dependencies and a fragment of propositional logic. J. Assoc. Comput. Mach. 28(3), 435–453 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  21. Tadepalli, P., Russel, S.: Learning from examples and membership queries with structured determinations. Mach. Learn. 32, 245–295 (1998)

    Article  MATH  Google Scholar 

  22. 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 

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

  24. Zaniolo, D.C.: Analysis and design of relational schemata for database systems. Doctoral Dissertation UCLA (1976)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Víctor Lavín Puente.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lavín Puente, V. Learning Sets of Antecedent-restricted Functional and Multivalued Dependencies with Queries. Theory Comput Syst 59, 500–516 (2016). https://doi.org/10.1007/s00224-015-9659-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-015-9659-8

Keywords

Navigation