ALL COVERED TOPICS

NoSQL Benchmarks NoSQL use cases NoSQL Videos NoSQL Hybrid Solutions NoSQL Presentations Big Data Hadoop MapReduce Pig Hive Flume Oozie Sqoop HDFS ZooKeeper Cascading Cascalog BigTable Cassandra HBase Hypertable Couchbase CouchDB MongoDB OrientDB RavenDB Jackrabbit Terrastore Amazon DynamoDB Redis Riak Project Voldemort Tokyo Cabinet Kyoto Cabinet memcached Amazon SimpleDB Datomic MemcacheDB M/DB GT.M Amazon Dynamo Dynomite Mnesia Yahoo! PNUTS/Sherpa Neo4j InfoGrid Sones GraphDB InfiniteGraph AllegroGraph MarkLogic Clustrix CouchDB Case Studies MongoDB Case Studies NoSQL at Adobe NoSQL at Facebook NoSQL at Twitter

NAVIGATE MAIN CATEGORIES

Close

Redis and Trees

Doesn’t seem much of an improvement over what you have to do in a relational database[1] or document database[2]:

You can do that exact thing the “hash” way, or the “set + hash” way, both of which are very easy. These aren’t the only ways to do it, just the couple ways that made the most sense to me without thinking too hard about them (and having an idea about what Redis offers).

As a side note, I think the proposed solutions are missing to consider an important aspect: update operations. If these trees are (almost) read-only then a simple JSON-encoded string can be enough. For (large) trees requiring frequent updates, Redis might not be the right tool at all — in this case I’m pretty sure graph databases would excel.

via: http://groups.google.com/group/redis-db/browse_thread/thread/22c2c9e0f941a3d1