datacrypt-project/hitchhiker-tree
View on GitHub ↗ ★ 1,220 Clojure
Functional, persistent, off-heap, high performance data structure
6 mentions on Hacker News by 6 people: 3 stories, 3 comments · first 2016-08-05 · latest 2023-12-30
20082026
-
…2011. https://www.percona.com/blog/wp-content/uploads/2011/11/how-... * Hitchhiker Tree. 2016. https://github.com/datacrypt-project/hitchhiker-tree
comment by ww520 · 2023-12-30 · in How the append-only btree works (2010) -
▲ 4
Hitchhiker-tree: persistent, off-heap, high performance data structurestory by tosh · 2019-04-21 · 0 comments
-
This project might be of interest actually https://github.com/datacrypt-project/hitchhiker-tree
comment by yogthos · 2017-02-07 · in State of Clojure 2016 – Results and Analysis -
…that merits the description "Hitchhiker trees are a newly invented (by @dgrnbrg) datastructure". 0: https://github.com/datacrypt-project/hitchhiker-tree/blob/ma... 1: http://www.cs.au.dk/~gerth/papers/alcomft-tr-03-75.pdf 2:…
comment by jbapple · 2016-08-06 · in Fractal Tree to create fast, snapshottable, massively scalable databases -
▲ 21
Fractal Tree to create fast, snapshottable, massively scalable databasesstory by jgrodziski · 2016-08-06 · 5 comments
-
▲ 150
Hitchhiker trees: functional, persistent, off-heap sorted mapsstory by hadronzoo · 2016-08-05 · 32 comments