Extra Space during Initialization of Succinct Data Structures and of Dynamical Initializable Arrays

03/26/2018
by   Frank Kammer, et al.
0

Many succinct data structures on a word RAM require precomputed tables to start operating. Usually, the tables can be constructed in sublinear time. In this time, most of the data structure is not initialized, i.e., there is plenty of unused space allocated for the data structure. We present a general framework to store temporary extra buffers between the real data so that data can be processed immediately, stored first in the buffers and then moved into the real data structure after finishing the tables. As a further application of our temporary extra buffers, we present an in-place dynamical initializable array.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/26/2018

Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays

Many succinct data structures on the word RAM require precomputed tables...
research
07/02/2023

What if we tried Less Power? – Lessons from studying the power of choices in hashing-based data structures

In the first part of this survey, we review how the power of two choices...
research
11/01/2017

Fast Dynamic Arrays

We present a highly optimized implementation of tiered vectors, a data s...
research
02/24/2021

AwkwardForth: accelerating Uproot with an internal DSL

File formats for generic data structures, such as ROOT, Avro, and Parque...
research
10/11/2021

Efficient Extensional Binary Tries

Lookup tables (finite maps) are a ubiquitous data structure. In pure fun...
research
05/25/2019

Robotic bees: Algorithms for collision detection and prevention

In the following paper we will discuss data structures suited for distan...
research
06/26/2023

Prefix-free graphs and suffix array construction in sublinear space

A recent paradigm shift in bioinformatics from a single reference genome...

Please sign up or login with your details

Forgot password? Click here to reset