Authors: Hamed Dinari Hassan Naderi
Publish Date: 2016/01/12
Volume: 23, Issue: 1, Pages: 150-159
Abstract
The idea of positional inverted index is exploited for indexing of graph database The main idea is the use of hashing tables in order to prune a considerable portion of graph database that cannot contain the answer set These tables are implemented using columnbased techniques and are used to store graphs of database frequent subgraphs and the neighborhood of nodes In order to exact checking of remaining graphs the vertex invariant is used for isomorphism test which can be parallel implemented The results of evaluation indicate that proposed method outperforms existing methods
Keywords: