Self‐adjusting trees in practice for large text collections

DOI10.1002/SPE.394zbMath0990.68562OpenAlexW2166917980MaRDI QIDQ2745223

Hugh E. Williams, Justin Zobel, Steffen Heinz

Publication date: 10 October 2001

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.394

zbMATH Keywords

splay treesrandomized search trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99)

Related Items (1)

A priority queue with the time-finger property

Cites Work

• Unnamed Item
• Self-adjusting multi-way search trees
• Randomized search trees
• Organization and maintenance of large ordered indexes
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Self-adjusting binary search trees
• Randomized binary search trees
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• Self-Adjusting k-ary Search Trees

This page was built for publication: Self‐adjusting trees in practice for large text collections