summaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorJan-Erik Rediger <janerik@fnordig.de>2015-04-28 15:21:11 +0200
committerJan-Erik Rediger <janerik@fnordig.de>2015-04-28 15:21:11 +0200
commitfb53288110b6a55802999a1e9f036abefc02e01d (patch)
tree74e61b90bda8309c24352e0ed2ffe54d222d661b /README.md
parent3ff49afff1bf9b0d84d8ad53fb2d6b9b5d4b039c (diff)
downloadredis-fb53288110b6a55802999a1e9f036abefc02e01d.tar.gz
One more small fix
Diffstat (limited to 'README.md')
-rw-r--r--README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/README.md b/README.md
index 8efc7faca..223ef13c6 100644
--- a/README.md
+++ b/README.md
@@ -11,7 +11,7 @@ Data structures implemented into Redis have a few special properties:
* Implementation of data structures stress on memory efficiency, so data structures inside Redis will likely use less memory compared to the same data structure modeled using an high level programming language.
* Redis offers a number of features that are natural to find in a database, like replication, tunable levels of durability, cluster, high availability.
-Another good example is to think at Redis as a more complex version of memcached, where the operations are not just SETs and GETs, but operations to work with complex data types like Lists, Sets, ordered data structures, and so forth.
+Another good example is to think of Redis as a more complex version of memcached, where the operations are not just SETs and GETs, but operations to work with complex data types like Lists, Sets, ordered data structures, and so forth.
If you want to know more, this is a list of selected starting points: