Conference paper
Online algorithms for handling skew in parallel joins
Arun Swami, Honesty C. Young
ICPP 1993
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel estimation and pruning techniques. We also present results of applying this algorithm to sales data obtained from a large retailing company, which shows the effectiveness of the algorithm. © 1993, ACM. All rights reserved.
Arun Swami, Honesty C. Young
ICPP 1993
Roberto J. Bayardo, Rakesh Agrawal
ICDE 2005
Shaul Dar, Rakesh Agrawal
IEEE Transactions on Knowledge and Data Engineering
Sunita Sarawagi, Shiby Thomas, et al.
SIGMOD Record