Search Results for author: Rossano Venturini

Found 11 papers, 10 papers with code

Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations

1 code implementation29 Apr 2024 Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli, Rossano Venturini

In this work, we propose a novel organization of the inverted index that enables fast yet effective approximate retrieval over learned sparse embeddings.

Retrieval Text Retrieval

Efficient Multi-Vector Dense Retrieval Using Bit Vectors

1 code implementation3 Apr 2024 Franco Maria Nardini, Cosimo Rulli, Rossano Venturini

This paper proposes ``Efficient Multi-Vector dense retrieval with Bit vectors'' (EMVB), a novel framework for efficient query processing in multi-vector dense retrieval.

Quantization Retrieval

An Optimal Algorithm for Finding Champions in Tournament Graphs

1 code implementation26 Nov 2021 Lorenzo Beretta, Franco Maria Nardini, Roberto Trani, Rossano Venturini

In this paper, we address the problem of finding a champion of the tournament, also known as Copeland winner, which is a player that wins the highest number of matches.

Conversational Search Information Retrieval +4

Efficient and Effective Query Auto-Completion

1 code implementation13 May 2020 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.

Techniques for Inverted Index Compression

2 code implementations28 Aug 2019 Giulio Ermanno Pibiri, Rossano Venturini

The aim of this article is twofold: first, surveying the encoding algorithms suitable for inverted index compression and, second, characterizing the performance of the inverted index through experimentation.

Compressed Indexes for Fast Search of Semantic Data

1 code implementation16 Apr 2019 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 triples by guaranteeing, at the same time, fast pattern matching operations.

Handling Massive N-Gram Datasets Efficiently

1 code implementation25 Jun 2018 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 satellite data without compromising their retrieval speed; and estimation, that is computing the probability distribution of the strings from a large textual source.

Language Modelling Retrieval

On Optimally Partitioning Variable-Byte Codes

1 code implementation29 Apr 2018 Giulio Ermanno Pibiri, Rossano Venturini

The ubiquitous Variable-Byte encoding is one of the fastest compressed representation for integer sequences.

Cache-Oblivious Peeling of Random Hypergraphs

1 code implementation2 Dec 2013 Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano, Rossano Venturini, Sebastiano Vigna

The computation of a peeling order in a randomly generated hypergraph is the most time-consuming step in a number of constructions, such as perfect hashing schemes, random $r$-SAT solvers, error-correcting codes, and approximate set encodings.

Data Structures and Algorithms

Compressed Text Indexes:From Theory to Practice!

6 code implementations20 Dec 2007 Paolo Ferragina, Rodrigo Gonzalez, Gonzalo Navarro, Rossano Venturini

A compressed full-text self-index represents a text in a compressed form and still answers queries efficiently.

Data Structures and Algorithms F.2.2; H.2.1; H.3.2; H.3.3

Cannot find the paper you are looking for? You can Submit a new open access paper.