Graph-indexing wavelet tree (gWT) is a software for graph similarity search and is applicable to massive graph databases. First, gWT represents graphs as a set of words called bag-of-words. Then, gWT solves the graph similarity search problem as a semi-conjunctive query which searches for graphs matching to at least k query words. To solve the semi-conjunctive query efficiently, gWT uses a novel recursive search algorithm on wavelet trees. Unlike state-of-the-art graph indexing methods, it does not require a frequent subgraph mining for indexing. gWT is applicable to more than 20 million graphs.
- Changes to previous version:
Initial Announcement on mloss.org.
No one has posted any comments yet. Perhaps you'd like to be the first?
Leave a comment
You must be logged in to post comments.