Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
From MaRDI portal
Publication:5307490
DOI10.1007/11780441_4zbMATH Open1144.68307OpenAlexW2124703955MaRDI QIDQ5307490FDOQ5307490
Authors: Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao 
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
Recommendations
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Compact rich-functional binary relation representations
- Compact binary relation representations with rich functionality
- Succinct indexes for strings, binary relations and multilabeled trees
- Succinct indexes for strings, binary relations and multi-labeled trees
Cited In (13)
- Compact rich-functional binary relation representations
- Title not available (Why is that?)
- Rank/select on dynamic compressed sequences and applications
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Optimal schema hierarchies in searching semistructured databases by conjunctive regular path queries
- Compact binary relation representations with rich functionality
- Succinct encoding of arbitrary graphs
- Self-indexed Text Compression Using Straight-Line Programs
- A succinct data structure for self-indexing ternary relations
- Succinct Representations of Arbitrary Graphs
- Self-adjusting trees in preactice for large text collections
- Search optimization in semistructured databases using hierarchy of document schemas
- Succinct Representation of Labeled Graphs
This page was built for publication: Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307490)
