| 
|
Quote: chained hash tables are best for building vocabularies; considerably faster than splay trees and binary trees
topics >
all references >
references t-z >
Topic:
full-text indexing
Topic:
hash table and hash functions
Quotation Skeleton
In this paper we experimentally evaluate the performance … [We focused on the most promising structures] splay trees and chained hash tables, also … considerable margin the most efficient. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: full-text indexing (35 items)
Topic: hash table and hash functions (41 items)