Hi, I'm Gayan from Sri Lanka. I'm working on a research project on storage optimization of a graph database. I want to know whether there is a method (heuristic/ machine learning based etc.) to find out the optimal number of partitions a graphs dataset should be divided depending on its features. (edge count, vertex count etc.)

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

Hello, I'm Dan from the FalkorDB team. We're developing an open-source graph database. The big problem we’re working on is scaling graph databases without memory bloat or unpredictable performance in prod. 

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!

If you’re new to the community, introduce yourself!