| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | [Attempt #2] String overflow hash + data/mem optimization (#356) | Bang NGUYEN | 2024-01-13 | 1 | -75/+61 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | * Use graal * Use dynamic cores computer * Use stream API to cleanup code * Use max processors * Use hash to avoid init string * optimize concurrentmap init * Smaller hash size * Avoid checking concurrentmap * Optimize data type * string dedup * Faster write * Change base * Remove time * Use mul instead of div | ||||
| * | [Attempt 1] Memory mapping + split by linebreak + multithreads + fast double ↵ | Bang NGUYEN | 2024-01-12 | 1 | -0/+283 |
| parser (#330) * Create clones * Cleanup code and add memory mapping to read file * Fix chunks reading logic to fit linebreak * Remove unused * Sequential * Multi thread process chunks * Add new line in output * Remove unnecessary operation with map & reducer memory * Reduce mem usage by using only 1 map * formatting * Remove unnecessary length check * Remove trycatch * Optimize double parsing | |||||
 |
index : 1brc | |
| my implementations for the billion row challenge | nginx |
| aboutsummaryrefslogtreecommitdiff |