Cost-optimal parallel algorithms for constructing B-trees

DOI10.1016/0020-0255(94)90089-2zbMath0837.68044OpenAlexW1986998715MaRDI QIDQ1894244

Biing-Feng Wang, Gen-Huey Chen

Publication date: 10 August 1995

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/154704/1/28.pdf

zbMATH Keywords

\(B\)-treeEREW modelCREW modelshared-memory SIMD computer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05) Distributed algorithms (68W15)

Related Items (1)

Parallel construction of succinct trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree
• Organization and maintenance of large ordered indexes
• A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
• Derivation of a parallel algorithm for balancing binary trees
• Design and Analysis of a Data Structure for Representing Sorted Lists

This page was built for publication: Cost-optimal parallel algorithms for constructing B-trees