Property Graph Modeling with an FU Towards Supernodes

The talk discusses ways to mitigate super nodes and partitioning strategies in graph databases. It is vendor-neutral, despite the speaker working at DataStax. The presentation covers definitions of super nodes, vertices, adjacent vertices, and neighbors. Super node problems include query performance traversals and storage retrieval issues. The talk provides valuable insights on how to query, design, and set up data in graph databases effectively while avoiding common pitfalls when designing a schema for graph data.