Evaluation of the mine merge method for data mining query processing

被引:0
作者
Wojciechowski, M [1 ]
Zakrzewicz, M [1 ]
机构
[1] Poznan Univ Technol, Inst Comp Sci, PL-60965 Poznan, Poland
来源
ADBIS' 04: EIGHTH EAST-EUROPEAN CONFERENCE ON ADVANCES IN DATABASES AND INFORMATION SYSTEMS, PROCEEDINGS | 2004年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar parts of the database, then their overall I/O cost can be reduced by transforming the set of data mincing queries into another set of non-overlapping queries, whose results can be used to efficiently answer the original queries. We discuss the problem of multiple data mining query optimization and experimentally evaluate the Mine Merge algorithm to efficiently execute sets of data mining queries.
引用
收藏
页码:78 / 88
页数:11
相关论文
共 17 条
  • [1] Agarwal R., 1994, P 20 INT C VER LARG, V487, P499
  • [2] AGRAWAL R, 1996, P 2 INT C KNOWL DISC
  • [3] AGRAWALR, 1993, P 1993 ACM SIGMOD C
  • [4] CERI S, 1996, P 22 INT C VER LARG
  • [5] CHEUNG DW, 1996, P 12 ICDE
  • [6] HAN J, 1996, P 2 KDD C
  • [7] IMIELINSKI T, 1996, COMMUNICATIONS ACM, V39
  • [8] IMIELINSKI T, 1996, P 2 KDD C
  • [9] Morzy T., 2000, P 2 DAWAK C
  • [10] MORZY T, 1997, ADBIS 97 S