Ranked document retrieval for multiple patterns

DOI10.1016/j.tcs.2018.06.029zbMath1408.68052OpenAlexW2809416223WikidataQ129650522 ScholiaQ129650522MaRDI QIDQ1784746

Arnab Ganguly, Sharma V. Thankachan, Sudip Biswas, Rahul Shah

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

zbMATH Keywords

suffix arraysuffix treesuccinct encodingcompressed suffix arrayweighted ancestor query

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (4)

String indexing for top-\(k\) close consecutive occurrences ⋮ Gapped indexing for consecutive occurrences ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Ranked document selection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast set intersection and two-patterns matching
• New space/time tradeoffs for top-\(k\) document retrieval on sequences
• Bottom-\(k\) document retrieval
• Top-k Document Retrieval in External Memory
• Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees
• Forbidden Patterns
• Document Listing for Queries with Excluded Pattern
• Weighted Ancestors in Suffix Trees
• Ranked Document Retrieval with Forbidden Pattern
• Top-$$k$$ Term-Proximity in Succinct Space
• Compressed representations of sequences and full-text indexes
• Alphabet-Independent Compressed Text Indexing
• Space-Efficient Frameworks for Top- k String Retrieval
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Indexing compressed text
• Rank/select operations on large alphabets
• Algorithms on Strings, Trees and Sequences
• Efficient Storage and Retrieval by Content and Address of Static Files
• Higher Lower Bounds from the 3SUM Conjecture
• On Hardness of Several String Indexing Problems
• Space-Efficient Framework for Top-k String Retrieval Problems
• Optimal static range reporting in one dimension
• Spaces, Trees, and Colors
• Forbidden Extension Queries
• Succinct Indexes for Reporting Discriminating and Generic Words

This page was built for publication: Ranked document retrieval for multiple patterns