Learning Minimal Covers of Functional Dependencies with Queries
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.
Cite
Text
Hermo and Lavín. "Learning Minimal Covers of Functional Dependencies with Queries." International Conference on Algorithmic Learning Theory, 1999. doi:10.1007/3-540-46769-6_24Markdown
[Hermo and Lavín. "Learning Minimal Covers of Functional Dependencies with Queries." International Conference on Algorithmic Learning Theory, 1999.](https://mlanthology.org/alt/1999/hermo1999alt-learning/) doi:10.1007/3-540-46769-6_24BibTeX
@inproceedings{hermo1999alt-learning,
title = {{Learning Minimal Covers of Functional Dependencies with Queries}},
author = {Hermo, Montserrat and Lavín, Víctor},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {1999},
pages = {291-300},
doi = {10.1007/3-540-46769-6_24},
url = {https://mlanthology.org/alt/1999/hermo1999alt-learning/}
}