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

Measuring Redis SINTER/Set Intersection Performance

Redis ☞ SINTER (set intersection) operation benchmarked. An O(N * M) op:

The complete set of benchmark results and the program i ran is at the bottom, but the results i care about are these:

taking the intersection of

  • 50,000 x 5,000 took 4 ms
  • 50,000 x 400 took 0.7 ms
  • 50,000 x 30 took 0.4 ms

☞ sorenbs.com

Question is: how many times do you need to perform set intersections in real-time/read time instead of pre-computing them.

Original title and link: Measuring Redis SINTER/Set Intersection Performance (NoSQL databases © myNoSQL)