datajudge
hash-db
datajudge | hash-db | |
---|---|---|
1 | 5 | |
38 | 50 | |
- | - | |
8.1 | 0.0 | |
29 days ago | over 1 year ago | |
Python | Python | |
BSD 3-clause "New" or "Revised" License | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
datajudge
-
Ask HN: How do you test SQL?
https://github.com/QuantCo/datajudge
We've also written a blog post trying to illustrate a use case:
hash-db
-
CRDT-richtext: Rust implementation of Peritext and Fugue
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.
-
Ask HN: How do you test SQL?
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.
-
Bullshit Graph Database Performance Benchmarks
I wrote a toy dynamodb, SQL, Cypher graph and document storage database engine in Python for the learning.
https://github.com/samsquire/hash-db
- Experimental distributed keyvalue database (it uses python dictionaries) imitating dynamodb querying with join only SQL support, distributed joins and simple Cypher graph support
-
How necessary are the programming fundamentals?
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.
What are some alternatives?
SS-Unit - A 100% T-SQL based unit testing framework for SQL Server
electric - Local-first sync layer for web and mobile apps. Build reactive, realtime, local-first apps directly on Postgres.
pg_temp - create a temporary, disposable, userland pg database
kuzu - Embeddable property graph database management system built for query speed and scalability. Implements Cypher.
spark-style-guide - Spark style guide
dbt-unit-testing - This dbt package contains macros to support unit testing that can be (re)used across dbt projects.
fugue - A unified interface for distributed computing. Fugue executes SQL, Python, Pandas, and Polars code on Spark, Dask and Ray without any rewrites.
ustore - Multi-Modal Database replacing MongoDB, Neo4J, and Elastic with 1 faster ACID solution, with NetworkX and Pandas interfaces, and bindings for C 99, C++ 17, Python 3, Java, GoLang 🗄️
sqlx - 🧰 The Rust SQL Toolkit. An async, pure Rust SQL crate featuring compile-time checked queries without a DSL. Supports PostgreSQL, MySQL, and SQLite.
pg_crdt - POC CRDT support in Postgres
testcontainers-dotnet - A library to support tests with throwaway instances of Docker containers for all compatible .NET Standard versions.
data-diff - Compare tables within or across databases