Space-efficient frameworks for top-k string retrieval
From MaRDI portal
Space-efficient frameworks for top-\(k\) string retrieval
Recommendations
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Towards an optimal space-and-query-time index for top-k document retrieval
- Top-k document retrieval in compact space and near-optimal time
- Improved single-term top-k document retrieval
- Top-\(k\) document retrieval in optimal time and linear space
Cites work
- A Fast Merging Algorithm
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms and data structures for external memory
- An optimal algorithm for selection in a min-heap
- Cache-oblivious algorithms
- Compressed representations of sequences and full-text indexes
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix trees with full functionality
- Dictionary matching and indexing with errors and don't cares
- Document listing for queries with excluded pattern
- Document listing on repetitive collections
- Efficient index for retrieving top-\(k\) most frequent documents
- Fast Pattern Matching in Strings
- Fast set intersection and two-patterns matching
- Faster compressed dictionary matching
- Fully-functional succinct trees
- Geometric BWT: compressed text indexing via sparse suffixes and range searching
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 2119651 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 756768 (Why is no real title available?)
- Improved compressed indexes for full-text document retrieval
- Indexes for document retrieval with relevance
- Indexing compressed text
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Low redundancy in static dictionaries with constant query time
- New algorithms on wavelet trees and applications to information retrieval
- On position restricted substring searching in succinct space
- Rank/select operations on large alphabets
- Sorted range reporting
- Space efficient suffix trees
- Space-Efficient Framework for Top-k String Retrieval Problems
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Succinct data structures for flexible text retrieval systems
- Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
- Suffix Arrays: A New Method for On-Line String Searches
- Time bounds for selection
- Top-\(K\) color queries for document retrieval
- Top-k document retrieval in compact space and near-optimal time
- Top-k document retrieval in external memory
- Top-k document retrieval in optimal space
- Top-\(k\) ranked document search in general text databases
- Towards an optimal space-and-query-time index for top-k document retrieval
Cited in
(21)- Space-efficient indexes for forbidden extension queries
- Ranked document retrieval for multiple patterns
- String indexing for top-\(k\) close consecutive occurrences
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
- Lempel-Ziv compressed structures for document retrieval
- Ranked document selection
- On hardness of several string indexing problems
- Top-k term-proximity in succinct space
- Faster repetition-aware compressed suffix trees based on block trees
- Gapped indexing for consecutive occurrences
- Indexes for document retrieval with relevance
- Document retrieval with one wildcard
- Ranked document retrieval with forbidden pattern
- Compact indexes for flexible top-k
- Time-optimal top-k document retrieval
- Succinct oblivious RAM
- Succinct indexes for reporting discriminating and generic words
- Ranked Document Retrieval in External Memory
- Faster repetition-aware compressed suffix trees based on block trees
- String indexing for top-\(k\) close consecutive occurrences
- Towards optimal set-disjointness and set-intersection data structures
This page was built for publication: Space-efficient frameworks for top-\(k\) string retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189644)
