
Parallel and ExternalMemory Construction of Minimal Perfect Hash Functions with PTHash
A minimal perfect hash function f for a set S of n keys is a bijective f...
read it

PTHash: Revisiting FCH Minimal Perfect Hashing
Given a set S of n distinct keys, a function f that bijectively maps the...
read it

Rank/Select Queries over Mutable Bitmaps
The problem of answering rank/select queries over a bitmap is of utmost ...
read it

Practical TradeOffs for the PrefixSum Problem
Given an integer array A, the prefixsum problem is to answer sum(i) que...
read it

Efficient and Effective Query AutoCompletion
Query AutoCompletion (QAC) is an ubiquitous feature of modern textual s...
read it

Succinct Dynamic Ordered Sets with Random Access
The representation of a dynamic ordered set of n integer keys drawn from...
read it

Techniques for Inverted Index Compression
The data structure at the core of largescale search engines is the inve...
read it

On Slicing Sorted Integer Sequences
Representing sorted integer sequences in small space is a central proble...
read it

Compressed Indexes for Fast Search of Semantic Data
The sheer increase in volume of RDF data demands efficient solutions for...
read it

Handling Massive NGram Datasets Efficiently
This paper deals with the two fundamental problems concerning the handli...
read it

VariableByte Encoding is Now SpaceEfficient Too
The ubiquitous VariableByte encoding is considered one of the fastest c...
read it
Giulio Ermanno Pibiri
is this you? claim profile