| 
|
Quote: use a recursive hash function to compute hash values for consecutive n-grams; up to 7 times faster than nonrecursive integer division; e.g. for indexing all character sequences in a document
topics >
all references >
references c-d >
Topic:
hash table and hash functions
Quotation Skeleton
Many indexing, retrieval, and comparison methods are based … [e.g., indexing the words (i.e., character n-grams) in a document]. The fastest method of implementing such operations is through the … function, in which the hash value of the … [p. 314] [Recursive] Hashing by both cyclic polynomials and … [up to 7.7 times faster than nonrecursive integer division]. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: hash table and hash functions (41 items)