scientific article; zbMATH DE number 7053336
From MaRDI portal
Publication:5743458
zbMath1422.68063MaRDI QIDQ5743458
Yakov Nekrich, Gonzalo Navarro
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095200
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Top-\(k\) term-proximity in succinct space ⋮ Document retrieval with one wildcard ⋮ Space-efficient indexes for forbidden extension queries ⋮ I/O-optimal categorical 3-sided skyline queries ⋮ Full-fledged real-time indexing for constant size alphabets ⋮ Ranked Document Retrieval with Forbidden Pattern ⋮ Compact Indexes for Flexible Top-$$k$$ Retrieval ⋮ Colored range queries and document retrieval ⋮ Ranked Document Retrieval in External Memory ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ On reporting the \(L_1\) metric closest pair in a query rectangle ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Lempel-Ziv compressed structures for document retrieval ⋮ Unnamed Item ⋮ Ranked document retrieval for multiple patterns ⋮ Ranked document selection ⋮ General Document Retrieval in Compact Space ⋮ Bottom-\(k\) document retrieval ⋮ Practical Compact Indexes for Top-kDocument Retrieval ⋮ Linear-space data structures for range frequency queries on arrays and trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colored range queries and document retrieval
- Efficient index for retrieving top-\(k\) most frequent documents
- Succinct data structures for flexible text retrieval systems
- Supporting random access in files of variable length records
- Improved compressed indexes for full-text document retrieval
- Compressed suffix trees with full functionality
- Rank and select revisited and extended
- General Document Retrieval in Compact Space
- Compressed representations of sequences and full-text indexes
- Alphabet-Independent Compressed Text Indexing
- Space-Efficient Data-Analysis Queries on Grids
- Space-Efficient Algorithms for Document Retrieval
- Dynamic ordered sets with exponential search trees
- Optimal Succinctness for Range Minimum Queries
- Compression, Indexing, and Retrieval for Massive String Data
- Top-k Ranked Document Search in General Text Databases
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
- Online Sorted Range Reporting
- Algorithms on Strings, Trees and Sequences
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Space-Efficient Framework for Top-k String Retrieval Problems
- Orthogonal range searching on the RAM, revisited
This page was built for publication:
