Purely top-down updating algorithms for stratified search trees

DOI10.1007/BF00290147zbMath0562.68054OpenAlexW2021476684MaRDI QIDQ1057067

Derick Wood, Michael Schrapp, Thomas Ottmann

Publication date: 1985

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00290147

zbMATH Keywords

binary search treesrouting schemespurely top-down updating algorithmsstratified search trees

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (1)

Relaxed avl trees, main-memory databases and concurrency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stratified balanced search trees
• Organization and maintenance of large ordered indexes
• 1-2 Brother Trees or AVL Trees Revisited
• Binary Search Trees of Bounded Balance

This page was built for publication: Purely top-down updating algorithms for stratified search trees