Search Results for "disk"

...Nonblonde tables are backed by b-trees that organize their nodes as critical bit trees. It allows multiple tables per store, atomic updates, keys of unlimited size. Head and tail key compression and a variable block size reduce the database disk size. Disk blocks are never modified in place, for which the written database is always in an intended state and does not need repair or recovery.

meta-treedb can implement malloc functionality, and much more! Need a heap that allocates from a fixed size chunk of memory? No problem. But where treedb comes into its own is when it comes to allocating from a mmap()ed disk file - the memory becomes persistent. If you follow the tests/examples, you too can store dictionaries, trees, lists or whatever you can think of in disk-based memory, just an open() and mmap() away. Meta-treedb comes with an AVL tree, doubly-linked-list and variable-entry-sized-array implementations for you to use in your data structures. ...