Cache-oblivious dynamic dictionaries with update/query tradeoffs

Cache-oblivious dynamic dictionaries with update/query tradeoffs

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 a...

Full description

Bibliographic Details
Main Authors: Brodal, Gerth Stolting (Author), Demaine, Erik D. (Contributor), Fineman, Jeremy T. (Contributor), Iacono, John (Author), Langerman, Stefan (Author), Munro, J. Ian (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Society for Industrial and Applied Mathematics, 2011-05-10T19:22:51Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items