Contribution to a conference collection:
Mining Molecular Datasets on Symmetric Multiprocessor Systems

Thumbnail Image
Date
2006
Editors
Wörlein, Marc
Fischer, Ingrid
Philippsen, Michael
relationships.isEditorOf
Contact
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
DOI (citable link)
ArXiv-ID
International patent number
Project
EU project number
Open Access publication
Restricted until
Title in another language
Research Projects
Organizational Units
Journal Issue
Publication type
Contribution to a conference collection
Publication status
Abstract
Although in the last years about a dozen sophisticated algorithms for mining frequent subgraphs have been proposed, it still takes too long to search big databases with 100,000 graphs and more. Even the currently fastest algorithms like gSpan, FFSM, Gaston, or MoFa need hours to complete their tasks.
This paper presents thread-based parallel versions of MoFa [5] and gSpan [26] that achieve speedups up to 11 on a shared-memory SMP system using 12 processors. We discuss the design space of the parallelization, the results, and the obstacles, that are caused by the irregular search space and by the current state of Java technology.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Published in
International Conference on Systems, Man and Cybernetics, 2006. SMC '062 (2006). - pp. 1269-1274
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690MEINL, Thorsten, Marc WÖRLEIN, Ingrid FISCHER, Michael PHILIPPSEN, 2006. Mining Molecular Datasets on Symmetric Multiprocessor Systems. In: International Conference on Systems, Man and Cybernetics, 2006. SMC '06. 2, pp. 1269-1274
BibTex
@inproceedings{Meinl2006Minin-5649,
  year={2006},
  title={Mining Molecular Datasets on Symmetric Multiprocessor Systems},
  booktitle={International Conference on Systems, Man and Cybernetics, 2006. SMC '06},
  pages={1269--1274},
  author={Meinl, Thorsten and Wörlein, Marc and Fischer, Ingrid and Philippsen, Michael}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5649">
    <dc:language>eng</dc:language>
    <dcterms:title>Mining Molecular Datasets on Symmetric Multiprocessor Systems</dcterms:title>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:57:29Z</dcterms:available>
    <dc:creator>Philippsen, Michael</dc:creator>
    <dcterms:abstract xml:lang="eng">Although in the last years about a dozen sophisticated algorithms for mining frequent subgraphs have been proposed, it still takes too long to search big databases with 100,000 graphs and more. Even the currently fastest algorithms like gSpan, FFSM, Gaston, or MoFa need hours to complete their tasks.&lt;br /&gt;This paper presents thread-based parallel versions of MoFa [5] and gSpan [26] that achieve speedups up to 11 on a shared-memory SMP system using 12 processors. We discuss the design space of the parallelization, the results, and the obstacles, that are caused by the irregular search space and by the current state of Java technology.</dcterms:abstract>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:format>application/pdf</dc:format>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Philippsen, Michael</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5649/1/MeWF_06_MoFaPar_smc.pdf"/>
    <dc:creator>Meinl, Thorsten</dc:creator>
    <dc:contributor>Fischer, Ingrid</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5649"/>
    <dcterms:issued>2006</dcterms:issued>
    <dc:contributor>Wörlein, Marc</dc:contributor>
    <dc:creator>Wörlein, Marc</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5649/1/MeWF_06_MoFaPar_smc.pdf"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:57:29Z</dc:date>
    <dc:creator>Fischer, Ingrid</dc:creator>
    <dc:contributor>Meinl, Thorsten</dc:contributor>
    <dcterms:bibliographicCitation>First publ. in: International Conference on Systems, Man and Cybernetics, 2006. SMC '06. Vol. 2, pp. 1269-1274</dcterms:bibliographicCitation>
  </rdf:Description>
</rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Contact
URL of original publication
Test date of URL
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes
Refereed
Link to research data
Description of supplementary data