Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/valentatomas/hattrie
[WIP] Implementation of HAT-trie in Go
https://github.com/valentatomas/hattrie
Last synced: 3 months ago
JSON representation
[WIP] Implementation of HAT-trie in Go
- Host: GitHub
- URL: https://github.com/valentatomas/hattrie
- Owner: ValentaTomas
- License: mit
- Created: 2022-12-22T12:17:49.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2023-09-13T11:40:54.000Z (over 1 year ago)
- Last Synced: 2023-09-13T21:42:32.027Z (over 1 year ago)
- Language: Go
- Homepage:
- Size: 172 KB
- Stars: 2
- Watchers: 1
- Forks: 1
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# [WIP] HAT-trie
## Usage
### Test
```sh
make test-fast
```
```sh
make benchmark
```
## Reading
- https://nlp.fi.muni.cz/raslan/raslan16.pdf#page=151
- https://nlp.fi.muni.cz/raslan/raslan13.pdf#page=71
- http://www.jandaciuk.pl/fsa.html#FSApack
- https://en.wikipedia.org/wiki/HAT-trie
- https://tessil.github.io/2017/06/22/hat-trie.html
- https://dave.cheney.net/2019/05/07/prefer-table-driven-tests
- https://dave.cheney.net/high-performance-go
- https://www.practical-go-lessons.com/chap-7-hexadecimal-octal-ascii-utf8-unicode-runes
- https://www.practical-go-lessons.com/chap-34-benchmarks
- https://homepages.dcc.ufmg.br/~nivio/papers/cikm07.pdf
- https://arxiv.org/pdf/2006.09973.pdf
- https://go.dev/blog/strings
- https://www.joelonsoftware.com/2003/10/08/the-absolute-minimum-every-software-developer-absolutely-positively-must-know-about-unicode-and-character-sets-no-excuses/
- https://cs.wikipedia.org/wiki/Trie
- https://en.wikipedia.org/wiki/Finite-state_machine
- https://blog.gopheracademy.com/advent-2014/bloom-filters/
- https://www.academia.edu/45458959/HAT_Trie_A_Cache_Conscious_Trie_Based_Data_Structure_For_Strings
- https://abhinavg.net/2020/03/12/pointers-as-map-keys/
- https://go.dev/blog/slices
- https://go.dev/blog/normalization
- https://go101.org/article/memory-layout.html
- https://planetscale.com/blog/generics-can-make-your-go-code-slower
- https://go101.org/article/memory-block.html
- https://go101.org/optimizations/101.html
- https://stackoverflow.com/questions/41030545/are-we-overusing-pass-by-pointer-in-go
- https://pthevenet.com/posts/programming/go/bytesliceindexedmaps/
- https://en.m.wikipedia.org/wiki/Open_addressing
- https://en.m.wikipedia.org/wiki/Linear_probing
- https://en.m.wikipedia.org/wiki/MurmurHash
- https://github.com/golang/go/wiki/CompilerOptimizations
- https://github.com/dgryski/go-perfbook
- https://godbolt.org/z/e1vaarMKM
- Can we paralellize the sorting of hash keys and inserting to the trie?
- https://github.com/twotwotwo/sorts
- https://github.com/jfcg/sorty
- https://go.dev/doc/pgo
- https://go.dev/blog/go1.20
- https://groups.google.com/g/golang-nuts/c/baU4PZFyBQQ
- https://reader.elsevier.com/reader/sd/pii/S0304397512003787?token=8F9D18B0B717058FD51BB489E748AAA0DF138B0F65C0576398B6985CB45262B88779E7DE3AB4A01DEA11E481C991474B&originRegion=eu-west-1&originCreation=20230204163136
- https://aclanthology.org/J00-1002.pdf
- https://github.com/ricardoerikson/benchmark-golang-maps
- https://cstheory.stackexchange.com/questions/1539/whats-new-in-purely-functional-data-structures-since-okasaki
## Code Reference
- Burst trie - https://github.com/nlfiedler/sortingo/blob/master/sort/burstsort.go
- Tests - https://github.com/raviqqe/hamt/blob/v2/entry.go
- Tests - from https://github.com/dghubble/trie/blob/main/bench_test.go
- Hamt trie - https://github.com/raviqqe/hamt
- HAT-trie used in FSA3 - https://github.com/dcjones/hat-trie
- HAT-trie - https://github.com/Tessil/hat-trie
- Array hash - https://github.com/Tessil/array-hash
- Bloom filter? - https://github.com/GuillaumeHolley/BloomFilterTrie
- Go map (hash array) - https://github.com/golang/go/blob/master/src/runtime/map.go
## Debug
- Can be pure with max container 2 with alphabet 256?
- Splits not halving links, only ocurences-> too many pure nodes?