B-tries for disk-based string management

摘要: A wide range of applications require that large quantities data be maintained in sort order on disk. The B-tree, and its variants, are an efficient general-purpose disk-based structure is almost universally used for this task. B-trie has the potential to a competitive alternative storage where strings as keys, but not previously been thoroughly described or tested. We propose new algorithms insertion, deletion, equality search variable-length disk-resident B-trie, well novel splitting strategies which critical element practical implementation. experimentally compare against variants B-tree several sets with characteristics. Our results demonstrate that, although uses more memory, it faster, scalable, requires less disk space.