Show simple item record

dc.contributor.authorRen, Xuguang
dc.contributor.authorWang, Junhu
dc.date.accessioned2018-03-07T02:22:33Z
dc.date.available2018-03-07T02:22:33Z
dc.date.issued2015
dc.identifier.issn2150-8097
dc.identifier.doi10.14778/2735479.2735493
dc.identifier.urihttp://hdl.handle.net/10072/134181
dc.description.abstractSubgraph Isomorphism is a fundamental problem in graph data processing. Most existing subgraph isomorphism algorithms are based on a backtracking framework which computes the solutions by incrementally matching all query vertices to candidate data vertices. However, we observe that extensive duplicate computation exists in these algorithms, and such duplicate computation can be avoided by exploiting relationships between data vertices. Motivated by this, we propose a novel approach, BoostIso, to reduce duplicate computation. Our extensive experiments with real datasets show that, after integrating our approach, most existing subgraph isomorphism algorithms can be speeded up significantly, especially for some graphs with intensive vertex relationships, where the improvement can be up to several orders of magnitude.
dc.description.peerreviewedYes
dc.languageEnglish
dc.publisherVLDB Endowment
dc.publisher.placeUnited States
dc.relation.ispartofconferencenameVLDB 2015
dc.relation.ispartofconferencetitlePROCEEDINGS OF THE VLDB ENDOWMENT
dc.relation.ispartofdatefrom2015-08-31
dc.relation.ispartofdateto2015-09-04
dc.relation.ispartoflocationUnited States
dc.relation.ispartofpagefrom617
dc.relation.ispartofpagefrom12 pages
dc.relation.ispartofpageto628
dc.relation.ispartofpageto12 pages
dc.relation.ispartofissue5
dc.relation.ispartofvolume8
dc.subject.fieldofresearchDatabase Management
dc.subject.fieldofresearchComputation Theory and Mathematics
dc.subject.fieldofresearchInformation Systems
dc.subject.fieldofresearchLibrary and Information Studies
dc.subject.fieldofresearchcode080604
dc.subject.fieldofresearchcode0802
dc.subject.fieldofresearchcode0806
dc.subject.fieldofresearchcode0807
dc.titleExploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs
dc.typeConference output
dc.type.descriptionE1 - Conferences
dc.type.codeE - Conference Publications
dcterms.licensehttp://creativecommons.org/licenses/by-nc-nd/3.0/
dc.description.versionVersion of Record (VoR)
gro.facultyGriffith Sciences, Griffith School of Engineering
gro.rights.copyright© The Author(s) 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0) License (http://creativecommons.org/licenses/by-nc-nd/3.0/) which permits unrestricted, non-commercial use, distribution and reproduction in any medium, providing that the work is properly cited.
gro.hasfulltextFull Text
gro.griffith.authorWang, John
gro.griffith.authorRen, Xuguang


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record