Efficient subgraph matching on non-volatile memory

Abstract

The emerging non-volatile memory (NVM) technologies have attracted much attention due to its advantages over the existing DRAM technology such as non-volatility, byte-addressability and high storage density. These promising features make NVM a promising replacement of DRAM. Although the reading cost of NVM is close to that of DRAM, the writing cost is significantly higher than that of DRAM. Existing algorithms designed on DRAM treat read and write equally and thus are not applicable to NVM. In this paper, we investigate efficient algorithms for subgraph matching, a fundamental problem in graph databases, on NVM. We first give a detailed evaluation on several existing subgraph matching algorithms by experiments and theoretical analysis. Then, we propose our write-limited subgraph matching algorithm based on the analysis. We also extend our algorithm to answer subgraph matching on dynamic graphs. Experiments on an NVM simulator demonstrate a significant improvement in efficiency against the existing algorithms.