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 条
  • [21] Summary queries for frequent itemsets mining
    Zhang, Shichao
    Jin, Zhi
    Lu, Jingli
    JOURNAL OF SYSTEMS AND SOFTWARE, 2010, 83 (03) : 405 - 411
  • [22] Incremental Frequent Itemsets Mining with MapReduce
    Kandalov, Kirill
    Gudes, Ehud
    ADVANCES IN DATABASES AND INFORMATION SYSTEMS, ADBIS 2017, 2017, 10509 : 247 - 261
  • [23] Mining Frequent and Homogeneous Closed Itemsets
    Hilali, Ines
    Jen, Tao-Yuan
    Laurent, Dominique
    Marinica, Claudia
    Ben Yahia, Sadok
    INFORMATION SEARCH, INTEGRATION AND PERSONALIZATION, ISIP 2014, 2016, 497 : 51 - 65
  • [24] Efficiently mining maximal frequent itemsets
    Gouda, K
    Zaki, MJ
    2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 163 - 170
  • [25] Mining Frequent Weighted Closed Itemsets
    Bay Vo
    Nhu-Y Tran
    Duong-Ha Ngo
    ADVANCED COMPUTATIONAL METHODS FOR KNOWLEDGE ENGINEERING, 2013, 479 : 379 - 390
  • [26] An Improved Algorithm for Frequent Itemsets Mining
    Jiang, Hao
    He, Xu
    2017 FIFTH INTERNATIONAL CONFERENCE ON ADVANCED CLOUD AND BIG DATA (CBD), 2017, : 314 - 317
  • [27] Mining maximal frequent itemsets with frequent pattern list
    Qian, Jin
    Ye, Feiyue
    FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 1, PROCEEDINGS, 2007, : 628 - 632
  • [28] Parallel algorithm for mining frequent itemsets
    Ruan, YL
    Liu, G
    Li, QH
    Proceedings of 2005 International Conference on Machine Learning and Cybernetics, Vols 1-9, 2005, : 2118 - 2121
  • [29] On Maximal Frequent Itemsets Mining with Constraints
    Jabbour, Said
    Mana, Fatima Ezzahra
    Dlala, Imen Ouled
    Raddaoui, Badran
    Sais, Lakhdar
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, 2018, 11008 : 554 - 569
  • [30] Mining frequent itemsets with convertible constraints
    Pei, J
    Han, JW
    Lakshmanan, LVS
    17TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2001, : 433 - 442