Name
Abstract | ||
|---|---|---|
Discovering functional dependencies from existing databases is an important technique strongly required in database design and administration tools. Investigated for long years, such an issue has been recently addressed with a data mining viewpoint, in a novel and more efficient way by following from principles of level-wise algorithms. In this paper, we propose a new characterization of minimal functional dependencies which provides a formal framework simpler than previous proposals. The algorithm, defined for enforcing our approach has been implemented and experimented. It is more efficient (in whatever configuration of original data) than the best operational solution (according to our knowledge): the algorithm Tane. Moreover, our approach also performs (without additional execution time) the mining of embedded functional dependencies, i.e. dependencies holding for a subset of the attribute set initially considered (e.g. for materialized views widely used in particular for managing data warehouses). |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-44503-X_13 | ICDT |
Keywords | Field | DocType |
original data,data mining viewpoint,efficient algorithm,functional dependency,data warehouse,level-wise algorithm,minimal functional dependency,mining functional,administration tool,additional execution time,algorithm tane,embedded functional dependency,materialized views,database design,data mining | Data warehouse,Data mining,Relational database,Computer science,Algorithm,Functional dependency,Theoretical computer science,Database design,Execution time,Materialized view,Dependency theory (database theory) | Conference |
Volume | ISSN | ISBN |
1973 | 0302-9743 | 3-540-41456-8 |
Citations | PageRank | References |
68 | 29.74 | 30 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Noel Novelli | 1 | 127 | 37.10 |
| Rosine Cicchetti | 2 | 453 | 175.14 |