Re:Using Rust to Scale Elixir for 11M Concurrent Users
by jhgg on Saturday May 18, 2019 @02:42AM
(#19946073)
Cartesian trees do not provide the ability to get items at arbitrary indices within the data structure in an efficient member from my understanding. In order to get the Nth item in the tree, a linear traversal is required. Furthermore, to get the index at which an item is inserted or removed requires the same traversal to accumulate the index.
[ Parent
| on HN ]
Re:Using Rust to Scale Elixir for 11M Concurrent Users
by kilotaras on Saturday May 18, 2019 @03:18AM
(#19946178)
The common solution is to hold size of subtree in the nodes in addition to the value a.k.a treap with implicit keys.
Re:Using Rust to Scale Elixir for 11M Concurrent Users
by pornel on Saturday May 18, 2019 @08:47AM
(#19947102)
But at this point you're adding even more bookkeeping and implementation complexity just to use a data structure that's not ideal in the first place (for performance, sequential memory layout is better than chasing pointers).
Re:Using Rust to Scale Elixir for 11M Concurrent Users
by foobarqwertz on Saturday May 18, 2019 @05:14AM
(#19946462)
I propose a challenge: Provide the interface for the datastructure and the test tool.