Note: lists.lfaidata.foundation will be down for maintenance on Monday, September 26th, starting at 9AM Pacific Time (4PM Monday September 26, 2022 UTC), for approximately one hour.
- Support for Partitioned Vertices in JanusGraphHadoop for OLAP queries
Re: Support for Partitioned Vertices in JanusGraphHadoop for OLAP queries
toggle quoted messageShow quoted text
Thanks for your reply, I'm currently weighing the option of simply bucketing by time vs. partitioning and then implementing partitioned vertex support in OLAP. We are using an HBase backend via Bigtable so partitioning would help prevent supernodes from overrunning the Bigtable row size limits.
On Monday, August 5, 2019 at 4:10:02 AM UTC-7, Florian Hockmann wrote:
I'm not aware of anyone working on this right now, but supernodes are definitely a big problem for graph databases, including JanusGraph, so any improvements in that area would be a great help for many users.
Regarding graph partitioning as a countermeasure for supernodes, I just want to point out that it depends on the size of your cluster of storage backend nodes how much it helps. This blog post
by Ted Wilmes explains in greater detail. It talks about DSE Graph, but the same basically applies to JanusGraph.
So, you might need to implement something yourself to work around the supernode problem, like some bucketing approach where you split your supernodes up. If you want more information about supernodes and the impact they have on JanusGraph, we had a thread a while back on janusgraph-users
on that topic.
Am Freitag, 2. August 2019 19:48:25 UTC+2 schrieb kes...@...:
Are there any plans to remove this restriction anytime soon/is there anyone currently working on this problem?
Join firstname.lastname@example.org to automatically receive all group messages.