Video yükleniyor...
Video Yüklenemedi
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 görüntüleme • 6 ay önce •via X (Twitter)
0 Yorum
Yorum bulunmuyor
Orijinal gönderinin yorumları burada görünecek
Benzer Videolar
0:30
Sensitive content
3 reasons why you should date a tr&ns girl. Are any of them good enough for y’all to consider settling for a man in a dress?
Hazel Appleyard
126,653 görüntüleme • 1 yıl önce
