graph database


Also found in: Dictionary, Thesaurus.

graph database

A database structure that ties together relationships between data much more thoroughly than a relational database (RDBMS). There are fewer restraints, and data elements can be linked in almost any manner. When using a relational or NoSQL database, this connectedness has to be programmed into the queries and applications in order to derive the same results.

Ranking 20 graph databases in March 2016, DB-Engines.com listed Neo4j, OrientDB, Titan, Virtuoso and ArangoDB as the top five. See relational database.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
References in periodicals archive ?
is an early innovator in Artificial Intelligence (AI) and leading supplier of Semantic Graph Database technology with expert knowledge in developing and deploying Knowledge Graph solutions.
While pure graph database systems exist, a hybrid system that combines relational technology with graph processing capability reduces the learning curve.
It's important to know that we aren't just using Excel or standard business relational (table) databases any more --we add a whole new layer with graph databases. The standard technology we use in each of our research locations in Germany is a relational database, as well as spreadsheets and document files.
Neo4j is a reliable graph database that offers a disc-based, utterly optimized graph storage with high performance [20-23].
Although Forrester Research estimates that 25% of enterprises have implemented graph databases, and Gartner states that graph analysis is the "single most effective competitive differentiator." Typically, content is stored in relational databases.
However, if we think about trees in the context of a graph database where many traversals are required to make sense of connected data we'd ideally prefer lower cost complexity access.
BA/BB connectivity translates the search in the graph database in order to determine if the edge being explored is connected to the exceeded one via an A or a B node.
As a result, it is possible to find within a graph database, the subgraphs matching each pattern, which in this case correspond to crop registers where there is a risk of some disease ocurrence.
Our contribution lies in providing scale independence for querying graph database and mongodb in hadoop environment.
The 22 vertex brick can be downloaded from the graph database HoG [6] by searching for the keyword
That is to say that, if a graph database is populated of 10 billion of nodes or 10 nodes, the time to accomplish the node traversal for a constant set of traversal concerned data is the same.