heisjustsosmart

His butt. He sources a lot from there.

this guy is a fool. Ignore him. Or see his website.

This guy talks a lot of crap. See his website for examples, and don't waste your time with him

<<<There is one significant drawback that should not be understated. Algorithm design using topology manipulation can be enormously challenging to reason about. You are often taking a conceptually simple algorithm, like a nested loop or hash join, and replacing it with a much more efficient algorithm involving the non-trivial manipulation of complex high-dimensionality constraint spaces that effect the same result. Routinely reasoning about complex object relationships in greater than three dimensions, and constructing correct parallel algorithms that exploit them, becomes easier but never easy.>>>

http://www.jandrewrogers.com/2015/10/08/spacecurve/

What pathology and difficulty?

"Second is to use more exotic and complex space decomposition algorithms"

these being what

What is this: "algorithm phase space"

Don't expect a reply. He makes claims but rarely if ever backs them up.

He specializes in handwaving posts with no solid content. Look at his database posts for example where he's wasted a lot of people's time.

"There are other models that can satisfy both OLTP and OLAP use cases satisfactorily in a single coherent system with modern internals"

ok, which are these.

Think you mean round robin, yes, that's an issue but that's equal probability, not high probability (his phrase). I don't know a scheduler that will handle that as well as handling LRU replacement well and if you have any cites I would appreciate them.

Also remember that many DBs are multi-user so any access patterns from each connection will get thrown in the same bucket.

   Recency-only algorithms are blind to high-probability patterns 
   in the same way frequency-only algorithms

A high probability occurrence must be frequent and will stay reasonably recent. Unless it's high probability that just /somehow/ doesn't happen much.

Perhaps you can provide some citations to some of the things you have written here.

   the cache replacement algorithm is being 
   exercised upwards of 10s of millions of times per second

This is database pages not CPU cache lines. It is not that high.

It doesn't matter, it was advice for all.

Yes. Your point being what.

An ambiguous phrase - I was not criticizing you but only advising you read his historical statements on databases before engaging. He has wasted a great deal of time of other people.

Save yourself a lot of time, read jandrewrogers comments before responding to him.

Read this guy's past posts, you will save yourself a lot of time. He does a lot of this sort of thing.

Virtual methods are about dispatch tables (which are built at compile time) and have nothing to do with paging. Nothing. At all.

Tip: I'd read the jandrewrogers comments before engaging. He actually does know more than you. He makes some unusual claims then doesn't back them up because he has no need to. I've spent and hour or three and learnt nothing because he's so far ahead I can't keep up. Perhaps read his profile about the amazing thing he's invented such as http://www.jandrewrogers.com/2015/10/08/spacecurve/

Let me quote a bit. I admit, I don't understand it but then how could I?

Algorithm design using topology manipulation can be enormously challenging to reason about. You are often taking a conceptually simple algorithm, like a nested loop or hash join, and replacing it with a much more efficient algorithm involving the non-trivial manipulation of complex high-dimensionality constraint spaces that effect the same result. Routinely reasoning about complex object relationships in greater than three dimensions, and constructing correct parallel algorithms that exploit them, becomes easier but never easy.

Incredible! I wish I could grok this stuff.

You should save your breath and just get out of the way of the real experts.