DB Weekly·specialized-engines
Graph Database Storage Models: Native vs Non-Native
Native graph storage achieves O(1) per-hop traversal cost through index-free adjacency, using physical pointers between fixed-size node and relationship records.
Latest
Native graph storage achieves O(1) per-hop traversal cost through index-free adjacency, using physical pointers between fixed-size node and relationship records.
Newsletter
One carefully selected topic, written to depth, every week. Distributed systems. Databases. The foundations.