1BillionRowChallenge
I saw this [Blog Post](https://www.morling.dev/blog/one-billion-row-challenge/) on a Billion Row challenge for Java so naturally I tried implementing a solution in Python & Rust using mainly polars (by Butch78)
bitcoin_ancestries
This codebase will produce some stats on the ancestry of each transaction of the Bitcoin network. (by afiodorov)
1BillionRowChallenge | bitcoin_ancestries | |
---|---|---|
1 | 1 | |
13 | 0 | |
- | - | |
6.0 | 0.6 | |
5 months ago | about 1 year ago | |
Rust | Go | |
- | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
1BillionRowChallenge
Posts with mentions or reviews of 1BillionRowChallenge.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2024-03-02.
-
The One Billion Row Challenge in Go: from 1m45s to 4s in nine solutions
I was curious how long it would take with Polars (for scale), apparently 33s: https://github.com/Butch78/1BillionRowChallenge/tree/main
bitcoin_ancestries
Posts with mentions or reviews of bitcoin_ancestries.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2024-03-02.
-
The One Billion Row Challenge in Go: from 1m45s to 4s in nine solutions
I thought this was an illustrative example of how to process big datasets. We could easily have a statistic per e.g. bitcoin address in a different problem, see https://github.com/afiodorov/bitcoin_ancestries .
I struggle a lot with this toy problem. Without constraints too trivial to pay attention to; then no one seems to agree on potential real-world constraints.