Purely top-down updating algorithms for stratified search trees
type: Item
instance of: scholarly article
title: Purely top-down updating algorithms for stratified search trees
zbMATH Open document ID: 0562.68054
DOI: 10.1007/BF00290147
author: Thomas Ottmann
author: Michael Schrapp
author: D. Wood
published in: Acta Informatica
publication date: 1985-01-01T00:00:00Z
review text: The problem studied is the problem of existence of purely top-down updating algorithms for search trees. The authors present such algorithms for internal- and external-search trees in the framework of stratified search trees. In the case of external-search trees four routing schemes are considered: the left-maximum scheme, the right-maximum scheme, the \((\leq,<)\) scheme and the \((<,<)\) scheme.
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 3896321
zbMATH Keywords: binary search trees
zbMATH Keywords: purely top-down updating algorithms
zbMATH Keywords: stratified search trees
zbMATH Keywords: routing schemes
reviewed by: Giora Slutzki
MaRDI profile type: Publication
cites work: Q4091421
cites work: Organization and maintenance of large ordered indexes
cites work: Q4057549
cites work: Binary Search Trees of Bounded Balance
cites work: Q3325056
cites work: 1-2 Brother Trees or AVL Trees Revisited
cites work: Q3686049
cites work: Stratified balanced search trees
full work available at URL: https://doi.org/10.1007/bf00290147
OpenAlex ID: W2021476684
description: scientific article; zbMATH DE number 3896321