Foundations of Intelligent Systems

Volume 6804 of the series Lecture Notes in Computer Science pp 376-385

Data Access Paths in Processing of Sets of Frequent Itemset Queries

  • Piotr JedrzejczakAffiliated withPoznan University of Technology
  • , Marek WojciechowskiAffiliated withPoznan University of Technology

* Final gross prices may vary according to local VAT.

Get Access


Frequent itemset mining can be regarded as advanced data-base querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered itemsets. One of the research directions influenced by the above observation is the processing of sets of frequent itemset queries operating on overlapping datasets. Several methods of solving this problem have been proposed, all of them assuming selective access to the partitions of data determined by the overlapping of queries, and tested so far only on flat files. In this paper we theoretically and experimentally analyze the influence of data access paths available in database systems on the methods of frequent itemset query set processing, which is crucial from the point of view of their possible applications.