hash-db VS kuzu

https://github.com/samsquire/hash-db

I need to combine the ideas in each of these projects into a cohesive solution.

I did some work on trying to implement the YATA algorithm, poorly.

From an SQL database implementation perspective, in my toy Python barebones SQL database that barely supports inner joins (https://github.com/samsquire/hash-db) I tested by testing on postgresql and seeing if my query with two joins produces the same results.

I ought to produce unit tests that prove that tuples from each join operation produces the correct dataset.

For a user perspective, I guess you could write some tooling that loads example data into a database and does an incremental join with each part of the join statement added.

I wrote a toy dynamodb, SQL, Cypher graph and document storage database engine in Python for the learning.

https://github.com/samsquire/hash-db

I am interested in database internals. Btrees come up with regard to designing database systems that are efficient to query on disk. Postgres uses them for its indexes. Radix trees are memory efficient tries which are useful for answering prefix queries. They're also called prefix trees. I use them to get a list of prefixes of a string. Useful for simple intellisense style forms or dynamodb style querying. I've also been studying LSM trees which are used in Leveldb and RocksDB.

I experiment with database technology in my experimental project hash-db https://github.com/samsquire/hash-db The code should be readable.

I need to change my search tree to be self balancing currently it grows to the left or right without balancing. I think I need to use tree rotation depending on which branch has the highest height.

These two posts[2,3] explain where we are from and where we're going, if anyone is interested.

[1]: https://github.com/kuzudb/kuzu

Hi u/kyleireddit, I want to encourage you to try out KuzuDB: https://github.com/kuzudb/kuzu, which we are actively developing. One of our goals is to help educate developers more on where graph dbmss can offer value, so if you join our Slack channel and ask questions about graph dbmss and my students and I can answer some of your questions.

Then you can try Kùzu: https://github.com/kuzudb/kuzu. It should do quite well. We are new but actively developing the system and would love to help you when you are prototyping your application.

Not sqlite, but kuzu ( https://github.com/kuzudb/kuzu ) is an interesting project in this space. Fairly new, but already quite impressive IMHO.

I already mentioned Kùzu folks. They are doing an outstanding job of explaining what they do. Just follow their web 😀 They presented KùzuDB paper which brings interesting concepts to the graph query executions called factorization, S-Join and ASP-Join.