using redis to optimize mysql queries: i somehow missed this post from flickr team describing their use of (app enforced) capped sorted sets in redis as sort of a reduced optimized secondary index for mysql: […] the bottleneck was not in
using redis to optimize mysql queries: i somehow missed this post from flickr team describing their use of (app enforced) capped sorted sets in redis as sort of a reduced optimized secondary index for mysql:
[…] the bottleneck was not in generating the list of photos for your mostrecently active contact, it was just in finding who your most recentlyactive contact was (specifically if you have thousands or tens of thousandsof contacts). what if, instead of fully denormalizing, we just maintain alist of your recently active contacts? that would allow us to optimize theslow query, much like a native mysql index would; instead of needing to lookthrough a list of 20,000 contacts to see which one has uploaded a photorecently, we only need to look at your most recent 5 or 10 (regardless ofyour total contacts count)!
this is the first time i’m encountaring this approach where a nosql database is used not to provide directly the final data (usually in a denormalized format), but rather to optimize the access to the master of data. basically this is a metadata layer optimizer. neat!
original title and link: using redis to optimize mysql queries (nosql database?mynosql)
原文地址：using redis to optimize mysql queries, 感谢原作者分享。