by dpapathanasiou on 12/26/20, 4:31 PM with 42 comments
by rklaehn on 12/26/20, 8:13 PM
I did something similar recently, a block store for a rust implementation of ipfs, which models a directed acyclic graph of content-addressed nodes.
https://github.com/actyx/ipfs-sqlite-block-store
I found that performance is pretty decent if you do almost everything inside SQLite using WITH RECURSIVE.
The documentation has some really great examples for WITH RECURSIVE. https://sqlite.org/lang_with.html
by rekwah on 12/26/20, 6:34 PM
[0] - https://www.sqlite.org/cgi/src/artifact/636024302cde41b2bf0c...
[1] - https://charlesleifer.com/blog/querying-tree-structures-in-s...
by kevas on 12/26/20, 6:16 PM
https://www.amazon.com/Hierarchies-Smarties-Kaufmann-Managem...
by loxias on 12/27/20, 3:36 AM
However, what's lacking from something like this is a detailed bill of the cost. I'd love to see some, any benchmark on a DB with > 10^6 edges to see how it goes. That's the other hand of the equation "just use sqlite and be happy" -- the expectation that performance will actually be reasonable.
by ptrik on 12/27/20, 1:43 AM
by bjornsing on 12/26/20, 5:50 PM
by lolive on 12/26/20, 6:56 PM
by roland_nilsson on 12/27/20, 8:50 AM
by brian_herman on 12/26/20, 8:46 PM