Purely top-down updating algorithms for stratified search trees (Q1057067): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Organization and maintenance of large ordered indexes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4057549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Binary Search Trees of Bounded Balance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3325056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 1-2 Brother Trees or AVL Trees Revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3686049 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stratified balanced search trees / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00290147 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2021476684 / rank | |||
Normal rank |
Latest revision as of 10:52, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Purely top-down updating algorithms for stratified search trees |
scientific article |
Statements
Purely top-down updating algorithms for stratified search trees (English)
0 references
1985
0 references
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.
0 references
binary search trees
0 references
purely top-down updating algorithms
0 references
stratified search trees
0 references
routing schemes
0 references