Zigzag: A new algorithm for mining large inclusion dependencies in databases

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2003, Pages 27-34

  De Marchi, Fabien ^a   Petit, Jean Marc ^a  

^a UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34548579999     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, Reading, Mass., 1995.
2. C. C. Aggarwal. Towards long pattern generation in dense databases. SIGKDD Explorations, 3(1):20-26, 2001.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In J. B. Bocca, M. Jarke, and C. Zaniolo, editors, International Conference on Very Large Data Bases (VLDB'94), Santiago de Chile, Chile, pages 487-499. Morgan Kaufmann, 1994.
4. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. ACM SIGKDD Exploration, 2(2):66-75, 2000.
5. R. J. Bayardo. Efficiently mining long patterns from databases. In L. M. Haas and A. Tiwary, editors, ACM SIGMOD International Conference on Management of Data, Seattle, USA, pages 85-93. ACM Press, 1998.
6. S. Bell and P. Brockhausen. Discovery of constraints and data dependencies in databases (extended abstract). In N. Lavrac and S. Wrobel, editors, European Conference on Machine Learning (ECML'95), Crete, Greece, pages 267-270, 1995.
7. C. Berge. Hypergraphs. North Holland Mathematic Library, 45, 1989.
8. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: A condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery, 7(1):5-22, 2003.
9. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In Principles of Data Mining and Knowledge Discovery, volume 2431 of Lecture Notes in Computer Science. Springer, 2002.
10. 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, Feb. 1984.
11. M. A. Casanova, L. Tucherman, and A. L. Furtado. Enforcing inclusion dependencies and referencial integrity. In F. Bancilhon and D. J. DeWitt, editors, International Conference on Very Large Data Bases (VLDB'88), Los Angeles, California, USA, pages 38-49. Morgan Kaufmann, 1988.
12. Q. Cheng, J. Gryz, F. Koo, T. Y. C. Leung, L. Liu, X. Qian, and B. Schiefer. Implementation of two semantic query optimization techniques in DB2 universal database. In M. P. Atkinson, M. E. Orlowska, P. Valduriez, S. B. Zdonik, and M. L. Brodie, editors, International Conference on Very Large Data Bases (VLDB'99), Edinburgh, Scotland, UK, pages 687-698. Morgan Kaufmann, 1999.
13. F. De Marchi, S. Lopes, and J.-M. Petit. Efficient algorithms for mining inclusion dependencies. In C. S. Jensen, K. G. Jeffery, J. Pokorný, S. Saltenis, E. Bertino, K. Böhm, and M. Jarke, editors, International Conference on Extending Database Technology (EDBT'02), Prague, Czech Republic, volume 2287 of Lecture Notes in Computer Science, pages 464-476. Springer, 2002.
14. F. De Marchi, S. Lopes, J.-M. Petit, and F. Toumani. Analysis of existing databases at the logical level: the DBA companion project. ACM Sigmod Record, 32(1):47-52, 2003.
15. J. Demetrovics and V. Thi. Some remarks on generating armstrong and inferring functional dependencies relation. Acta Cybernetica, 12(2):167-180, 1995.
16. T. Eiter and G. Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing, 24(6):1278-1304, 1995.
17. K. Gouda and M. J. Zaki. Efficiently mining maximal frequent itemsets. In N. Cercone, T. Y. Lin, and X. Wu, editors, International Conference on Data Mining, San Jose, USA. IEEE Computer Society, 2001.
18. J. Gryz. Query folding with inclusion dependencies. In International Conference on Data Engineering (ICDE'98), Orlando, Florida, USA, pages 126-133. IEEE Computer Society, 1998.
19. D. Gunopulos, R. Khardon, H. Mannila, and H. Toivonen. Data mining, hypergraph transversals, and machine learning. In Symposium on Principles of Database Systems (PODS'97), Tucson, Arizona, pages 209-216. ACM Press, 1997.
20. 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.
21. A. Koeller and E. A. Rundensteiner. Discovery of high-dimentional inclusion dependencies (poster). In International Conference on Data Engineering. IEEE Computer Society, 2003.
22. M. Levene and G. Loizou. A Guided Tour of Relational Databases and Beyond. Springer, 1999.
23. M. Levene and M. W. Vincent. Justification for inclusion dependency normal form. IEEE Transactions on Knowledge and Data Engineering, 12(2):281-291, 2000.
24. D.-I. Lin and Z. M. Kedem. Pincer search: A new algorithm for discovering the maximum frequent set. In H.-J. Schek, F. Saltor, I. Ramos, and G. Alonso, editors, Extending Database Technology, Valencia, Spain, volume 1377 of Lecture Notes in Computer Science, pages 105-119. Springer, 1998.
25. S. Lopes, J.-M. Petit, and F. Toumani. Discovering interesting inclusion dependencies: Application to logical database tuning. Information System, 17(1):1-19, 2002.
26. H. Mannila and K.-J. Räihä. Inclusion dependencies in database design. In International Conference on Data Engineering (ICDE'86), Los Angeles, California, USA, pages 713-718. IEEE Computer Society, 1986.
27. H. Mannila and H. Toivonen. Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery, 1(1):241-258, 1997.
28. 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. ACM SIGMOD Record, 30(1):78-83, 2001.
29. J. C. Mitchell. The implication problem for functional and inclusion dependencies. Information and Control, 56(3):154-173, Mar. 1983.
30. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46, 1999.