Bottom-\(k\) document retrieval

DOI10.1016/J.JDA.2014.12.009zbMath1328.68057OpenAlexW2030053501MaRDI QIDQ2343302

Sharma V. Thankachan, Gonzalo Navarro

Publication date: 4 May 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2014.12.009

zbMATH Keywords

document retrievalcompact data structuresstring collections

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)

Related Items (2)

Ranked Document Retrieval with Forbidden Pattern ⋮ Ranked document retrieval for multiple patterns

Uses Software

• Wumpus

Cites Work

• Unnamed Item
• Unnamed Item
• Colored range queries and document retrieval
• Top-\(k\) document retrieval in optimal space
• Succinct data structures for flexible text retrieval systems
• Improved compressed indexes for full-text document retrieval
• Top-k Document Retrieval in External Memory
• Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees
• Top-k Document Retrieval in Compact Space and Near-Optimal Time
• Forbidden Patterns
• Linear-Space Data Structures for Range Minority Query in Arrays
• Compressed representations of sequences and full-text indexes
• Suffix Arrays: A New Method for On-Line String Searches
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Space-Efficient Framework for Top-k String Retrieval Problems
• Spaces, Trees, and Colors

This page was built for publication: Bottom-\(k\) document retrieval