• Cite Icon2
  • https://doi.org/10.1007/s00453-021-00869-wCopy DOI Icon

Top Tree Compression of Tries

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We present a compressed representation of tries based on top tree compression [ICALP 2013] that works on a standard, comparison-based, pointer machine model of computation and supports efficient prefix search queries. Namely, we show how to preprocess a set of strings of total length n over an alphabet of size \(\sigma\) into a compressed data structure of worst-case optimal size \(O(n/\log _\sigma n)\) that given a pattern string P of length m determines if P is a prefix of one of the strings in time \(O(\min (m\log \sigma ,m + \log n))\). We show that this query time is in fact optimal regardless of the size of the data structure. Existing solutions either use \(\Omega (n)\) space or rely on word RAM techniques, such as tabulation, hashing, address arithmetic, or word-level parallelism, and hence do not work on a pointer machine. Our result is the first solution on a pointer machine that achieves worst-case o(n) space. Along the way, we develop several interesting data structures that work on a pointer machine and are of independent interest. These include an optimal data structures for random access to a grammar-compressed string and an optimal data structure for a variant of the level ancestor problem.

Similar Papers
  • Research Article
  • Citations12

Preprocess, Set, Query!

  • Aug 28, 2013
  • Algorithmica
  • Ely Porat +1
  • PDF
  • Research Article
  • Citations4

Data structures for categorical path counting queries

  • Oct 13, 2022
  • Theoretical Computer Science
  • Meng He +1
  • Research Article
  • Citations56

Towards optimal range medians

  • May 11, 2010
  • Theoretical Computer Science
  • Gerth Stølting Brodal +3
  • Research Article
  • Citations13

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing

  • Jan 01, 2017
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Takuya Takagi +3
  • Book Chapter
  • Citations15

On Space Efficient Two Dimensional Range Minimum Data Structures

  • Jan 01, 2010
  • Gerth Stølting Brodal +2
  • Conference Article
  • Citations29

Wavelet trees meet suffix trees

  • May 15, 2015
  • Maxim A Babenko +3
  • PDF
  • Research Article
  • Citations4

Sliding Suffix Tree

  • Aug 03, 2018
  • Algorithms
  • Andrej Brodnik +1
  • Research Article
  • Citations12

Optimal finger search trees in the pointer machine

  • May 06, 2003
  • Journal of Computer and System Sciences
  • Gerth Stølting Brodal +4
  • Conference Article
  • Citations54

Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors

  • Jan 01, 2017
  • Alexandr Andoni +3
  • Conference Article
  • Citations8

Further results on colored range searching

  • Jul 02, 2020
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Timothy M Chan +2
  • Conference Article

A Case Study in Obtaining Freedom from Interference in a Mixed-ASIL Architecture

  • Jan 23, 2023
  • Antonio Arena +3
  • Book Chapter
  • Citations24

Efficiency of Uniform Grids for Intersection Detection on Serial and Parallel Machines

  • Jan 01, 1988
  • Wm R Franklin +4
  • Conference Article
  • Citations6

Nearly optimal static Las Vegas succinct dictionary

  • Jun 22, 2020
  • Huacheng Yu
  • Research Article
  • Citations172

Lower bounds for orthogonal range searching: I. The reporting case

  • Apr 01, 1990
  • Journal of the ACM
  • Bernard Chazelle
  • Conference Article
  • Citations75

Efficient searching with linear constraints

  • May 01, 1998
  • Pankaj K Agarwal +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.