An n H_k-compressed searchable partial-sums data structure for static sequences of sublogarithmic positive integers

04/17/2022
by   Travis Gagie, et al.
0

We consider the space needed to store a searchable partial-sums data structure with constant query time for a static sequence S of n positive integers in o ( log n/(loglog n)^2). Arroyuelo and Raman (2022) recently showed that such a structure can fit in n H_0 (S) + o (n) bits. Starting with Ferragina and Venturini's (2007) n H_k-compressed representation of strings that supports fast random access, and augmenting it with sublinear data structures reminiscent of those Raman, Raman and Rao (2002) used in their succinct bitvectors, we slightly improve Arroyuelo and Raman's bound to n H_k (S) + o (n) bits for k ∈ o ( log n/(loglog n)^2).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2019

Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space

The range-minimum query (RMQ) problem is a fundamental data structuring ...
research
10/16/2019

Tree-Shape Grammars for Random Access

Shape grammars are well known in the graphics and design communities but...
research
03/26/2020

Succinct Dynamic Ordered Sets with Random Access

The representation of a dynamic ordered set of n integer keys drawn from...
research
12/09/2020

Compressed Bounding Volume Hierarchies for Collision Detection Proximity Query

We present a novel representation of compressed data structure for simul...
research
09/04/2021

Fast Succinct Retrieval and Approximate Membership using Ribbon

A retrieval data structure for a static function f:S→{0,1}^r supports qu...
research
08/27/2019

Partial Sums on the Ultra-Wide Word RAM

We consider the classic partial sums problem on the ultra-wide word RAM ...
research
05/23/2023

Engineering Rank/Select Data Structures for Big-Alphabet Strings

Big-alphabet strings are common in several scenarios such as information...

Please sign up or login with your details

Forgot password? Click here to reset