A Cache-Oblivious Implicit Dictionary with the Working Set Property

Abstract. In this paper we present an implicit dictionary with the working set property i.e. a dictionary supporting insert(e), delete(x) and predecessor(x) in O(log n) time and search(x) in O(log ) time, where n is the number of elements stored in the dictionary and is the number of distinct elements searched for since the element with key x was last searched for. The dictionary stores the elements in an array of size n using no additional space. In the cache-oblivious model the operations insert(e), delete(x) and predecessor(x) cause O(logB n) cache-misses and search(x) causes O(logB ) cache-misses.

• Type: Journal
• Year: 2010
• Where: ISAAC
• Authors: Gerth Stølting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen
• Keywords: Algorithms, Distinct Elements, Implicit Dictionary, ISAAC 2010, Working Set