Mining global association rules on an oracle grid by scanning once distributed databases

Authors:
Frank Wang;Na Helian
Affiliations:
Centre for Grid Computing, Cambridge-Cranfield High-Performance Computing Facilities, UK;Department of Computing, Communication Technology and Mathematics, London Metropolitan University, UK
Venue:
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Year:
2005

Citing 7
Cited 0

Fast discovery of association rules

Advances in knowledge discovery and data mining
Papyrus: a system for data mining over local and wide area clusters and super-clusters

SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Real world performance of association rule algorithms

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient Mining of Association Rules in Distributed Databases

IEEE Transactions on Knowledge and Data Engineering
A High-Performance Distributed Algorithm for Mining Association Rules

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Orthogonal Decision Trees

ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Approximate frequency counts over data streams

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Oracle 10g is a commercial infrastructure specifically designed for enterprise grid computing. On an Oracle Grid, we implement a ScanOnce algorithm to mine global association rules in support of the third generation of data mining systems on distributed and massive data. The ScanOnce algorithm does not need to ship all of local data to one site thereby not causing excessive network communication cost. The power of generating ad hoc queries in SQL ensures fast access to any desired counter.