JavaScript vs. Nebula Graph vs. PureScript vs. Voldemort Comparison Chart

The graph database built for super large-scale graphs with milliseconds of latency. We are continuing to collaborate with the community to prepare, popularize and promote the graph database. Nebula Graph only allows authenticated access via role-based access control. Nebula Graph supports multiple storage engine types and the query language can be extended to support new algorithms. Nebula Graph provides low latency read and write , while still maintaining high throughput to simplify the most complex data sets. With a shared-nothing distributed architecture , Nebula Graph offers linear scalability. Nebula Graph's SQL-like query language is easy to understand and powerful enough to meet complex business needs. With horizontal scalability and a snapshot feature, Nebula Graph guarantees high availability even in case of failures. Large Internet companies like JD, Meituan, and Xiaohongshu have deployed Nebula Graph in production environments.

Voldemort is not a relational database, it does not attempt to satisfy arbitrary relations while satisfying ACID properties. Nor is it an object database that attempts to transparently map object reference graphs. Nor does it introduce a new abstraction such as document-orientation. It is basically just a big, distributed, persistent, fault-tolerant hash table. For applications that can use an O/R mapper like active-record or hibernate this will provide horizontal scalability and much higher availability but at great loss of convenience. For large applications under internet-type scalability pressure, a system may likely consist of a number of functionally partitioned services or APIs, which may manage storage resources across multiple data centers using storage systems which may themselves be horizontally partitioned. For applications in this space, arbitrary in-database joins are already impossible since all the data is not available in any single database.