Fringe Analysis of 2-3 Trees with Lazy Parent Split

B-trees with lazy parent split (lps) are B-tree variants, according to which parent splits are postponed until a future access of the latter node. This way, the number of splits during an insert is decreased and the number of locks is also decreased. Consequently, better concurrency is achieved. In...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computer journal 2000-01, Vol.43 (5), p.420-429
Hauptverfasser:	Manousaka, Antigoni, Manolopoulos, Yannis
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Business metrics Children & youth Leaves Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!