Concurrency Control Protocol for Parallel B-Tree Structures That Improves the Efficiency of Request Transfers and SMOs within a Node

Many concurrency control protocols for B-trees use latch-coupling because its execution is efficient on a single machine. Some studies have indicated that latch-coupling may involve a performance bottleneck when using multicore processors in a shared-everything environment, but no studies have consi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEICE Transactions on Information and Systems 2018/01/01, Vol.E101.D(1), pp.152-170
Hauptverfasser:	YOSHIHARA, Tomohiro, KOBAYASHI, Dai, YOKOTA, Haruo
Format:	Artikel
Sprache:	eng
Schlagworte:	B trees Concurrency Concurrency control Consistency Coupling directory structures distributed databases Microprocessors transaction processing trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!