The scheme maintains a smaller, separate file that contains pointers and is maintained in a sorted order. D3 index files are kept in a linear sorted order and maintained as a balanced tree, or B-tree. B-trees are sorted linked lists, so search time is kept to a minimum.
See Also