Dynamic Packed Compact Tries Revisited

04/16/2019
by   Kazuya Tsuruta, et al.
0

Given a dynamic set K of k strings of total length n whose characters are drawn from an alphabet of size σ, a keyword dictionary is a data structure built on K that provides locate, prefix search, and update operations on K. Under the assumption that α = _σ n characters fit into a single machine word w, we propose a keyword dictionary that represents K in n σ + O(k w) bits of space, supporting all operations in O(m / α + α) expected time on an input string of length m in the word RAM model. This data structure is underlined with an exhaustive practical evaluation, highlighting the practical usefulness of the proposed data structure.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2018

Fast entropy-bounded string dictionary look-up with mismatches

We revisit the fundamental problem of dictionary look-up with mismatches...
research
08/04/2020

A Data-Structure for Approximate Longest Common Subsequence of A Set of Strings

Given a set of k strings I, their longest common subsequence (LCS) is th...
research
06/14/2019

Dynamic Path-Decomposed Tries

A keyword dictionary is an associative array whose keys are strings. Rec...
research
11/02/2017

An Optimal Choice Dictionary

A choice dictionary is a data structure that can be initialized with a p...
research
01/27/2022

Predecessor on the Ultra-Wide Word RAM

We consider the predecessor problem on the ultra-wide word RAM model of ...
research
01/29/2019

Simulating the DNA String Graph in Succinct Space

Converting a set of sequencing reads into a lossless compact data struct...
research
09/20/2018

Small Uncolored and Colored Choice Dictionaries

A choice dictionary can be initialized with a parameter n∈N and subseque...

Please sign up or login with your details

Forgot password? Click here to reset