Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents

DOI10.1007/11780441_4zbMath1144.68307OpenAlexW2124703955MaRDI QIDQ5307490

Alexander Golynski, S. Srinivasa Rao, Jérémy Barbay, J. Ian Munro

Publication date: 14 September 2007

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780441_4

zbMATH Keywords

intersection problemlabeled treesconjunctive queriessuccinct data structuresmulti-labeled trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Data structures (68P05)

Related Items (5)

Self-indexed Text Compression Using Straight-Line Programs ⋮ Succinct encoding of arbitrary graphs ⋮ Succinct Representations of Arbitrary Graphs ⋮ Succinct Representation of Labeled Graphs ⋮ Rank/select on dynamic compressed sequences and applications

This page was built for publication: Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents