1 Repo
Indexes edges per vertex instead of globally, enabling fast local traversals even when a vertex has millions of incident edges.
Distinct from Vertex Indexing Generation: Distinct from Vertex Indexing Generation: focuses on graph database edge indexing per vertex for traversal performance, not graphics rendering index buffers.
Explore 1 awesome GitHub repository matching graphics & multimedia · Graph Vertex-Centric Indexes. Refine with filters or upvote what's useful.
JanusGraph is a distributed, elastically scalable graph database designed to store and query highly connected data across a cluster of machines. It supports the property graph data model with ACID consistency and integrates multi-model search capabilities including geo, numeric range, and full-text queries. The database also includes a Graph OLAP engine for running batch analytics and global graph computations on large datasets using the Hadoop framework. The project distinguishes itself through a masterless cluster architecture that eliminates single points of failure, allowing every node to
Indexes edges per vertex instead of globally, enabling fast local traversals even when a vertex has millions of incident edges.