Efficient discovery of functional and approximate dependencies using partitions
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 392-401
- https://doi.org/10.1109/icde.1998.655802
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A feasibility and performance study of dependency inference (database design)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Towards the reverse engineering of renormalized relational databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Levelwise Search and Borders of Theories in Knowledge DiscoveryData Mining and Knowledge Discovery, 1997
- Approximate inference of functional dependencies from relationsTheoretical Computer Science, 1995
- Algorithms for inferring functional dependencies from relationsData & Knowledge Engineering, 1994
- Efficiently Inducing Determinations: A Complete and Systematic Search Algorithm that Uses Optimal PruningPublished by Elsevier ,1993
- On the complexity of inferring functional dependenciesDiscrete Applied Mathematics, 1992
- Reasoning about functional dependencies generalized for semantic data modelsACM Transactions on Database Systems, 1992
- Design by example: An application of Armstrong relationsJournal of Computer and System Sciences, 1986