Accessibility navigation

High performance subgraph mining in molecular compounds

Di Fatta, G. and Berthold, M. R. (2005) High performance subgraph mining in molecular compounds. Lecture Notes in Computer Science, 3726. pp. 866-877. ISSN 0302-9743

Text - Accepted Version
· Please see our End User Agreement before downloading.


It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1007/11557654_97


Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques particularly relevant. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. The problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiver-initiated, load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening dataset, where the approach attains close-to linear speedup in a network of workstations.

Item Type:Article
Divisions:Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:6153
Additional Information:Proceedings of the 2005 Int. Conf. on High Performance Computing and Communications (HPCC-05)
Publisher Statement:The original publication is available at


Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation