Cost-optimal parallel algorithms for constructing B-trees (Q1894244): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4773298 / 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: Design and Analysis of a Data Structure for Representing Sorted Lists / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3853109 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Derivation of a parallel algorithm for balancing binary trees / rank | |||
Normal rank |
Latest revision as of 15:49, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cost-optimal parallel algorithms for constructing B-trees |
scientific article |
Statements
Cost-optimal parallel algorithms for constructing B-trees (English)
0 references
10 August 1995
0 references
\(B\)-tree
0 references
shared-memory SIMD computer
0 references
EREW model
0 references
CREW model
0 references
0 references