Succinct data structures for flexible text retrieval systems
From MaRDI portal
Publication:924538
DOI10.1016/j.jda.2006.03.011zbMath1137.68360OpenAlexW2014318353MaRDI QIDQ924538
Publication date: 16 May 2008
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2006.03.011
Pattern recognition, speech recognition (68T10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (49)
On succinct representations of binary trees ⋮ Document retrieval with one wildcard ⋮ Two dimensional range minimum queries and Fibonacci lattices ⋮ Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max ⋮ Less space: indexing for queries with wildcards ⋮ Document listing on repetitive collections with guaranteed performance ⋮ Faster index for property matching ⋮ Space-Efficient Frameworks for Top- k String Retrieval ⋮ Simultaneous encodings for range and next/previous larger/smaller value queries ⋮ Improved range minimum queries ⋮ The range 1 query (R1Q) problem ⋮ Succinct encodings for families of interval graphs ⋮ Range Minimum Query Indexes in Higher Dimensions ⋮ Compact Indexes for Flexible Top-$$k$$ Retrieval ⋮ Colored range queries and document retrieval ⋮ Top-\(k\) document retrieval in optimal space ⋮ Multi-pattern matching with bidirectional indexes ⋮ Cross-document pattern matching ⋮ Efficient algorithms for three variants of the LPF table ⋮ Cache oblivious algorithms for the RMQ and the RMSQ problems ⋮ Finding range minima in the middle: approximations and applications ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Space-efficient data structure for next/previous larger/smaller value queries ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Improved algorithms for the range next value problem and applications ⋮ Improved space-time tradeoffs for approximate full-text indexing with one edit error ⋮ A simple linear-space data structure for constant-time range minimum query ⋮ Succinct indexes for reporting discriminating and generic words ⋮ Counting Colours in Compressed Strings ⋮ Efficient Seeds Computation Revisited ⋮ On space efficient two dimensional range minimum data structures ⋮ Linear-space data structures for range mode query in arrays ⋮ Spaces, Trees, and Colors ⋮ A simple algorithm for computing the document array ⋮ Optimal prefix and suffix queries on texts ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Lempel-Ziv compressed structures for document retrieval ⋮ Unnamed Item ⋮ Errata for ``Faster index for property matching ⋮ Range majorities and minorities in arrays ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ General Document Retrieval in Compact Space ⋮ Faster entropy-bounded compressed suffix trees ⋮ Range minimum queries in minimal space ⋮ Orthogonal Range Searching for Text Indexing ⋮ Indexes for Document Retrieval with Relevance ⋮ Unnamed Item ⋮ Improved and extended locating functionality on compressed suffix arrays ⋮ Bottom-\(k\) document retrieval
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Space Efficient Suffix Trees
- Succinct Representation of Balanced Parentheses and Static Trees
- Suffix Arrays: A New Method for On-Line String Searches
- Indexing compressed text
- A vector space model for automatic indexing
- Algorithms on Strings, Trees and Sequences
- New text indexing functionalities of the compressed suffix arrays
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Complete inverted files for efficient text retrieval and analysis
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
This page was built for publication: Succinct data structures for flexible text retrieval systems
