Functional and embedded dependency inference: a data mining point of view

Novelli, Noël; Cicchetti, Rosine

doi:10.1016/s0306-4379(01)00032-1

Cited by 33 publications

(22 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The discovery of functional dependencies is a well known task in database design and tuning (Beeri et al, 1984;Lopes et al, 2002;Novelli and Cicchetti, 2001). All the approaches tackling this issue mine a canonical cover which encompasses all the minimal functional dependencies.…”

Section: Functional Dependenciesmentioning

confidence: 99%

“…The former has been successfully used when addressing various issues in database, data mining and data warehousing. For instance, different approaches have been defined to extract frequent closed item-sets (Pasquier et al, 1999;Stumme et al, 2002) and association rules, represent such rules in a compact way through basis or covers (Zaki, 2000;Bastide et al, 2000;Pasquier et al, 2005), discover functional and conditional dependencies (Lopes et al, 2000;Novelli and Cicchetti, 2001;Diallo et al, 2011;Medina and Nourine, 2010), reduce the size of data cubes by representing them through constrained closed or quotient cubes (Nedjar et al, 2010b(Nedjar et al, , 2010c. The former two quoted approaches mine new knowledge from transaction databases or formal contexts.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The Agree Concept Lattice for Multidimensional Database Analysis

Nedjar

Pesci

Lakhal

et al. 2011

Formal Concept Analysis

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper we propose the characterization of two new structures, the Agree Concept Lattice and the Quotient Agree Lattice of a database relation. Both of them are of great interest for multidimensional database analysis. They provide a formal framework which makes it possible to improve computation time, reduce representation and easily navigate through the Hasse diagram. These structures are generic, apply to various database analysis problems and combine formal concept analysis and database theory. They make use of the concepts of agree set and database partition. Agree set and partition are associated to define the Agree Concept of a database relation. The set of all the Agree Concepts is organized within the Agree Concept Lattice. The Quotient Agree Lattice is along the lines of both the Titanic framework and the quotient cube.We also briefly present three application fields of the proposed structures. The first two ones are classical since they concern on the one hand the discovery of functional and approximate dependencies for database design and tuning and on the other hand the data cube computation and representation. The latter field has been recently investigated. The underlying issue is to retrieve the most relevant objects according to the user expectations: the Skyline. The multidimensional generalization of the Skyline has been proposed through the Skycube. The proposed structures smartly solve the problem of partial materialization of Skycube with reconstruction guarantee.

show abstract

Section: Functional Dependenciesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

The Agree Concept Lattice for Multidimensional Database Analysis

Nedjar

Pesci

Lakhal

et al. 2011

Formal Concept Analysis

Self Cite

View full text Add to dashboard Cite

show abstract

“…It consists in analyzing sample data to check whether or not a definite property holds. Such techniques are very efficient for finding functional dependencies, uniqueness and referential constraints and to discover the value set of enumerated domains [Novelli and Cicchetti 2001].…”

Section: Logical Extractionmentioning

confidence: 99%

Wrapper-based evolution of legacy information systems

Thiran

Hainaut

Houben

et al. 2006

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

System evolution most often implies the integration of legacy components, such as databases, with newly developed ones, leading to mixed architectures that suffer from severe heterogeneity problems. For instance, incorporating a new program in a legacy database application can create an integrity mismatch, since the database model and the program data view can be quite different (e.g. standard file model versus OO model). In addition, neither the legacy DBMS (too weak to address integrity issues correctly) nor the new program (that relies on data server responsibility) correctly cope with data integrity management. The component that can reconciliate these mismatched subsystems is the R/W wrapper, which allows any client program to read, but also to update the legacy data, while controlling the integrity constraints that are ignored by the legacy DBMS.This article describes a generic, technology-independent, R/W wrapper architecture, a methodology for specifying them in a disciplined way, and a CASE tool for generating most of the corresponding code.The key concept is that of implicit construct, which is a structure or a constraint that has not been declared in the database, but which is controlled by the legacy application code. The implicit constructs are elicited through reverse engineering techniques, and then translated into validation code in the wrapper. For instance, a wrapper can be generated for a collection of COBOL files in order to allow external programs to access them through a relational, object-oriented or XML interface, while offering referential integrity control. The methodology is based on a transformational approach that provides a formal way to build the wrapper schema and to specify inter-schema mappings.

show abstract

“…In the last 11 years there has been growing interest in the problem of discovering FDs that hold in a given relational table, T [3][4][5][6][7][8][9]. FDs represent potentially novel and interesting patterns existent in T: Their discovery provides valuable knowledge of the ''structure'' of T: Unlike FD researchers in the 1970s, we are interested in FDs that hold in a given instance of the schema rather than FDs that are pre-defined to hold in any instance of the schema.…”

Section: Article In Pressmentioning

confidence: 99%