Giorgio Vinciguerra

Giorgio Vinciguerra

Research Fellow (RTD-A)

Università di Pisa

I’m a Research Fellow (RTD-A) at the Department of Computer Science of the University of Pisa, where I am a member of the A³ Lab.

I received a PhD in Computer Science from the University of Pisa in 2022, under the supervision of Prof. Paolo Ferragina, with a thesis on Learning-based compressed data structures, that is, data structures that achieve new space-time trade-offs compared to traditional solutions by learning, in a rigorous and efficient algorithmic way, the regularities in the input data with tools from machine learning and computational geometry. The thesis was awarded the Best PhD thesis in Theoretical Computer Science by the Italian Chapter of the EATCS. During my PhD, I spent a research period at Harvard University, hosted by Prof. Stratos Idreos.

My research is supported by: the SoBigData.it project funded by the European Union - NextGenerationEU - Italy’s National Recovery and Resilience Plan (PNRR) and the SoBigData++ project funded by the European Union - Horizon 2020. In the past, I was supported by the Multicriteria data structures project funded by the Italian Ministry of University and Research.

Interests
  • Data structures
  • Data compression
  • Algorithm engineering
Education
  • PhD in Computer Science, 2018–21

    University of Pisa

  • MSc in Computer Science, 2016–18

    University of Pisa

  • BSc in Computer Science, 2013–16

    University of Pisa

Publications

(2024). Grafite: taming adversarial queries with optimal range filters. PACMMOD.

PDF Cite Code

(2024). CoCo-trie: data-aware compression and indexing of strings. Inf. Syst..

PDF Cite Code DOI

(2023). Engineering a textbook approach to index massive string dictionaries. SPIRE.

PDF Cite Code DOI

(2023). On nonlinear learned string indexing. IEEE Access.

PDF Cite Code Dataset DOI

(2023). Learned monotone minimal perfect hashing. ESA.

PDF Cite Code Slides DOI

(2022). Compressed string dictionaries via data-aware subtrie compaction. SPIRE.

PDF Cite Code DOI

(2022). A learned approach to design compressed rank/select data structures. ACM Trans. Algorithms.

PDF Cite Code DOI Experiments code & datasets

(2022). Learning-based compressed data structures. Ph.D. thesis.

PDF Cite

(2021). Repetition- and linearity-aware rank/select dictionaries. ISAAC.

PDF Cite Code Slides DOI

(2021). On the performance of learned data structures. Theor. Comput. Sci..

PDF Cite Code DOI

(2020). Why are learned indexes so effective?. ICML.

PDF Cite Code Slides Video

(2020). Learned data structures. Recent Trends in Learning From Data (Springer).

PDF Cite DOI

Talks

Learned monotone minimal perfect hashing
Advances in data-aware compressed-indexing schemes for integer and string keys
Learning-based approaches to compressed data structures design
Learning-based approaches to compressed data structures design
A rigorous approach to design learned data structures

Teaching & Supervision

Teacher:

Teaching assistant:

Co-supervised theses:

  • Marco Costa, Engineering data structures for the approximate range emptiness problem, MSc in Computer Science - ICT, 2022.
  • Mariagiovanna Rotundo, Compressed string dictionaries via Rear coding and succinct Patricia Tries, MSc in Computer Science - ICT, 2022.
  • Antonio Boffa, Spreading the learned approach to succinct data structures, MSc in Computer Science - ICT, 2020.
  • Alessio Russo, Learned index per i DB del futuro, BSc in Computer Science, 2020.
  • Lorenzo De Santis, On non-linear approaches for piecewise geometric model, MSc in Computer Science - AI, 2019.

Software

LeMonHash

LeMonHash

A monotone minimal perfect hash function that learns and leverages the data smoothness.

LZ$\phantom{}_{\boldsymbol\varepsilon}$

Compressed rank/select dictionary based on Lempel-Ziv and LA-vector compression.

LZ-End

Implementation of two LZ-End parsing algorithms.

PrefixPGM

Proof-of-concept extension of the PGM-index to support fixed-length strings.

RearCodedArray

Compressed string dictionary based on rear-coding.

Block-$\boldsymbol\varepsilon$ tree

Block-$\boldsymbol\varepsilon$ tree

Compressed rank/select dictionary exploiting approximate linearity and repetitiveness.

LA-vector

LA-vector

Compressed bitvector/container supporting efficient random access and rank queries.

PyGM

PyGM

Python library of sorted containers with state-of-the-art query performance and compressed memory usage.

PGM-index

PGM-index

Data structure enabling fast searches in arrays of billions of items using orders of magnitude less space than traditional indexes.

CSS-tree

CSS-tree

C++11 implementation of the Cache Sensitive Search tree.

NN Weaver

NN Weaver

Python library to build and train feedforward neural networks, with hyperparameters tuning capabilities.

Knowledge is like a sphere; the greater its volume, the larger its contact with the unknown.

― Blaise Pascal

Contact