Please note: This seminar will take place in DC 2568 and online.
Karthik C. S., Assistant Professor
Department of Computer Science, Rutgers University
The speed of algorithms on massive graphs depends on the size of the given data. Grammar-based compression is a technique to compress the size of a graph while still allowing to read or to modify the graph with a little time overhead. When data access methods to compressed data are chosen carefully, the speed-up gained by data size reduction significantly predominates the time overhead needed to partially uncompress compressed data.
The talk gives an overview of the key ideas behind grammar-based compression for large graphs and shows how to apply graph compression to graph databases. Furthermore, it introduces recompression as a fast technique to keep compressed graphs small when they are frequently modified.
To attend this seminar in person, please go to DC 2568. You can also attend virtually using Zoom.