A method for improving graph queries processing using positional inverted index (PII) idea in search engines and parallelization techniques

作者：Dinari Hamed^*; Naderi Hassan

来源：Journal of Central South University, 2016, 23(1): 150-159.

DOI：10.1007/s11771-016-3058-4

• graph query processing
• frequent subgraph
• graph mining
• data mining
• positional inverted index

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 column-based techniques and are used to store graphs of database, frequent sub-graphs 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.

• 出版日期2016-1