dmoldavanov·vor 6 Jahren·discussCache-Oblivious B-Tree is a variant of B-Tree The title says "fundamentally new"
dmoldavanov·vor 7 Jahren·discussThey also have _comparison_ with RCU https://concurrencyfreaks.blogspot.com/2019/10/is-rcu-generi...
dmoldavanov·vor 7 Jahren·discussAnd now imaging an Operation System with hundreds or even thousands other processes at work.
dmoldavanov·vor 7 Jahren·discuss>Imagine you you have a text file or database with millions of numbers in ASCII hexadecimal notationThese much amount of data with guarantee will crowd out this array from cache bcauz processor cache in not a LRU
dmoldavanov·vor 7 Jahren·discussUsing of array lookup is a bad wayof optimization: digittoval[src[N]] can take up to 200 cycles if not in cacheOnly synthetic tests that small enough (most of them do nothing than tested code) show good results.