Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies

DOI10.1093/comjnl/42.2.100zbMath0944.68054MaRDI QIDQ4269815

Juha Kärkkäinen, Pasi Porkka, Ykä Huhtala, Hannu T. T. Toivonen

Publication date: 4 May 2000

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/547fc697865c564539bce9959bb4bf691ebd92e0

zbMATH Keywords

database analysis; TANE

Mathematics Subject Classification ID

68P15: Database theory

Related Items

Functional and approximate dependency mining: database and FCA points of view, Discovering and Exploiting Statistical Properties for Query Optimization in Relational Databases: A Survey, Checking Sets of Pure Evolving Association Rules, Analysis of fuzzy -ary relations with the use of interval-valued fuzzy functional dependencies, Using Transversals for Discovering XML Functional Dependencies, TANE, Improved time complexities for learning Boolean networks, Mining approximate interval-based temporal dependencies, RQL: a query language for rule discovery in databases, Reformulating table constraints using functional dependencies-an application to explanation generation, Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions, Characterizing approximate-matching dependencies in formal concept analysis with pattern structures, A note on approximation measures for multi-valued dependencies in relational databases, Reducing one class of machine learning algorithms to logical operations of plausible reasoning, Approximate keys and functional dependencies in incomplete databases with limited domains, Mining relaxed functional dependencies from data, Characterizing functional dependencies in formal concept analysis with pattern structures, Functional dependencies are helpful for partial materialization of data cubes, Erratum to ``Reformulating table constraints using functional dependencies---an application to explanation generation, Link key candidate extraction with relational concept analysis, Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints