Giorgio Vinciguerra

Giorgio Vinciguerra

Research Fellow

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.

In 2022, I received a Ph.D. in Computer Science from the University of Pisa 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 Ph.D. thesis in Theoretical Computer Science by the Italian Chapter of the European Association for Theoretical Computer Science.

My research falls under the project funded through the Italian National Recovery and Resilience Plan (PNRR) supported by the European NextGenerationEU programme, the Multicriteria data structures project funded by the Italian Ministry of University and Research, and the SoBigData++ European H2020 project.

  • Compact data structures
  • Algorithm engineering
  • Data compression
  • Ph.D. in Computer Science, 2018–21

    University of Pisa

  • M.Sc. in Computer Science, 2016–18

    University of Pisa

  • B.Sc. in Computer Science, 2013–16

    University of Pisa


(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).




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


Implementation of two LZ-End parsing algorithms.


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


Compressed string dictionary based on rear-coding.

Block-$\boldsymbol\varepsilon$ tree

Block-$\boldsymbol\varepsilon$ tree

Compressed rank/select dictionary exploiting approximate linearity and repetitiveness.



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



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



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



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.


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
The design of learning-based compressed data structures

Teaching & Supervision

Teaching assistant for:

I co-supervised these 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.

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

― Blaise Pascal