We work on optimal representations for archiving evolving linked data, minimizing inherent redundancy of archives.
We investigate on specific query languages aimed at capturing the required expressiveness for these archives, and benchmarking systems to measure the performance of RDF archives.
We research on compressed indexes of evolving linked data archives scaling up to large volumes of data while serving retrieval opperations without prior decompression.