activity
20182025
most citedTechniques for Inverted Index Compression

70 citations · 190 across the 15 of their papers we have counts for

collaborators
Showing cs.IRShow all

6 papers · 1 filter

cs.IR2020★ 8 cited

Efficient and Effective Query Auto-Completion

Simon Gog, Giulio Ermanno Pibiri, Rossano Venturini

Query Auto-Completion (QAC) is an ubiquitous feature of modern textual search systems, suggesting possible ways of completing the query being typed by the user. Efficiency is cruci…

cs.IR2019★ 70 cited

Techniques for Inverted Index Compression

Giulio Ermanno Pibiri, Rossano Venturini

The data structure at the core of large-scale search engines is the inverted index, which is essentially a collection of sorted integer sequences called inverted lists. Because of…

cs.IR2019★ 3 cited

On Slicing Sorted Integer Sequences

Giulio Ermanno Pibiri

Representing sorted integer sequences in small space is a central problem for large-scale retrieval systems such as Web search engines. Efficient query resolution, e.g., intersecti…

cs.IR2019★ 28 cited

Compressed Indexes for Fast Search of Semantic Data

Raffaele Perego, Giulio Ermanno Pibiri, Rossano Venturini

The sheer increase in volume of RDF data demands efficient solutions for the triple indexing problem, that is devising a compressed data structure to compactly represent RDF triple…

cs.IR2018★ 26 cited

Handling Massive N-Gram Datasets Efficiently

Giulio Ermanno Pibiri, Rossano Venturini

This paper deals with the two fundamental problems concerning the handling of large n-gram language models: indexing, that is compressing the n-gram strings and associated satellit…

cs.IR2018★ 8 cited

On Optimally Partitioning Variable-Byte Codes

Giulio Ermanno Pibiri, Rossano Venturini

The ubiquitous Variable-Byte encoding is one of the fastest compressed representation for integer sequences. However, its compression ratio is usually not competitive with other mo…