• compressed data structures
• graph compression
• temporal graphs

This thesis aims at designing and engineering novel compression algorithms to store efficiently linked temporal data. In particular we focus on the model yielded by a specific kind of dynamic graphs which are temporal graphs. During the process we face several theoretic and implementative challenges: computing the probability distribution of how edges vary over time, choosing the right compressor, combinining the most suitable data structures present in the literature. Finally we provide a comparison between our solution and others already observed.