HTML tutorial
CSS3 tutorial
Bootstrap tutorial
JavaScript tutorial
JQuery tutorial
AngularJS tutorial
React tutorial
NodeJS tutorial
PHP tutorial
Python tutorial
Python3 tutorial
Django tutorial
Linux tutorial
Docker tutorial
Ruby tutorial
Java tutorial
C tutorial
C ++ tutorial
Perl tutorial
JSP tutorial
Lua tutorial
Scala tutorial
Go tutorial
ASP.NET tutorial
C # tutorial
Partition is divided into a plurality of data processing Redis instances, each instance to save only a subset of the key.
Some features redis in partitioning performance is not very good:
Redis There are two types of partitions. Suppose there are four Redis instance R0, R1, R2, R3, and similar user: 1, user: a plurality of key 2 such a representation on users, given the key to select a variety of different ways in which the key is stored in the instance . In other words, there are different systems to map a key to a Redis service.
The easiest way is to partition range partitioning is mapped to a range of subject-specific Redis instance.
For example, ID from 0 to 10000 users will save the instance R0, ID from 10001-20000 users will be saved to R1, and so on.
This approach is feasible and practical use, is to have a range of less than the range of the mapping table instance. This table is to be managed, but also need to map various objects, usually Redis is not a good method.
Another approach is to hash partitioning partitions. This applies to any key, and need not be object_name: