Dataflow matrix machines (by Anhinga anhinga) (
dmm
) wrote
2021-08-03 07:27 pm (UTC)
no subject
Then there is
https://en.wikipedia.org/wiki/Hash_tree_(persistent_data_structure
)
which is presumably behind all modern implementation of persistent data structures in Clojure and other languages:
https://lampwww.epfl.ch/papers/idealhashtrees.pdf
(also posted here
https://hashingit.com/elements/research-resources/2001-ideal-hash-trees.pdf
)
These ideal hash trees are more like Tries ("Hash Array Mapped Trie").
Array Mapped Tries(AMT), first described in "Fast and Space Efficient Trie Searches", Bagwell [2000], form the underlying data structure.
(
5 comments
)
Post a comment in response:
From:
Anonymous
This account has disabled anonymous posting.
OpenID
Identity URL:
Log in?
Dreamwidth account
Account name
Password
Log in?
If you don't have an account you can
create one now
.
Subject
HTML doesn't work in the subject.
Formatting type
Casual HTML
Markdown
Raw HTML
Rich Text Editor
Message
[
Home
|
Post Entry
|
Log in
|
Search
|
Browse Options
|
Site Map
]
no subject
which is presumably behind all modern implementation of persistent data structures in Clojure and other languages:
https://lampwww.epfl.ch/papers/idealhashtrees.pdf (also posted here https://hashingit.com/elements/research-resources/2001-ideal-hash-trees.pdf )
These ideal hash trees are more like Tries ("Hash Array Mapped Trie").
Array Mapped Tries(AMT), first described in "Fast and Space Efficient Trie Searches", Bagwell [2000], form the underlying data structure.