Optimal cache-oblivious implicit dictionaries

Authors:
Gianni Franceschini;Roberto Grossi
Affiliations:
Dipartimento di Informatica, Università di Pisa, Pisa, Italy;Dipartimento di Informatica, Università di Pisa, Pisa, Italy
Venue:
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Year:
2003

Citing 16
Cited 6

Storing a Sparse Table with 0(1) Worst Case Access Time

Journal of the ACM (JACM)
An implicit data structure supporting insertion, deletion, and search in O(log:OS2:OEn) time

Journal of Computer and System Sciences
Nonoblivious hashing

Journal of the ACM (JACM)
Implicit Data Structures for the Dictionary Problem

Journal of the ACM (JACM)
Membership in Constant Time and Almost-Minimum Space

SIAM Journal on Computing
Algorithm 245: Treesort

Communications of the ACM
A locality-preserving cache-oblivious dynamic dictionary

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Cache oblivious search trees via binary trees of small height

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Low Redundancy in Static Dictionaries with Constant Query Time

SIAM Journal on Computing
Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Implicit B-Trees: New Results for the Dictionary Problem

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A Sparse Table Implementation of Priority Queues

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Exponential Structures for Efficient Cache-Oblivious Algorithms

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Cache-oblivious B-trees

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science

Proximity Mergesort: optimal in-place sorting in the cache-oblivious model

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Implicit B-trees: a new data structure for the dictionary problem

Journal of Computer and System Sciences - Special issue on FOCS 2002
A locality-preserving cache-oblivious dynamic dictionary

Journal of Algorithms
Engineering a cache-oblivious sorting algorithm

Journal of Experimental Algorithmics (JEA)
A compact data structure for representing a dynamic multiset

Information Processing Letters
Sorting stably, in-place, with O(n log n) comparisons and O(n) moves

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this paper is that of closing the longstanding open problem about the existence of an optimal implicit dictionary over an unbounded universe. Another finding is motivated by the antithetic features of implicit and cache-oblivious models in data structures. We show how to blend their best qualities achieving O(log n) time and O(logB n) block transfers for searching and for amortized updating, while using just n memory cells like sorted arrays and heaps. As a result, we avoid space wasting and provide fast data access at any level of the memory hierarchy.