Next: , Previous: , Up: Overview   [Contents][Index]


1.3 Tables

Tables are associative arrays, matching data for unique keys. The keys are taken as byte strings and organized by their natural order. Tables are thus sorted and their traversal would see the keys ordered.

Tables are referred by 8 bytes long identifiers (e.g. "illusion").

B-tree block (node) sizes are pertaining tables and are set per table.