Root-to-Leaf Scheduling in Write-Optimized Trees

Write-optimized dictionaries are a class of cache-efficient data structures that buffer updates and apply them in batches to optimize the amortized cache misses per update. For example, a B^epsilon tree inserts updates as messages at the root. B^epsilon trees only move ("flush") messages w...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Chung, Christopher, Jannen, William, McCauley, Samuel, Simon, Bertrand
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!