In-memory hash tables for accumulating text vocabularies

Information Processing Letters

Volumn 80, Issue 6, 2001, Pages 271-277

  Zobel, J ^a   Heinz, S ^a   Williams, H E ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

Data structures; Hashing; Index construction; Splay trees; Text databases

Indexed keywords

CACHE MEMORY; DATA PROCESSING; INDEXING (OF INFORMATION); PERSONAL COMPUTERS; RANDOM ACCESS STORAGE; TREES (MATHEMATICS); WEBSITES;

MEMORY MANAGEMENT;

DATA STRUCTURES;

EID: 0035980876     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00239-3     Document Type: Article

References (8)

1. Fast algorithms for sorting and searching strings
2. Overview of the Second Text Retrieval Conference (TREC-2)
3. A study of index structures for main memory database management systems
4. Skip lists: A probabilistic alternative to balanced trees
5. Performance in practice of string hashing functions
6. Source models for natural language text