@InProceedings{perez:apriori,
  author = {M.~S. P\'erez and R.~A. Pons and F. Garc{\'\i}a and J. Carretero
  and M.~L. C\'ordoba},
  title = {An Optimization of Apriori Algorithm through the Usage of Parallel
  {I/O} and Hints},
  booktitle = {Rough Sets and Current Trends in Computing},
  year = {2002},
  month = {October},
  series = {Lecture Notes in Computer Science},
  number = {2475},
  pages = {449--452},
  publisher = {Springer-Verlag},
  URL = {http://link.springer.de/link/service/series/0558/tocs/t2475.htm},
  keywords = {parallel I/O, pario-bib},
  abstract = {Association rules are very useful and interesting patterns in
  many data mining scenarios. Apriori algorithm is the best- known association
  rule algorithm. This algorithm interacts with a storage system in order to
  access input data and output the results. This paper shows how to optimize
  this algorithm adapting the underlying storage system to this problem through
  the usage of hints and parallel features.}
}