In-memory hash tables for accumulating text vocabularies
References (8)
Overview of the Second Text Retrieval Conference (TREC-2)
Inform. Process. Management
(1995)- et al.
Source models for natural language text
Internat. J. Man Machine Studies
(1990) - et al.
Fast algorithms for sorting and searching strings
- et al.
A study of index structures for main memory database management systems
There are more references available in the full text version of this article.
Cited by (41)
Minimal perfect hashing: A competitive method for indexing internal memory
2011, Information SciencesCitation Excerpt :For instance, in a lookup operation, each traversed link can trigger a cache miss, which costs several CPU cycles in modern processors. Zobel, Heinz and Williams [44] addressed this problem by designing a move-to-front heuristic in the lists. In this case, whenever an item is accessed it is moved to the front of the linked list.
Efficient online index maintenance for contiguous inverted lists
2006, Information Processing and ManagementDefending Hash Tables from Subterfuge with Depth Charge
2024, ACM International Conference Proceeding SeriesPrincipal Word Vectors
2020, arXivIncrease the Speed of Search Index in the Duplicate Text Detection Systems
2020, 2020 Systems of Signal Synchronization, Generating and Processing in Telecommunications, SYNCHROINFO 2020
Copyright © 2001 Elsevier Science B.V. All rights reserved.