This looks cool and thanks for the MIT licence. I like this `pip install ...` type easy installations and will test its performance on very large graphs. will keep an eye on it.
Show HN: Kùzu: An Embeddable GDBMS like DuckDB/SQLite from UWaterloo
11–14 of 14 posts
Re: Show HN: Kùzu: An Embeddable GDBMS like DuckDB/SQLite from UWaterloo
#12Earlier quoted context omitted.
Thanks for the reply. I don't see any operators in the codebase for BFS, DFS, APSP etc. Shouldn't your graph querying build around these fundamental operators?
No, not at all! This is a big misunderstanding that implementing high-level graph DBMS query language require BFS/DFS type "traversals", which is another term to use for joins of node records with each other. Systems that adopt these "traversal" algorithms to do joins end up committing to a specific type of joins (what an RDBMS would call an index-nested loop join) and that's usually not very efficient (no matter wha…
Re: Show HN: Kùzu: An Embeddable GDBMS like DuckDB/SQLite from UWaterloo
#13Earlier quoted context omitted.
No, not at all! This is a big misunderstanding that implementing high-level graph DBMS query language require BFS/DFS type "traversals", which is another term to use for joins of node records with each other. Systems that adopt these "traversal" algorithms to do joins end up committing to a specific type of joins (what an RDBMS would call an index-nested loop join) and that's usually not very efficient (no matter wha…
Interesting. Part of my pessimism stems from seeing bad graph engines over the decades but perhaps you are here to change exactly that. I will keep track of the latest developments in your git repo. I wish the very best!
Re: Show HN: Kùzu: An Embeddable GDBMS like DuckDB/SQLite from UWaterloo
#14Promising work!