Business Platform Team

Anant Corporation Blog: Our research, knowledge, thoughts, and recommendations about building and managing online business platforms.

Tag Archives: graph


DSE Graph in G.V() IDE

For several months now I have had my eye on G.V() IDE, an exciting new development in the Tinkerpop/Gremlin world. However, I wanted to wait for G.V() IDE to have compatibility with DSE Graph before giving it a test run – which became true as of the recent 0.9.14 release. Why is this an exciting new development, you may ask? A major hurdle for new developers getting started with Tinkerpop is the query language. While there is documentation and an active community that is (surprisingly) responsive and willing to help beginners, the Gremlin query language still creates a learning curve.

Add to that the difficulty of identifying mistakes until runtime, and the process of developing applications in Gremlin can become quite demanding.

However, lately, there have been various efforts at helping mitigate this learning curve. Previously I reviewed AWS Graph Notebook, a tool that provides a Jupyter notebook environment for graph databases. In this post, I will be taking a look at another tool that provides out-of-the-book visualization and REPL interactivity for Tinkerpop, but this time around in the form of an IDE: G.V().

Continue reading

JanusGraph on Jupyter: Using Notebooks with Graph

Graph data readily lends itself to visualization – and notebooks make it easy to do just that. In this post, we will test out the Graph Notebook tool put out by the AWS team on JanusGraph.

Continue reading
Solving Wide Partitions caused by Supernodes in DSE 6.8 (Part three)

Solving Wide Partitions caused by Supernodes in DSE 6.8 (Part three)

Introduction

In the first part of this blog series, we looked at the underlying issue that supernodes cause in DSE Graph due to how partitioning in Cassandra works and solutions that have been put forward for DSE Graph 5.x and 6.0-6.7. In the second part, we took a look at what this actually looks like within DSE 6.7 via some hands-on experimentation with intermediary vertices. We saw that although intermediary vertices successfully break apart the wide partitions, there are some problems inherent in introducing an extra hop like that.

In this third and final part of the series, we will look at how we can take advantage of the changes made in DSE 6.8 in order to implement a better solution than what was possible in DSE 6.7.

Continue reading
Solving Wide Partitions caused by Supernodes in DSE 6.7 (Part two)

Solving Wide Partitions caused by Supernodes in DSE 6.7 (Part two)

Introduction

In part one of this series, we explored differences between DSE Graph 5.x and 6.0-6.7 regarding how it partitions edges and vertices in Cassandra, and what this meant in regard to how you would go about breaking apart your supernodes in order to avoid wide partitions in your DSE cluster. In this second part, we will see how it works hands-on.

As we will see, while intermediary vertices is a solution available for breaking up supernodes in 6.7, it is less than ideal in many ways. This will prepare us for our third post, about what solving the same issue looks like in DSE Graph 6.8.

Continue reading
Partitioning in DSE Graph (Part One)

Partitioning in DSE Graph (Part One)

Introduction

In the graph world, supernodes are a common yet devastating problem. In the Cassandra world, wide-partitions can be paralyzing and have a ripple effect across your cluster. Put them together, and you’ve got yourself into a lot of trouble!

Continue reading

Join Anant's Newsletter

Subscribe to our monthly newsletter below and never miss the latest Cassandra and data engineering news!