Sciweavers

Share
SODA
2010
ACM

Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs

11 years 2 min ago
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M is the memory size, and B is the block size, which matches the classic B-tree data structure. One recent structure achieves the same query bound and a sometimes-better amortized update bound of O 1 BΘ(1/(log log B)2) logB N + 1 B log2 N memory transfers. This paper presents a new data structure, the xDict, implementing predecessor queries in O(1 ε logB N M ) worstcase memory transfers and insertions and deletions in O 1 εB1−ε logB N M amortized memory transfers, for any
Gerth Stølting Brodal, Erik D. Demaine, Jer
Added 30 Jan 2011
Updated 30 Jan 2011
Type Journal
Year 2010
Where SODA
Authors Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro
Comments (0)
books