Frequent itemsets mining for database auto-administration

被引:3
|
作者
Aouiche, K [1 ]
Darmont, J [1 ]
Gruenwald, L [1 ]
机构
[1] Univ Lyon 2, ERIC, BDD, F-69676 Bron, France
关键词
D O I
10.1109/IDEAS.2003.1214915
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the wide development of databases in general and data warehouses in particular it is important to reduce the tasks that a database administrator must perform manually. The aim of auto-administrative systems is to administrate and adapt themselves automatically without loss (or even with a gain) in performance. The idea of using data mining techniques to extract useful knowledge for administration from the data themselves has existed for some years. However little research has been achieved. This idea nevertheless remains a very promising approach, notably in the field of data warehousing, where queries are very heterogeneous and cannot be interpreted easily. The aim of this study is to search for a way of extracting useful knowledge from stored data themselves to automatically apply performance optimization techniques, and more particularly indexing techniques. We have designed a tool that extracts frequent item-sets from a given workload to compute an index configuration that helps optimizing data access time. The experiments we performed showed that the index configurations generated by our tool allowed performance gains of 15% to 25% on a test database and a test data warehouse.
引用
收藏
页码:98 / 103
页数:6
相关论文
共 50 条
  • [41] Fast mining maximum frequent itemsets
    Lu, S.F.
    Lu, Z.D.
    Ruan Jian Xue Bao/Journal of Software, 2001, 12 (02): : 293 - 297
  • [42] A Combination Approach to Frequent Itemsets Mining
    Sahaphong, Supatra
    Boonjing, Veera
    Third 2008 International Conference on Convergence and Hybrid Information Technology, Vol 1, Proceedings, 2008, : 565 - 570
  • [43] Mining frequent itemsets with tough constraints
    Jia, L
    Pei, RQ
    Zhang, SQ
    2002 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-4, PROCEEDINGS, 2002, : 459 - 462
  • [44] NUCLEAR: An Efficient Methods for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
    Huy Quang Pham
    Duc Tran
    Ninh Bao Duong
    Fournier-Viger, Philippe
    Alioune Ngom
    INFORMATION TECHNOLOGY IN INDUSTRY, 2019, 7 (02): : 1 - 13
  • [45] A Hybrid Approach for Mining Frequent Itemsets
    Bay Vo
    Tuong Le
    Coenen, Frans
    Hong, Tzung-Pei
    2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013), 2013, : 4647 - 4651
  • [46] Efficient mining frequent itemsets algorithms
    Mohamed, Marghny H.
    Darwieesh, Mohammed M.
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2014, 5 (06) : 823 - 833
  • [47] Mining updated frequent itemsets based on directed itemsets graph
    Wen Lei
    Li Min-qiang
    Proceedings of 2004 Chinese Control and Decision Conference, 2004, : 690 - 693
  • [48] Mining maximum frequent itemsets based on directed itemsets graph
    Wen Lei
    PROCEEDINGS OF 2004 CHINESE CONTROL AND DECISION CONFERENCE, 2004, : 681 - 683
  • [49] One Database Pass Algorithms of Mining Top-k Frequent Closed Itemsets
    Qiu, Yong
    Lan, Yong-Jie
    ICCSSE 2009: PROCEEDINGS OF 2009 4TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION, 2009, : 828 - 833
  • [50] Parallel mining of top-k frequent itemsets in very large text database
    Wang, YH
    Jia, Y
    Yang, SQ
    ADVANCES IN WEB-AGE INFORMATION MANAGEMENT, PROCEEDINGS, 2005, 3739 : 706 - 712