Elsevier

Information Processing Letters

Volume 80, Issue 6, 31 December 2001, Pages 271-277
Information Processing Letters

In-memory hash tables for accumulating text vocabularies

https://doi.org/10.1016/S0020-0190(01)00239-3Get rights and content

First page preview

First page preview
Click to open first page preview

References (8)

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 Sciences
    Citation 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 Management
  • Defending Hash Tables from Subterfuge with Depth Charge

    2024, ACM International Conference Proceeding Series
  • Increase the Speed of Search Index in the Duplicate Text Detection Systems

    2020, 2020 Systems of Signal Synchronization, Generating and Processing in Telecommunications, SYNCHROINFO 2020
View all citing articles on Scopus
View full text