Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Stevedekorte's vertex.js. Parent comment
It's used to implement storage (b-tree). Each vertex is a set of key value pairs in the following format:
pid/s/name (slot record) pid/m/name (meta record) pid/p/name (private record)
Since all keys are lexically ordered, you can efficiently iterate (and jump to) vertex records using a cursor.
There are no comments on this comment yet.
It's used to implement storage (b-tree). Each vertex is a set of key value pairs in the following format:
pid/s/name (slot record) pid/m/name (meta record) pid/p/name (private record)
Since all keys are lexically ordered, you can efficiently iterate (and jump to) vertex records using a cursor.