Efficient algorithms for mining inclusion dependencies

DOI10.1007/3-540-45876-X_30MaRDI QIDQ3044414zbMATH OpenFDO

Authors Fabien de Marchi, Stéphane Lopes, Jean-Marc Petit

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2287/22870464.htm

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• Journal on Data Semantics V
• Discovering functional and inclusion dependencies in relational databases
• Discovering interesting inclusion dependencies: Application to logical database tuning
• FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances. extended abstract
• Functional and embedded dependency inference: A data mining point of view

Cited in

(5)

• Discovering interesting inclusion dependencies: Application to logical database tuning
• Discovering functional and inclusion dependencies in relational databases
• Constraint-Based Mining and Inductive Databases
• Journal on Data Semantics V
• Minimal coverage of generalized typed inclusion dependencies in databases

Describes a project that uses

Uses Software

• TANE
• FastFDs

This page was built for publication: Efficient algorithms for mining inclusion dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044414)