B-trie
From Wikipedia, the free encyclopedia
 |
This article has multiple issues. Please help improve it or discuss these issues on the talk page.
|
The B-trie is a trie-based data structure that can store and retrieve variable-length strings efficiently on disk.[1]
The B-trie was compared against several high-performance variants of B-tree that were designed for string keys. It was shown to offer superior performance, particularly under skew access (i.e., many repeated searches). It is currently a leading choice for maintaining a string dictionary on disk, along with other disk-based tasks, such as maintaining an index to a string database or for accumulating the vocabulary of a large text collection.
[edit] References
- ^ Askitis, Nikolas; Zobel, Justin (2008), "B-tries for Disk-based String Management", VLDB Journal: 1–26, ISBN 1066-8888 (Print) 0949-877X (Online), http://www.springerlink.com/content/x7545u2g85675u17/
 |
This computer science article is a stub. You can help Wikipedia by expanding it. |
