SQLite's on-disk format uses a similar array technique for storing the contents of table btree leaf node pages. Within a fixed-size page, there's an array of offsets growing forwards, and an array of (variable length) row values growing backwards from the end - the latter of which may end up with holes when rows are deleted (iiuc).
It wouldn't surprise me if it was a direct inspiration, since their docs cite TAOCP for the btree structure itself.
It wouldn't surprise me if it was a direct inspiration, since their docs cite TAOCP for the btree structure itself.