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.











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)