Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Levene, G. Loizou (1999)
A guided tour of relational databases and beyond
S. Abiteboul, R. Hull, V. Vianu (1994)
Foundations of Databases
F. Marchi, Jean-Marc Petit (2003)
Zigzag: a new algorithm for mining large inclusion dependencies in databasesThird IEEE International Conference on Data Mining
P. Perner (2002)
Data Mining - Concepts and TechniquesKünstliche Intell., 16
Meike Klettke, E. Buchholz, Antje Raab-Düsterhöft, B. Thalheim (1995)
An Informal and Efficient Approach for Obtaining Semantic Constraints Using Sample Data and Natural Language Processing
H. Mannila, Kari-Jouko Räihä (1992)
Design of Relational Databases
Ykä Huhtala, Juha Kärkkäinen, P. Porkka, Hannu Toivonen (1999)
TANE: An Efficient Algorithm for Discovering Functional and Approximate DependenciesComput. J., 42
F. Marchi, Stéphane Lopes, Jean-Marc Petit, F. Toumani (2003)
Analysis of existing databases at the logical level: the DBA companion projectSIGMOD Rec., 32
R. Agrawal, R. Srikant (1994)
Fast Algorithms for Mining Association Rules in Large Databases
J. Gryz (1998)
International conference on data engineering (ICDE’98)
M. Casanova, Luiz Tucherman, A. Furtado (1988)
Enforcing Inclusion Dependencies and Referencial Integrity
Renée Miller, Mauricio Hernández, L. Haas, Lingling Yan, C. Ho, Ronald Fagin, Lucian Popa (2001)
The Clio project: managing heterogeneitySIGMOD Rec., 30
H. Mannila, Kari-Jouko Räihä (1986)
Inclusion dependencies in database design1986 IEEE Second International Conference on Data Engineering
T. Calders, J. Wijsen (2001)
On Monotone Data Mining Languages
C. Wyss, C. Giannella, E. Robertson (2001)
FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances - Extended Abstract
Stéphane Lopes, Jean-Marc Petit, L. Lakhal (2002)
Functional and approximate dependencies mining: databases and FCA point of viewJournal of Experimental and Theoretical Artificial Intelligence
T. Dasu, T. Johnson, S. Muthukrishnan, Vladislav Shkapenyuk (2002)
Mining database structure; or, how to build a data quality browser
Stéphane Lopes, Jean-Marc Petit, F. Toumani (2002)
Discovering interesting inclusion dependencies: application to logical database tuningInf. Syst., 27
Noël Novelli, R. Cicchetti (2001)
Functional and embedded dependency inference: a data mining point of viewInf. Syst., 26
R. Wille (1999)
Formal Concept Analysis: Tutorial on formal concept analysisElectron. Notes Discret. Math., 2
M. Casanova, Ronald Fagin, C. Papadimitriou (1982)
Inclusion dependencies and their interaction with functional dependenciesProceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
F. Marchi, S. Lopes, J.-M. Petit, F. Toumani (2003)
Analysis of existing databases at the logical level: The DBA companion projectACM Sigmod Record, 32
Jarek Gryz (1998)
Query folding with inclusion dependenciesProceedings 14th International Conference on Data Engineering
F. Marchi, Jean-Marc Petit (2005)
Approximating a Set of Approximate Inclusion Dependencies
A. Koeller, Elke Rundensteiner (2003)
Discovery of high-dimensional inclusion dependenciesProceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)
Jana Bauckmann, U. Leser, Felix Naumann, Veronique Tietz (2007)
Efficiently Detecting Inclusion Dependencies2007 IEEE 23rd International Conference on Data Engineering
Stéphane Lopes, F. Marchi, Jean-Marc Petit (2004)
DBA companion: a tool for logical database tuningProceedings. 20th International Conference on Data Engineering
M. Levene, M. Vincent (2000)
Justification for Inclusion Dependency Normal FormIEEE Trans. Knowl. Data Eng., 12
F. Marchi, Stéphane Lopes, Jean-Marc Petit (2002)
Efficient Algorithms for Mining Inclusion Dependencies
F. Marchi, J.-M. Petit (2005)
International conference on intelligent information system (IIS’05)
R. J. Miller, M. A. Hernandez, L. M. Haas, L. Yan, C. T. H. Ho, R. Fagin (2001)
The clio project: Managing heterogeneityACM SIGMOD Record, 30
Siegfried Bell, Peter Brockhausen (1995)
Discovery of Constraints and Data Dependencies in Databases (Extended Abstract)
John Mitchell (1984)
The Implication Problem for Functional and Inclusion DependenciesInf. Control., 56
Ojelanki Ngwenyama, Kweku-Muata Osei-Bryson (1992)
A formal method for analyzing and integrating the rule-sets of multiple expertsInf. Syst., 17
R. Agrawal, R. Srikant (1994)
International conference on very large data bases (VLDB’94)
H. Mannila, Hannu Toivonen (1997)
Levelwise Search and Borders of Theories in Knowledge DiscoveryData Mining and Knowledge Discovery, 1
F. Afrati, A. Gionis, H. Mannila (2004)
Approximating a collection of frequent setsProceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
DatabaseQi Cheng, Jarek Gryz, Fred Koo, Cli Leung, Linqi Liu, Xiaoyan Qian, B. Schiefer (1999)
Implementation of Two Semantic Query Optimization Techniques in DB2 Universal Database
Jyrki Kivinen, H. Mannila (1995)
Approximate Inference of Functional Dependencies from RelationsTheor. Comput. Sci., 149
F. N. Afrati, A. Gionis, H. Mannila (2004)
International conference on knowledge discovery and data mining (KDD’04)
F. Marchi, J.-M. Petit (2003)
International conference on data mining (ICDM’03)
(1999)
The UCI KDD Archive [httpXGGkddFisFuiFedu'
M. Kantola, H. Mannila, Kari-Jouko Räihä, H. Siirtola (1992)
Discovering functional and inclusion dependencies in relational databasesInternational Journal of Intelligent Systems, 7
T. Calders, J. Wijsen (2001)
International workshop on database programming languages (DBPL’01)
S. Lopes, J.-M. Petit, L. Lakhal (2002)
Functional and approximate dependencies mining: Databases and FCA point of viewSpecial issue of JETAI, 14
Sunita Sarawagi, Shiby Thomas, R. Agrawal (1998)
Integrating Association Rule Mining with Relational Database Systems: Alternatives and ImplicationsData Mining and Knowledge Discovery, 4
M. Casanova, R. Fagin, C. Papadimitriou (1984)
Inclusion dependencies and their interaction with functional dependenciesJournal of Computer and System Sciences, 24
U. Fayyad (1996)
Data Mining and Knowledge Discovery: Making Sense Out of DataIEEE Expert, 11
Foreign keys form one of the most fundamental constraints for relational databases. Since they are not always defined in existing databases, the discovery of foreign keys turns out to be an important and challenging task. The underlying problem is known to be the inclusion dependency (IND) inference problem. In this paper, data-mining algorithms are devised for IND inference in a given database. We propose a two-step approach. In the first step, unary INDs are discovered thanks to a new preprocessing stage which leads to a new algorithm and to an efficient implementation. In the second step, n-ary IND inference is achieved. This step fits in the framework of levelwise algorithms used in many data-mining algorithms. Since real-world databases can suffer from some data inconsistencies, approximate INDs, i.e. INDs which almost hold, are considered. We show how they can be safely integrated into our unary and n-ary discovery algorithms. An implementation of these algorithms has been achieved and tested against both synthetic and real-life databases. Up to our knowledge, no other algorithm does exist to solve this data-mining problem.
Journal of Intelligent Information Systems – Springer Journals
Published: Jan 26, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.