Purely top-down updating algorithms for stratified search trees
From MaRDI portal
(Redirected from Publication:1057067)
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.
Recommendations
Cites work
- 1-2 Brother Trees or AVL Trees Revisited
- Binary Search Trees of Bounded Balance
- scientific article; zbMATH DE number 3856424 (Why is no real title available?)
- scientific article; zbMATH DE number 3909752 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Organization and maintenance of large ordered indexes
- Stratified balanced search trees
Cited in
(4)
This page was built for publication: Purely top-down updating algorithms for stratified search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1057067)