正在加载视频...

视频加载失败

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,627 次观看 • 5 个月前 •via X (Twitter)

0 条评论

暂无评论

原始帖子的评论将显示在这里

相关视频