Crystal
Compressed execution approach for distributed subgraph matching on very large graphs.
Crystal is a method for distributed subgraph matching on very large graphs that computes compressed results directly instead of materializing large intermediate outputs.
Its main contribution was reducing both computation cost and result-materialization overhead for expensive graph pattern queries in distributed environments.
Links: Code ยท VLDB 2018 paper