Dynamic Elias-Fano Representation

Pibiri G. E., Venturini R.

Integer sets  Predecessor problem  Succinct data structures  Computer Science  general works  Elias-Fano  000 Computer science  knowledge 

We show that it is possible to store a dynamic ordered set S(n,u) of n integers drawn from a bounded universe of size u in space close to the information-theoretic lower bound and yet preserve the asymptotic time optimality of the operations. Our results leverage on the Elias-Fano representation of S(n,u) which takes EF(S(n,u))=n?log(u/n)?+2n bits of space and can be shown to be less than half a bit per element away from the information-theoretic minimum. Considering a RAM model with memory words of ?(log u) bits, we focus on the case in which the integers of S are drawn from a polynomial universe of size u=n?, for any ?=?(1). We represent S(n,u) with EF(S(n,u))+o(n) bits of space and: 1. support static predecessor/successor queries in O(min{1+log(u/n),loglog n}); 2. make S grow in an append-only fashion by spending O(1) per inserted element; 3. support random access in O(log n/loglog n) worst-case, insertions/deletions in O(log n/loglog n) amortized and predecessor/successor queries in O(min{1+log(u/n),loglog n}) worst-case time. These time bounds are optimal.

Source: Annual Symposium on Combinatorial Pattern Matching, Varsavia, Polonia, 4-6/07/2017

Metrics