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

Full description

Bibliographic Details
Main Authors: Brodal, Gerth Stolting, Demaine, Erik D., Fineman, Jeremy T., Iacono, John, Langerman, Stefan, Munro, J. Ian
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Society for Industrial and Applied Mathematics 2011
Online Access:http://hdl.handle.net/1721.1/62807
https://orcid.org/0000-0003-3803-5703

Internet

http://hdl.handle.net/1721.1/62807
https://orcid.org/0000-0003-3803-5703

Similar Items