An edge-based framework for fast subgraph matching in a large graph

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 326
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorKim, Sagjaeko
dc.contributor.authorSong, Inchulko
dc.contributor.authorLee, Yoon Joonko
dc.date.accessioned2013-03-28T09:12:57Z-
dc.date.available2013-03-28T09:12:57Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2011-04-22-
dc.identifier.citation16th International Conference on Database Systems for Advanced Applications, DASFAA 2011, pp.404 - 417-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10203/164422-
dc.description.abstractIn subgraph matching, we want to find all subgraphs of a database graph that are isomorphic to a query graph. Subgraph matching requires subgraph isomorphism testing, which is NP-complete. Recently, some techniques specifically designed for subgraph matching in a large graph have been proposed. They are based on a filtering-and-verification framework. In the filtering phase, they filter out vertices that are not qualified for subgraph isomorphism testing. In the verification phase, subgraph isomorphism testing is performed and all matched subgraphs are returned to the user. We call them a vertex-based framework in the sense that they use vertex information when filtering out unqualified vertices. Edge information, however, can also be used for efficient subgraph matching. In this paper, we propose an edge-based framework for fast subgraph matching in a large graph. By using edge connectivity information, our framework not only filters out more vertices in the filtering phase, but also avoids unnecessary edge connectivity checking operations in the verification phase. The experimental results show that our method significantly outperforms existing approaches for subgraph matching in a large graph.-
dc.languageEnglish-
dc.publisher16th International Conference on Database Systems for Advanced Applications, DASFAA 2011-
dc.titleAn edge-based framework for fast subgraph matching in a large graph-
dc.typeConference-
dc.identifier.wosid000295023100030-
dc.identifier.scopusid2-s2.0-79955118844-
dc.type.rimsCONF-
dc.citation.beginningpage404-
dc.citation.endingpage417-
dc.citation.publicationname16th International Conference on Database Systems for Advanced Applications, DASFAA 2011-
dc.identifier.conferencecountryCC-
dc.identifier.conferencelocationHong Kong-
dc.contributor.localauthorLee, Yoon Joon-
dc.contributor.nonIdAuthorKim, Sagjae-
dc.contributor.nonIdAuthorSong, Inchul-
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0