Very interesting. I'm currently running memgraph with their pagerank implementation but it's quite garbage. And yes a personalized view of the network is a must.

Is Graperank something you designed or it was an established algo previously?

Reply to this note

Please Login to reply.

Discussion

My design. I’d love to find that someone has already implemented it bc I hate to reinvent the wheel, but if a similar centrality algo already exists, I have not yet found it.

What are the problems you’re running into with memgraph?

The biggest headache with neo4j is dealing with java garbage collection, but that’s not an insurmountable problem, just a bit of a learning curve. Other than that I’ve been happy with it. Getting a list of followers is instantaneous, something unthinkable with sql. Finding the shortest path between pubkey1 and pubkey2, is also pretty much instantaneous, even when they’re 7 or 8 hops away.

The algo shipped by memgraph is broken. It sort of works but it's also constantly running out of memory even though it has a shit ton available.

How many nodes are in the graphs you’re running?