I'd been thinking for awhile that a database that represents nodes and edges of a graph with types and properties would be really useful...
-
-
in true orange website fashion... Q: "what's the best graph database?"
-
A: "this one's good" A: "I like this one" A: "hi I was the maintainer of conceptnet literally sqlplus is more perfomant than any of them"
-
... but really weren't workable for large scale projects, at least as of 2-ish years ago.
-
yea consensus seems to be they only really work at scales so trivial that anything would work
- 1 more reply
New conversation -
-
-
*whispers* you can just use postgresql for everything
-
it's actually true tho https://research.google.com/pubs/archive/43287.pdf …
End of conversation
New conversation -
-
-
even neo4j?
-
this thread has most colored my first impression of the state of the art https://news.ycombinator.com/item?id=11260475 …
- 1 more reply
New conversation -
-
-
Used Titan graph db on a fairly large project, it was fine but for performance graph abstraction maps poorly to low level.
-
Please share specific issues with Titan, we'd love to fix them in
@JanusGraph! GitHub issues and email welcome.
End of conversation
New conversation -
-
-
Have you looked at Orient?
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
there isn't really a good general representation for graphs that's efficient for every kind of thing you could want to do
-
in a lot of cases you can do dimensionality reduction tricks on adjacency matrices and index them in spatial indexes, though
-
graph -> PCA (or maybe something fancier like an autoencoder) -> annoy is a common pipeline for collaborative filtering
End of conversation
New conversation -
-
-
not a strictly graph db, but http://www.datomic.com/ is decent (if you don't need lots of graph algos built in).
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.