Cache-oblivious dynamic dictionaries with update/query tradeoffs
Name
Demaine_Cache-oblivious.pdf
Size
253.71 KB
Format
Adobe PDF
Checksum (MD5)
64cbdaf4818aa52f64852ba8cc5e70f9
Author(s)
Brodal, Gerth Stolting
Demaine, Erik D.
Fineman, Jeremy T.
Iacono, John
Langerman, Stefan
Munro, J. Ian
Date Issued
January 2010
Journal
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010
Publisher
Society for Industrial and Applied Mathematics
Citation
Brodal, Gerth Stolting et al. "Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs." Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, Jan, 17-19, 2010, Hyatt Regency Austin, Austin, TX. Session 11C.
Version
Author's final manuscript
Abstract
Several existing cache-oblivious dynamic dictionaries
achieve O(logB N) (or slightly better O(logB
N over 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 (...) memory transfers.
This paper presents a new data structure, the xDict,
implementing predecessor queries in O(...)worstcase
memory transfers and insertions and deletions in
O (...) amortized memory transfers, for any constant " with 0 < epsilon < 1. For example, the xDict achieves subconstant amortized update cost when N = ..., whereas the B-tree’s ... is subconstant only when ... is subconstant only when N = .... The xDict attains the optimal tradeoff between insertions and queries, even in the broader external-memory model, for the range where inserts cost between (...) and O(1= lg3 N) memory transfers.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
http://www.siam.org/proceedings/soda/2010/SODA10_117_brodalg.pdf
