Result: Learning minimal covers of functional dependencies with queries

Title:
Learning minimal covers of functional dependencies with queries
Authors:
Source:
ALT'99 : algorithmic learning theory (Tokyo, 6-8 December 1999)Lecture notes in computer science. :291-300
Publisher Information:
Berlin: Springer, 1999.
Publication Year:
1999
Physical Description:
print, 11 ref
Original Material:
INIST-CNRS
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dpto. Lenguajes y Sistemas Informáticos, UPV/EHU, P.O. Box 649, 20080 San Sebastián, Spain
Dpto. Sistemas Informáticos y Programación, Universidad Complutense, 28040 Madrid, Spain
ISSN:
0302-9743
Rights:
Copyright 2000 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.1172335
Database:
PASCAL Archive

Further Information

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.