Towards mining frequent queries in star schemes

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

Volumn 3933 LNCS, Issue , 2006, Pages 104-123

  Jen, Tao Yuan ^a   Laurent, Dominique ^a   Spyratos, Nicolas ^b   Sy, Oumar ^a,c  

^a UNIVERSITÉ DE CERGY PONTOISE   (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c UNIVERSITÉ GASTON BERGER   (Senegal)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA WAREHOUSES; DATABASE SYSTEMS; QUERY LANGUAGES; SEMANTICS;

FUNCTIONAL DEPENDENCIES; LEVEL-WISE ALGORITHMS; REFERENTIAL CONSTRAINTS; SELECTION-PROJECTION QUERIES;

DATA MINING;

EID: 33745774353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11733492_7     Document Type: Conference Paper

References (17)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 309-328. AAAI-MIT Press, 1996.
2. W.W. Armstrong. Dependency structures of data base relationships. In IFIP Congress, pages 580-583. North Holland, 1974.
3. A. Casali, R. Cichetti, and L. Lakhal. Extracting semantics from data cubes using cube transversals and closures. In ACM KDD, pages 69-78, 2003.
4. L. Dehaspe and L. De Raedt. Mining association rules in multiple relations. In 7th International Workshop on Inductive Logic Programming, volume 1297 of LNCS, pages 125-132. Springer Verlag, 1997.
5. C. T. Diop. Etude et mise en oeuvre des aspects itratifs de l'extraction de rgles d'association dans une base de donnes. PhD thesis, Universit de Tours, France, 2003.
6. C. T. Diop, A. Giacometti, D. Laurent, and N. Spyratos. Composition of mining contexts for efficient extraction of association rules. In EDBT'02, volume 2287 of LNCS, pages 106-123. Springer Verlag, 2002.
7. A. Faye, A. Giacometti, D. Laurent, and N. Spyratos. Mining rules in databases with multiple tables: Problems and perspectives. In 3rd International Conference on Computing Anticipatory Systems (CASYS), 1999.
8. A. Giacometti, D. Laurent, C. T. Diop, and N. Spyratos. Mining from views : An incremental approach. International Journal Information Theories & Applications, 9 (See also RR LI/E3i, Univ. de Tours), 2002.
9. B. Goethals. Mining queries, (unpublished paper). In Workshop on inductive databases and constraint based mining. Available at http://www.informatik.unifreiburg.de/~ml/IDB/talks/Goethals_slides.pdf., 2004.
10. B. Goethals and J. Van den Bussche. Relational association rules: getting warmer. In D. Hand, R. Bolton, and N. Adams, editors, Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery in Data Mining, volume 2447 of LNCS, pages 125-139. Springer-Verlag, 2002.
11. J. Han, Y. Fu, W. Wang, K. Koperski, and O. Zaiane. Dmql : A data mining query language for relational databases. In SIGMOD-DMKD'96, pages 27-34, 1996.
12. J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8:53-87, 2004.
13. D. Laurent, V. P. Luong, and N. Spyratos. Querying weak instances under extension chase semantics. Intl Journal of Comp. Mathematics, 80(5):591-613, 2003.
14. M. Levene and G. Loizou. Why is the snowflake schema a good data warehouse design? Information Systems, 28(3):225-240, 2003.
15. R. Meo, G. Psaila, and S. Ceri. An extension to sql for mining association rules. Data Mining and Knowledge Discovery, 9:275-300, 1997.
16. T. Turmeaux, A. Salleb, C. Vrain, and D. Cassard. Learning caracteristic rules relying on quantified paths. In PKDD, volume 2838 of LNCS, pages 471-482. Springer Verlag, 2003.
17. J.D. Ullman. Principles of Databases and Knowledge-Base Systems, volume 1. Computer Science Press, 1988.