Efficient algorithms for mining inclusion dependencies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2287, Issue , 2002, Pages 464-476

  De Marchi, Fabien ^a   Lopes, Stéphane ^b   Petit, Jean Marc ^a  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING;

DATA MINING ALGORITHM; DATA MINING PROBLEMS; FUNDAMENTAL CONSTRAINTS; INCLUSION DEPENDENCIES; INFERENCE PROBLEM; LEVEL-WISE ALGORITHMS; RELATIONAL DATABASE; SYNTHETIC DATABASE;

ALGORITHMS;

EID: 84883798941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (23)

1. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. In Jorge B. Bocca, Matthias Jarke, and Carlo Zaniolo, editors, International Conference on Very Large Data Bases, Santiago de Chile, Chile, pages 487–499. Morgan Kaufmann, 1994.
2. S. Bell and P. Brockhausen. Discovery of constraints and data dependencies in databases (extended abstract). In Nada Lavrac and Stefan Wrobel, editors, European Conference on Machine Learning, Crete, Greece, pages 267–270, 1995.
3. G. Vossen C. Fahrner. A survey of database design transformations based on the entity-relationship model. Data and Knowledge Engineering, 15(3):213–250, 1995.
4. M. Casanova, R. Fagin, and C. Papadimitriou. Inclusion dependencies and their interaction with functional dependencies. Journal of Computer and System Sciences, 24(1):29–59, February 1984.
5. Qi Cheng, Jarek Gryz, Fred Koo, T. Y. Cliff Leung, Linqi Liu, Xiaoyan Qian, and Berni Schiefer. Implementation of two semantic query optimization techniques in DB2 universal database. In Malcolm P. Atkinson, Maria E. Orlowska, Patrick Valduriez, Stanley B. Zdonik, and Michael L. Brodie, editors, International Conference on Very Large Data Bases, Edinburgh, Scotland, UK, pages 687–698. Morgan Kaufmann, 1999.
6. C. J. Date. Referential integrity. In International Conference on Very Large Data Bases, Cannes, France, pages 2–12. IEEE Computer Society Press, 1981.
7. F. De Marchi, S. Lopes, and J-M. Petit. Informative armstrong relations: Application to database analysis. In Bases de Données Avancées, Agadir, Maroc, October 2001.
8. F. De Marchi, M. Rivon, S. Lopes, and J-M. Petit. Mind: Algorithme par niveaux de découverte des dépendances d’inclusion. In Inforsid 2001 (french information system conference), Martigny, Swiss, May 2001.
9. Jarek Gryz. Query folding with inclusion dependencies. In International Conference on Data Engineering, Orlando, Florida, USA, pages 126–133. IEEE Computer Society, 1998.
10. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, August 2000.
11. Y. Huhtala, J. Karkkainen, P. Porkka, and H. Toivonen. TANE: An efficient algorithmfor discovering functional and approximate dependencies. The Computer Journal, 42(2):100–111, 1999.
12. M. Kantola, H. Mannila, K. J. Räihä, and H. Siirtola. Discovering functional and inclusion dependencies in relational databases. International Journal of Intelligent Systems, 7:591–607, 1992.
13. M. Levene and G. Loizou. A Guided Tour of Relational Databases and Beyond. SPRINGER, 1999.
14. M. Levene and M. W. Vincent. Justification for inclusion dependency normal form. IEEE Transactions on Knowledge and Data Engineering, 12(2):281–291, 2000.
15. S. Lopes, J.-M. Petit, and L. Lakhal. Efficient discovery of functional dependencies and armstrong relations. In Carlo Zaniolo, Peter C. Lockemann, Marc H. Scholl, and Torsten Grust, editors, International Conference on Extending Database Technology, Konstanz, Germany, volume 1777 of Lecture Notes in Computer Science, pages 350–364. Springer, 2000.
16. S. Lopes, J-M. Petit, and F. Toumani. Discovering interesting inclusion dependencies: Application to logical database tuning. Information System, 17(1):1–19, 2002.
17. H. Mannila and K. J. Räihä. The Design of Relational Databases. Addison-Wesley, second edition, 1994.
18. H. Mannila and H. Toivonen. Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery, 1(1):241–258, 1997.
19. V.M. Markowitz and J.A. Makowsky. Identifying Extended Entity-Relationship Object Structures in Relational Schemas. IEEE Transactions on Software Engineering, 16(1):777–790, August 1990.
20. R. J. Miller, M. A. Hernández, L. M. Haas, L. Yan, C. T. H. Ho, R. Fagin, and L. Popa. The clio project: Managing heterogeneity. SIGMOD Record, 30(1):78–83, 2001.
21. Noel Novelli and Rosine Cicchetti. Fun: An efficient algorithmfor mining functional and embedded dependencies. In Jan Van den Bussche and Victor Vianu, editors, 8th International Conference on Databases Theory, London, UK, volume 1973 of Lecture Notes in Computer Science, pages 189–203. Springer, 2001.
22. E. Pichat and R. Bodin. Ingénierie des données. Masson, 1790.
23. C. Wyss, C. Giannella, and E. Robertson. Fastfds: A heuristic-driven depth-first algorithm for mining functional dependencies from relation instances. In Yahiko Kambayashi, Werner Winiwarter, and Masatoshi Arikawa, editors, Data Warehousing and Knowledge Discovery, Munich, Germany, volume 2114 of Lecture Notes in Computer Science, pages 101–110, 2001.