作者: Maciej Zakrzewicz , Marek Wojciechowski
DOI:
关键词:
摘要: In this paper we consider concurrent execution of multiple data mining queries in the context discovery frequent itemsets. If such operate on similar parts database, then their overall I/O cost can be reduced by transforming set into another non-overlapping queries, whose results used to efficiently answer original queries. We discuss problem query optimization and experimentally evaluate Mine Merge algorithm execute sets