Graph Store Model in Neo4j

简vae

已于 2023-07-26 19:20:37 修改

阅读量172

点赞数

分类专栏： Neo4j 文章标签： neo4j

于 2023-05-13 15:43:58 首次发布

本文链接：https://blog.csdn.net/qq_49588762/article/details/130658138

版权

Neo4j 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Neo4j是一个开源的图数据库，自2007年起提供ACID兼容的事务后端。数据以节点、关系和属性的形式组织。节点带有标签，表示不同角色，关系则是两个节点之间的定向连接，两者都可拥有属性。图存储模型中，每个顶点记录包含指向边的指针以及元数据，每条边记录包含关系标签、连接的顶点指针及前后边指针。

摘要由CSDN通过智能技术生成

Neo4j

Neo4j is an open-source, NoSQL, native graph database that provides an ACID-compliant transactional backend for your applications that has been publicly available since 2007. This article only focus on graph store model of Neo4j.

Property Graph

In property graph, information is organized as nodes, relationships, and properties.[2]

Nodes are the entities in the graph.

Nodes can be tagged with labels, representing their different roles in your domain. (For example, Person).
Nodes can hold any number of key-value pairs, or properties. (For example, name)
Node labels may also attach metadata (such as index or constraint information) to certain nodes.

Relationships provide directed, named, connections between two node entities (e.g. Person LOVES Person).

Relationships always have a direction, a type, a start node, and an end node, and they can have properties, just like nodes.
Nodes can have any number or type of relationships without sacrificing performance.
Although relationships are always directed, they can be navigated efficiently in any direction.

Graph Store Model

The following figure[3] details a simple example of an property graph in Neo4j. Here three vertices $v_{1}$ , $v_{2}$ , $v_{3}$ are connected via different edges $e_{1}$ , $e_{2}$ , . . . $e_{5}$ . The edges have labels $l_{1}$ , $l_{2}$ which represents different relationships between the connected vertices.

In this model, each vertex record contains a pointer to the first edge and additional metadata such as a pointer to vertex properties. Each edge record contains the label representing the relationship between the connected vertices, pointers to the vertex pairs connected by the edge, and the pointers for previous and next edges for each vertex. The vertex and edge records for the graph at Figure 1 are shown in Table I.