A Node.js graph database server inspired by filesystems.
A frequently-edited document can run to multiple megabytes or more, and persisting it as one unit — a row, a file, a blob — means every small edit rewrites the whole thing, with latency and write amplification that grow with it. Decomposing it so each edit touches only its own piece is the fix, but mapping a tree onto flat rows or an ORM adds friction and turns reads into a query per node. vertex.js stores the structure itself as a graph of path-addressed nodes with indexed slots: one edit writes one node (small and immediately durable), any part is reachable by path in log(n) time, and many actions batch into a single round trip. The model is the structure — no object-relational mapping in the way, and every path maps to a URL.