Property Graphs

NScale

Presented by Diptanshu
Queries over subgraphs
Extraction of subgraphs: Predicate, k-radius, neighbors, edge/vert attributes
Vertices and edges in a subgraph can be replicated so that whole subgraph present in a local partition. Only one subgraph owns a replicated vertex/edge, and can modify it.
Bin packing of multiple overlapping extracted graphs on same partition using min-hash over vertices to reduce vertex replication.
Desiderata
Support graph extraction based on query/distance, and distributedly apply user logic on graph(s) extracted.
Packing overlapping (sub)graphs into few partitions.
TODO:
MinHash functions