Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
From MaRDI portal
Publication:5307490
DOI10.1007/11780441_4zbMath1144.68307MaRDI QIDQ5307490
J. Ian Munro, S. Srinivasa Rao, Jérémy Barbay, Alexander Golynski
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
intersection problem; labeled trees; conjunctive queries; succinct data structures; multi-labeled trees
Related Items
Succinct Representation of Labeled Graphs, Rank/select on dynamic compressed sequences and applications, Self-indexed Text Compression Using Straight-Line Programs, Succinct Representations of Arbitrary Graphs