272 citations · 458 across the 8 of their papers we have counts for
8 papers
Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search
Daniel Severo, Giuseppe Ottaviano, Matthew Muckley +2
Approximate nearest neighbor search for vectors relies on indexes that are most often accessed from RAM. Therefore, storage is the factor limiting the size of the database that can…
Autoregressive Search Engines: Generating Substrings as Document Identifiers
Michele Bevilacqua, Giuseppe Ottaviano, Patrick Lewis +3
Knowledge-intensive language tasks require NLP systems to both provide the correct answer and retrieve supporting evidence for it in a given corpus. Autoregressive language models…
Embedding-based Retrieval in Facebook Search
Jui-Ting Huang, Ashish Sharma, Shuying Sun +6
Search in social networks such as Facebook poses different challenges than in classical web search: besides the query text, it is important to take into account the searcher's cont…
Fast Scalable Construction of (Minimal Perfect Hash) Functions
Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna
Recent advances in random linear systems on finite fields have paved the way for the construction of constant-time data structures representing static functions and minimal perfect…
Compressing Graphs and Indexes with Recursive Graph Bisection
Laxman Dhulipala, Igor Kabiljo, Brian Karrer +3
Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be…
Cache-Oblivious Peeling of Random Hypergraphs
Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano +2
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 -SAT…
The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space
Roberto Grossi, Giuseppe Ottaviano
An indexed sequence of strings is a data structure for storing a string sequence that supports random access, searching, range counting and analytics operations, both for exact mat…
Fast Compressed Tries through Path Decompositions
Roberto Grossi, Giuseppe Ottaviano
Tries are popular data structures for storing a set of strings, where common prefixes are represented by common root-to-node paths. Over fifty years of usage have produced many var…