Loading video...

Video Failed to Load

Go Home

B-tree database lookups are way slower without a memory cache in place + a good replacement policy for OLTP. MySQL uses a segmented LRU whereas Postgres uses a clock-sweep algorithm. Both good choices for different reasons.

51,744 views • 6 months ago •via X (Twitter)

0 Comments

No comments available

Comments from the original post will appear here

Related Videos