Re:Build Your Own Fast, Persistent, Toy KV Store
by cabalamat on Tuesday February 14, 2023 @09:34PM
(#34799310)
> "trie" data structure
How is that word pronounced? If it's pronounced "tree", it clashes with the name of another data structure. But if it's pronounced "try", it clashes with the name of a reserved word in many languages.
Re:Build Your Own Fast, Persistent, Toy KV Store
by Volt on Tuesday February 14, 2023 @09:53PM
(#34799427)
Intended to be like "tree", usually pronounced "try".
Re:Build Your Own Fast, Persistent, Toy KV Store
by moosedev on Tuesday February 14, 2023 @11:57PM
(#34800264)
Minutes of fun to be had in trying to pronounce it at the precise midpoint of however you pronounce "tree" and "try".
(That word breaks my brain, too - the above is a coping mechanism.)
In the past I recall reading/hearing "trie-tree" (pronounced "try tree") as an ambiguity reducer, but I don't know how common that is now, or ever was.
Re:Build Your Own Fast, Persistent, Toy KV Store
by meling on Wednesday February 15, 2023 @02:28AM
(#34801031)
I usually pronounce it as “try”, as I think I’ve heard others do the same, but I’m non-native English speaker so don’t take my word for it ;-)
Re:Build Your Own Fast, Persistent, Toy KV Store
by CornCobs on Wednesday February 15, 2023 @02:45AM
(#34801147)
I've heard before that it's meant to be re-TRIE-val and therefore is pronounced "tree"
Re:Build Your Own Fast, Persistent, Toy KV Store
by zepolen on Wednesday February 15, 2023 @03:53AM
(#34801520)
tree-eh
Re:Build Your Own Fast, Persistent, Toy KV Store
by afiori on Wednesday February 15, 2023 @04:55AM
(#34801849)
I usually pronounce it as "trye" with the y as in try and the e as the first e in Mercedes
Re:Build Your Own Fast, Persistent, Toy KV Store
by neonrider on Wednesday February 15, 2023 @05:46AM
(#34802177)
https://en.wikipedia.org/wiki/Trie#History,_etymology,_and_p...
The idea was independently described in 1960 by Edward Fredkin, who coined the term trie, pronouncing it /ˈtriː/ (as "tree"), after the middle syllable of retrieval. However, other authors pronounce it /ˈtraɪ/ (as "try"), in an attempt to distinguish it verbally from "tree".
It's still a toy but I kept adding features.
I then kept working on it and added distribution with consistent hashing, rudimentary SQL joins, Cypher graph database queries and document storage. You can even query documents with SQL.
I didn't get around to changing the graph storage to be multimodal.
It takes very little code to write something with lots of features.
https://GitHub.com/samsquire/hash-db
There's an AVL tree that farleyknight wrote and a btree that I wrote that need to be integrated into it.