Self-adjusting trees in practice for large text collections

Software - Practice and Experience

Volumn 31, Issue 10, 2001, Pages 925-939

  Williams, Hugh E ^a   Zobel, Justin ^a   Heinz, Steffen ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

Randomized search trees; Self adjusting binary trees; Splay trees; Treaps; Vocabulary accumulation

Indexed keywords

AUTOMATIC INDEXING; DATA STRUCTURES; HEURISTIC PROGRAMMING; TREES (MATHEMATICS);

BINARY SEARCH TREES (BST); RANDOMIZED SEARCH TREES (RST);

TEXT PROCESSING;

EID: 0035421333     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/spe.394     Document Type: Article

References (26)

1. Self-adjusting binary search trees
2. Self-organizing data structures
3. How reliable are the results of large-scale information retrieval experiments?
4. Indexing and retrieval for genomic databases
5. Organization and maintenance of large ordered indices
6. Performance in practice of string hashing functions
7. Splay trees for data compression
8. Application of splay trees to data compression
9. Splaysort: Fast, versatile, practical
10. Self-adjusting multi-way search trees
11. Self-adjusting k-ary search trees
12. Randomized search trees
13. Randomized binary search trees
14. Randomized splay trees
15. Skip lists: A probabilistic alternative to balanced trees
16. Symmetric binary B-trees: Data structure and maintenance algorithms
17. A dichromatic framework for balanced trees
18. Expected length of the longest probe sequence in hash code searching
19. Overview of the second text retrieval conference (TREC-2)
20. Source models for natural language text
21. Remarks on choosing and implementing random number generators
22. An evaluation of self-adjusting binary search tree techniques
23. In-memory hash tables for accumulating text vocabularies