Graph vs Relational Databases
Old Guard vs the New Upstart
More About Graph Databases
- A graph data structure is a data model that stores data in the form of Vertices (graph nodes) interconnected by Edges (graph arcs). By assembling vertices and edges to form relationships in connected graph structures, it is possible to build structures that closely represent the real-world problem domain.
- Each vertex in the graph database can contain any number of Properties that describe a real-world object, and any number of edges that represent the relationships to other vertices. These edges are organized by type and direction and may also hold additional Properties.
- Whenever running the equivalent of a JOIN operation, the graph database follows the edge paths, to access the connected nodes. This eliminates the need for expensive search-and-match computation to find vertices.