Average Ratings 0 Ratings

Total
ease
features
design
support

No User Reviews. Be the first to provide a review:

Write a Review

Average Ratings 0 Ratings

Total
ease
features
design
support

No User Reviews. Be the first to provide a review:

Write a Review

Description

Graph Engine (GE) is a powerful distributed in-memory data processing platform that relies on a strongly-typed RAM storage system paired with a versatile distributed computation engine. This RAM store functions as a high-performance key-value store that is accessible globally across a cluster of machines. By leveraging this RAM store, GE facilitates rapid random data access over extensive distributed datasets. Its ability to perform swift data exploration and execute distributed parallel computations positions GE as an ideal solution for processing large graphs. The engine effectively accommodates both low-latency online query processing and high-throughput offline analytics for graphs containing billions of nodes. Efficient data processing emphasizes the importance of schema, as strongly-typed data models are vital for optimizing storage, accelerating data retrieval, and ensuring clear data semantics. GE excels in the management of billions of runtime objects, regardless of their size, demonstrating remarkable efficiency. Even minor variations in object count can significantly impact performance, underscoring the importance of every byte. Moreover, GE offers rapid memory allocation and reallocation, achieving impressive memory utilization ratios that further enhance its capabilities. This makes GE not only efficient but also an invaluable tool for developers and data scientists working with large-scale data environments.

Description

RecallGraph is a versioned graph data store. It retains all changes its data (vertices, edges) have undergone to get to their current state. It supports point-in time graph traversals that allow the user to query any past state of a graph as well as the present. RecallGraph can be used in situations where data is best represented using a network of edges and vertices (i.e., as a graph). 1. Both edges and vertices can contain properties in the form attribute/value pairs (equivalent of JSON objects). 2. Documents (vertices/edges), can change throughout their lives (both in their individual attributes/values as well as in their relationships to each other). 3. Documents from the past are just as important as their current states, so it is essential to retain and queryable their change history. Also see this blog post for an intro - https://blog.recallgraph.tech/never-lose-your-old-data-again.

API Access

Has API

API Access

Has API

Screenshots View All

Screenshots View All

Integrations

No details available.

Integrations

No details available.

Pricing Details

No price information available.
Free Trial
Free Version

Pricing Details

No price information available.
Free Trial
Free Version

Deployment

Web-Based
On-Premises
iPhone App
iPad App
Android App
Windows
Mac
Linux
Chromebook

Deployment

Web-Based
On-Premises
iPhone App
iPad App
Android App
Windows
Mac
Linux
Chromebook

Customer Support

Business Hours
Live Rep (24/7)
Online Support

Customer Support

Business Hours
Live Rep (24/7)
Online Support

Types of Training

Training Docs
Webinars
Live Training (Online)
In Person

Types of Training

Training Docs
Webinars
Live Training (Online)
In Person

Vendor Details

Company Name

Microsoft

Founded

1975

Country

United States

Website

www.graphengine.io

Vendor Details

Company Name

RecallGraph

Founded

2020

Country

India

Website

recallgraph.tech/

Product Features

Product Features

Alternatives

HyperGraphDB Reviews

HyperGraphDB

Kobrix Software

Alternatives

Apache TinkerPop Reviews

Apache TinkerPop

Apache Software Foundation
Sparksee Reviews

Sparksee

Sparsity Technologies
Dgraph Reviews

Dgraph

Hypermode