We consider the problem of mining association rules on a shared-nothin
g multiprocessor. We present three algorithms that explore a spectrum
of trade-offs between computation, communication, memory usage, synchr
onization, and the use of problem-specific information. The best algor
ithm exhibits near perfect scaleup behavior, yet requires only minimal
overhead compared to the current best serial algorithm.