B-trie
Lua error in package.lua at line 80: module 'strict' not found.
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.
References
<templatestyles src="Reflist/styles.css" />
Cite error: Invalid <references> tag; parameter "group" is allowed only.
<references />, or <references group="..." /><templatestyles src="Asbox/styles.css"></templatestyles>
 |
This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
