On generating near-optimal tableaux for conditional functional dependencies
- 1 August 2008
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 1 (1), 376-390
- https://doi.org/10.14778/1453856.1453900
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Efficient and effective explanation of change in hierarchical summariesPublished by Association for Computing Machinery (ACM) ,2007
- Mining constraint violationsACM Transactions on Database Systems, 2007
- Approximation algorithms for partial covering problemsJournal of Algorithms, 2004
- On approximation measures for functional dependenciesInformation Systems, 2004
- Discovery of functional and approximate functional dependencies in relational databasesJournal of Applied Mathematics and Decision Sciences, 2003
- Searching for dependencies at multiple abstraction levelsACM Transactions on Database Systems, 2002
- Tane: An Efficient Algorithm for Discovering Functional and Approximate DependenciesThe Computer Journal, 1999
- Mining quantitative association rules in large relational tablesACM SIGMOD Record, 1996
- Approximate inference of functional dependencies from relationsTheoretical Computer Science, 1995
- Mining association rules between sets of items in large databasesACM SIGMOD Record, 1993