Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval

Retrieval data structures are data structures that answer key-value queries without paying the space overhead of explicitly storing keys. The problem can be formulated in four settings (static, value-dynamic, incremental, or dynamic), each of which offers different levels of dynamism to the user. In...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-10
Hauptverfasser:	Kuszmaul, William, Putterman, Aaron, Xu, Tingqiang, Zhou, Hangrui, Zhou, Renfei
Format:	Artikel
Sprache:	eng
Schlagworte:	Data structures Phase transitions Polynomials Redundancy Retrieval
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!