Why not add an LSM memtable on top of the cow b+ tree?
Use the skiplist as a write buffer and write to the b+ tree in batches when the skiplist is frozen.
Bftree solves one non-obvious pain point - caching when your data set is random (the key is a hash) and the data is smaller than the page size. LSM reads are based on block size; same with caching. So if your record is 8 bytes, you end up caching the remaining ~4 KB, and the hit rate will be pretty low.
In-memory immuatable data structures seem to be only suitable for scenarios with large amounts of data and high concurrency. In most scenarios, this actually incurs a lot of additional copying overhead.
Why restrict it to Shell programs with script language? What about LLM powered chat? Terminal is the UI between humans and machines, future is IM App. What people do to each other, people and machines will do the same(ask,talk,chat,assign task).
for new register: password require at least 16 characters and contain: an uppercase letter, a lowercase letter, a number, and a symbol.
Its too complex for even Chrome built-in secure password generator to come up with, let alone a human.
While both MJ and Turnstyle are Turing-complete, Turnstyle shares more similarities with Piet (mentioned by the author), Wireworld, and, of course, Conway's Game of Life.
reply