Graph Database
A type of database that stores and queries data in a graph structure, with nodes and edges representing entities and relationships; it is suited to expressing complex associations and path queries.
Core Facts
Timeline (last 90 days)
传统关系型数据库表达多跳关联需要多次JOIN操作，且随着关联深度增加性能急剧下降；图数据库将关系作为一等公民存储，多跳查询延迟与路径长度近似线性。
Engram represents a new memory superseding an old one via a SUPERSEDES edge; old memories are marked superseded but not deleted, and recall filters to active status by default.
The root of the performance gap is index-free adjacency: in a graph database each node points directly to its neighbors, so traversing along edges only requires pointer hops, and the cost depends on the actual size of the graph visited rather than the size of the whole table.
The author believes graph databases are not a nice-to-have for anti-money-laundering, because fraud itself is graph-shaped.
Structured storage of opinions often uses graph databases or time series databases to support multi-dimensional queries by person, topic, and time range.
An organizational hierarchy is fundamentally a rooted tree or directed acyclic graph in terms of data structure; querying multi-level reporting chains in relational databases requires recursive CTEs whose performance degrades, whereas graph databases such as Neo4j and Amazon Neptune have performance advantages in path traversal
All Facts (7)
Graph databases store entities and relationships in the form of nodes and edges, and natively support multi-hop reasoning.
75%Unverified传统关系型数据库表达多跳关联需要多次JOIN操作，且随着关联深度增加性能急剧下降；图数据库将关系作为一等公民存储，多跳查询延迟与路径长度近似线性。
50%UnverifiedEngram represents a new memory superseding an old one via a SUPERSEDES edge; old memories are marked superseded but not deleted, and recall filters to active status by default.
50%UnverifiedThe root of the performance gap is index-free adjacency: in a graph database each node points directly to its neighbors, so traversing along edges only requires pointer hops, and the cost depends on the actual size of the graph visited rather than the size of the whole table.
50%UnverifiedThe author believes graph databases are not a nice-to-have for anti-money-laundering, because fraud itself is graph-shaped.
50%UnverifiedStructured storage of opinions often uses graph databases or time series databases to support multi-dimensional queries by person, topic, and time range.
50%UnverifiedAn organizational hierarchy is fundamentally a rooted tree or directed acyclic graph in terms of data structure; querying multi-level reporting chains in relational databases requires recursive CTEs whose performance degrades, whereas graph databases such as Neo4j and Amazon Neptune have performance advantages in path traversal
50%