Practical Compact Indexes for Top-<i>k</i>Document Retrieval (Q5270942): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Succinct Trees in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved compressed indexes for full-text document retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing trees of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3588654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-k Ranked Document Search in General Text Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing compressed text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms on wavelet trees and applications to information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Single-Term Top-<i>k</i> Document Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient index for retrieving top-\(k\) most frequent documents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Framework for Top-k String Retrieval Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Position-Restricted Substring Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix Arrays: A New Method for On-Line String Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of software technology and theoretical computer science. 16th conference, Hyderabad, India, December 18--20, 1996. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Balanced Parentheses and Static Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spaces, Trees, and Colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed representations of sequences and full-text indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient data-analysis queries on grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Document Retrieval on Repetitive Collections / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Document Retrieval in Compact Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Functional Static and Dynamic Succinct Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Entropy-Compressed Rank/Select Dictionary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors / rank
 
Normal rank

Latest revision as of 01:28, 14 July 2024

scientific article; zbMATH DE number 6738465
Language Label Description Also known as
English
Practical Compact Indexes for Top-<i>k</i>Document Retrieval
scientific article; zbMATH DE number 6738465

    Statements

    Practical Compact Indexes for Top-<i>k</i>Document Retrieval (English)
    0 references
    0 references
    0 references
    0 references
    3 July 2017
    0 references
    compact data structure
    0 references
    top-\(k\) document retrieval
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers