Atomic-key B-trees

Authors

  • Adam Drozdek
  • Dušica Vujanović

Abstract

Atomic-key B-trees are B-trees with keys of different sizes. This note presents two versions of an insertion algorithm and a deletion algorithm for atomic-key B-trees.

Downloads

Download data is not yet available.
Cover of Studia Informatica Journal

Downloads

Published

2019-05-07

How to Cite

Drozdek, A., & Vujanović, D. (2019). Atomic-key B-trees. Studia Informatica. System and Information Technology, 19(1-2), 15–26. Retrieved from https://czasopisma.uph.edu.pl/studiainformatica/article/view/229

Issue

Vol. 19 No. 1-2 (2015): Studia Informatica. Systems and Information Technology

Section

Article