Ranked document retrieval for multiple patterns
From MaRDI portal
Publication:1784746
DOI10.1016/J.TCS.2018.06.029zbMATH Open1408.68052OpenAlexW2809416223WikidataQ129650522 ScholiaQ129650522MaRDI QIDQ1784746FDOQ1784746
Authors: Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan 
Publication date: 27 September 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.06.029
Recommendations
Cites Work
- Introduction to algorithms
- Algorithms on Strings, Trees and Sequences
- Linear-space data structures for range frequency queries on arrays and trees
- Compressed representations of sequences and full-text indexes
- Indexing compressed text
- Efficient Storage and Retrieval by Content and Address of Static Files
- Title not available (Why is that?)
- Space-Efficient Framework for Top-k String Retrieval Problems
- Fully-functional succinct trees
- Top-\(k\) document retrieval in optimal time and linear space
- Top-\(k\) document retrieval in external memory
- Forbidden patterns
- Document listing for queries with excluded pattern
- Alphabet-independent compressed text indexing
- Space-efficient frameworks for top-\(k\) string retrieval
- Optimal static range reporting in one dimension
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Fast set intersection and two-patterns matching
- Weighted ancestors in suffix trees
- Rank/select operations on large alphabets
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Succinct indexes for reporting discriminating and generic words
- Ranked document retrieval with forbidden pattern
- Top-\(k\) term-proximity in succinct space
- On Hardness of Several String Indexing Problems
- Forbidden Extension Queries
- Bottom-\(k\) document retrieval
- Higher lower bounds from the 3SUM conjecture
- Data structure lower bounds for document indexing problems
Cited In (13)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
- On hardness of several string indexing problems
- Top-\(k\) ranked document search in general text databases
- Ranked Document Retrieval in External Memory
- Cross-document pattern matching
- Ranked document retrieval with forbidden pattern
- String indexing for top-\(k\) close consecutive occurrences
- Forbidden patterns
- Document listing for queries with excluded pattern
- Ranked document selection
- Indexes for document retrieval with relevance
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Gapped indexing for consecutive occurrences
This page was built for publication: Ranked document retrieval for multiple patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784746)
