| 
|
Quote: trie hash by sort on leading digits with split between buckets by a prefix; better than B-tree, can 100% load for ordered insertion
topics >
all references >
references i-l >
Topic:
sort algorithms
Topic:
hash table and hash functions
Topic:
spelling errors
Quotation Skeleton
Trie hashing is a primary key access method … Key search usually requires one disk access when … to be on disk. We present a new … insertions, and increases the load factor for random … hashing preferable to a B-tree. [sorted by leading digits, with the split between buckets by a prefix]. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: sort algorithms (24 items)
Topic: hash table and hash functions (41 items)
Topic: spelling errors (18 items)