Deleting keys of B-trees in parallel

DOI10.1016/J.JPDC.2004.06.005zbMath1072.68036OpenAlexW2080581595MaRDI QIDQ1886373

Yookun Cho, Heejin Park, Kun Soo Park

Publication date: 18 November 2004

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2004.06.005

zbMATH Keywords

Parallel algorithms\(B\)-treesBalanced search treesDictionary operations

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

This page was built for publication: Deleting keys of B-trees in parallel