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)
brc
1 billion rows challenge (by k0nserv)
| 1BillionRowChallenge | brc | |
|---|---|---|
| 1 | 1 | |
| 13 | 4 | |
| - | - | |
| 6.0 | 6.3 | |
| 5 months ago | 5 months ago | |
| Rust | Rust | |
| - | MIT License |
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
brc
Posts with mentions or reviews of brc.
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 did it with custom parsing[0] and treated the numbers as 16 bit integers, the representation in the file is not a constant number of bytes which complicates the table approach. If you end up computing a hash I think it might be slower than just doing the equivalent parsing I do and a four byte constant table will be very large and mostly empty. Maybe a a trie would be good.
0: https://github.com/k0nserv/brc/blob/main/src/main.rs#L279