00:33:17 GMT <kulelu88> how do I search through the hash-names in redis?
06:21:23 GMT <MasterGberry> Does redis clusters guarantee the same in-order operations that a single redis instance running has?
12:23:43 GMT <UniFreak> hi, any book recommendation on redis?
12:24:21 GMT <minus> redis.io/topics has a lot of information
12:26:23 GMT <UniFreak> minus: thanks
12:26:47 GMT <minus> that's not books though
12:30:41 GMT <UniFreak> minus: the link seems dead already, are you sure it's a valid link?
12:33:55 GMT <minus> no
12:40:50 GMT <badboy_> it's http://redis.io/documentation
17:13:45 GMT <vineet_> Hello redis community
17:14:05 GMT <vineet_> I am writing a C++ program, where I am using a map
17:14:23 GMT <vineet_> the key is a structure with two 64 bit unsigned int
17:14:41 GMT <vineet_> Though I would like to optimize its performance further
17:15:16 GMT <vineet_> Can you guys point me to some techniques or methods that I can use instead of map for fast lookups and insertion
17:16:20 GMT <vineet_> Since you guys created a fast in memory database
17:16:36 GMT <vineet_> I assume you must be using some crazy fancy stuff for optimizations
18:58:35 GMT <Aristona> Hey guys, I have a question. Right now I cache some of my user information in Redis with a format like so:
18:58:53 GMT <Aristona> user:1:details // JSON string
18:58:58 GMT <Aristona> user:1:level // JSON string
18:59:18 GMT <Aristona> I basically make a key for each user like this
18:59:32 GMT <Aristona> Sometimes I need to fetch information of multiple users, let's say 20
18:59:57 GMT <Aristona> In this case I make a for loop and make GET calls (40 on total since there are two keys for each user)
19:00:35 GMT <Aristona> I'm thinking about making it atomic/faster, so I'm thinking about creating a HASH like so:
19:00:45 GMT <Aristona> [HASH] userInformation
19:01:02 GMT <Aristona> And place key names like so: user.1.details, user.1.id
19:01:09 GMT <Aristona> so I can rely on HMGET
19:01:27 GMT <Aristona> Is there a better approach or this sounds fine?
19:52:17 GMT <kulelu88> Aristona: can you give a full hset command of your hash with key-values. eg. HSET myash key1 value1 ?
19:57:49 GMT <minus> Aristona: putting details and level of a user into a hash does make more sense, yes
20:52:48 GMT <Aristona> @minus Would that bring any performance over doing GET in a loop?
20:52:58 GMT <Aristona> IIRC, HMGET was o(1)?
20:53:02 GMT <minus> most likely
20:53:16 GMT <minus> definitely uses less RAM
20:53:30 GMT <minus> just benchmark it™
20:53:31 GMT <Aristona> Oh, it is O(N) where N is the number of fields being requested.
20:53:47 GMT <minus> which is O(1) per field :P
20:54:12 GMT <minus> GET is also O(n) over the number for fields
20:56:48 GMT <Aristona> So MGET for strings and HMGET for hashes has similar complexity but HASH takes less ram?
21:00:43 GMT <minus> yes
21:00:59 GMT <minus> because you don't need to store the whole namespaced key again
21:15:12 GMT <kulelu88> minus: you work for Redis ?
21:18:03 GMT <minus> no
21:18:05 GMT <Aristona> minus: Okay, thanks. If you have a dog, hug it for me :p