文章基本信息

标题：An Effective Approach to Understand the Graph Database with Shortest path Algorithm
本地全文：下载
作者：Nikhlesh Patidar ; Digvijay Singh ; Varun Kumar.M 等
期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：11
出版社：S.S. Mishra
摘要：A graph database is a database that uses graph structure with nodes, edges, and properties to represent and store data. By definition, a graph database is any storage system that provides index-free adjacency. This means that every element contains a direct pointer to its adjacent element and no index[2] lookup are necessary. General graph databases that can store any graph are distinct from specialized graph databases such as triple stores and network database. Graph databases are based on graph theory. Graph databases employ nodes, properties, and edges. Nodes are very similar in nature to the objects that object-oriented programmers will be familiar with Nodes represent entities such as people, businesses, accounts, or any other item you might want to keep track of. Properties are pertinent information that relate to nodes
关键词：Edges; Nodes; Graph theory; Neo4jTool[1]; Shortest Path Algorithm