Research Review of Algorithm Model in Graphic Database System

Abstract

Nowadays, with the establishment of social net-works, graph data has played a critical role in everyday life. A graph database should be capable of dealing with the corresponding graph data. Every node in the graph is a data point, and the edges between nodes denote the relationship between data. The graph database is expected to reach the relationship between nodes rapidly and accurately, thus benefiting areas in need of vast computational resources, such as business and social networks. Querying and indexing the graph database is the most crucial part to reduce the computational resources, which naturally becomes the focus of this paper. In this review, we concluded the existing approaches and techniques of querying and indexing and summarized the pros and cons for each of them. Possible future research directions were also provided based on the analysis of existing ones.