Indexes for Document Retrieval with Relevance
From MaRDI portal
Publication:2848984
DOI10.1007/978-3-642-40273-9_22zbMath1394.68127OpenAlexW2191209163MaRDI QIDQ2848984
Sharma V. Thankachan, Rahul Shah, Wing-Kai Hon, Manish Patil, Jeffrey Scott Vitter
Publication date: 13 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40273-9_22
Related Items
Document retrieval with one wildcard, Access, Rank, and Select in Grammar-compressed Strings, Space-Efficient Frameworks for Top- k String Retrieval, String indexing for top-\(k\) close consecutive occurrences, Ranked Document Retrieval in External Memory, Gapped indexing for consecutive occurrences, Ranked document selection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Top-\(k\) document retrieval in optimal space
- New algorithms on wavelet trees and applications to information retrieval
- Efficient index for retrieving top-\(k\) most frequent documents
- Fast set intersection and two-patterns matching
- Succinct data structures for flexible text retrieval systems
- Top-k Document Retrieval in External Memory
- Top-k Document Retrieval in Compact Space and Near-Optimal Time
- Forbidden Patterns
- Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
- Document Listing for Queries with Excluded Pattern
- Lower bounds for orthogonal range searching: I. The reporting case
- Space-Efficient Algorithms for Document Retrieval
- On Dominance Reporting in 3D
- Indexing compressed text
- Compression, Indexing, and Retrieval for Massive String Data
- Dictionary matching and indexing with errors and don't cares
- Top-k Ranked Document Search in General Text Databases
- Document Listing on Repetitive Collections
- Space-Efficient Framework for Top-k String Retrieval Problems
- Practical Compact Indexes for Top-kDocument Retrieval
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
