c - Fully Persistent B+ Tree -
i'm trying implement b+ tree (in c language) each key being data(int/float/string) , corresponding value list, size not fixed.
i want store tree in file , access later on, when required. may consider implementation follows:
- each search key corresponds page in file and
- each page contains set of values corresponding key
the problem is: cannot assign page key, may consume little , waste entire page. need persistent way of implementing b+ tree in file system, instead of main-memory.
check disk-based b-tree implementation out, might help.
and paper titled fully persistent b+-trees
Comments
Post a Comment