Currently the data structure design is simplistic and the key-value pairs are all stored in the leaves of the tree with a hard limit on their size of ten bytes each. This of course isn't realistic and cannot be used to support a real index in a real single or distributed storage. Thus, we would like to support varied length keys and values.
Currently the data structure design is simplistic and the key-value pairs are all stored in the leaves of the tree with a hard limit on their size of ten bytes each. This of course isn't realistic and cannot be used to support a real index in a real single or distributed storage. Thus, we would like to support varied length keys and values.