On approximation measures for functional dependencies
- 30 September 2004
- journal article
- Published by Elsevier BV in Information Systems
- Vol. 29 (6), 483-507
- https://doi.org/10.1016/j.is.2003.10.006
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Relational decomposition through partial functional dependenciesData & Knowledge Engineering, 2002
- A framework for understanding existing databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Improving Query Evaluation with Approximate Functional Dependency Based DecompositionsLecture Notes in Computer Science, 2002
- Functional and embedded dependency inference: a data mining point of viewInformation Systems, 2001
- FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances Extended AbstractLecture Notes in Computer Science, 2001
- Efficient Discovery of Functional Dependencies and Armstrong RelationsLecture Notes in Computer Science, 2000
- Tane: An Efficient Algorithm for Discovering Functional and Approximate DependenciesThe Computer Journal, 1999
- Approximate inference of functional dependencies from relationsTheoretical Computer Science, 1995
- Discovering functional and inclusion dependencies in relational databasesInternational Journal of Intelligent Systems, 1992
- An Information-Theoretic Analysis of Relational Databases—Part I: Data Dependencies and Information MetricIEEE Transactions on Software Engineering, 1987