Intersecting redis sets that are incomplete -


i have data want store in redis able efficiently intersect it. example data:

 key |  members ---------------------------------  101 |  "a1", "a2", "a3"  102 |  "a2", "a3"  103 |  "a2", "a4"

so, intersection of keys give me

sinter 101 102 103 1) "a2"

however, have problems when dataset incomplete:

 key |  members ---------------------------------  101 |  "a1", "a2", "a3"  102 |  "a2", "a3"  103 |  "a4", "a5"

in case, getting intersection of same 3 keys give me empty set:

sinter 101 102 103 (empty list or set)

my goal member matches sets. there way in redis achieve this? alter way datasets stored, if helps. i.e. creating inverse versions of sets (members keys, keys members)

also, perhaps make sense use other key store redis, might more suitable task?

you can union operations on sorted sets, using aggregate sum argument. it's bit clunky work. add elements score of 1, , union summing scores.

the resulting set sorted element intersection points element least:

127.0.0.1:6379> zadd foo 1 (integer) 1 127.0.0.1:6379> zadd foo 1 b (integer) 1 127.0.0.1:6379> zadd foo 1 c (integer) 1  127.0.0.1:6379> zadd bar 1 (integer) 1 127.0.0.1:6379> zadd bar 1 c (integer) 1  127.0.0.1:6379> zadd baz 1 d (integer) 1  # let's union , store "merged" 127.0.0.1:6379> zunionstore merged 3 foo bar baz aggregate sum (integer) 4  # merged sorted common points 127.0.0.1:6379> zrevrange merged 0 -1 withscores 1) "c" 2) "2" 3) "a" 4) "2" 5) "d" 6) "1" 7) "b" 8) "1" 127.0.0.1:6379>

Comments

Post a Comment

Popular posts from this blog

neo4j - finding mutual friends in a cypher statement starting with three or more persons -

Image
i trying build cypher statement neo4j know 2-n starting nodes name , need find node (if any) can reached of starting nodes. at first tought similar "mutual friend" situation handled (start1)-[*..2]->(main)<-[*..2]-(start2) in case have more 2 starting points around 6 know name. so puzzled how can include third, fourth , on node cypher able find commmon root amongst them. in above example neo4j website need path starting 'dilshad', 'becky' , 'cesar' check if have common friend (anders) excluding 'filipa' , 'emil' not friends of three. so far create statement programmatically looks like match (start1 {name:'person1'}), (start2 {name:'person2'}), (start3 {name: 'person3'}), (main) (start1)-[*..2]->(main) , (start2)-[*..2]->(main) , (start3)-[*..2]->(main) return distinct main but wondering if there more elegant / efficient way in cypher possibly use list of names parameter ...
Read more

php - How to remove letter in front of the word laravel -

Image
based on picture above result of var_dump() , dd() of same variable ,when var_dump() , apostrophe (') symbol in black diamond of question mark , when dd() same variable , apostrophe can seen letter 'b' appear in front of words what want can me result : loreal's sdn bhd and @ same time want remove special character ( excluding these 4 symbols (-) ,(_) ,('),(,) ) simply escape special character resolve issue. mysqli_real_escape_string resolve issue. $name = mysqli_real_escape_string($request()->user); or use addslashes function() $name = addslashes($request()->user);
Read more

minify - Minimizing css files -

i want know how css files can minimized. currently, using external sites css minifier compress css files. however, after removing whitespaces, comments, etc, file sizes reduced 10-15%. how frameworks bootstrap manage make minimized versions kilobytes. as example, css is: body { background-color: #ff0; } the reduction goes 28 bytes 22 bytes other css files have lot more characters still smaller this. actually minifying code means it's remove thing code white space characters new line characters comments block delimiters it reduces amount of code has transferred on web , speed site load fastly.but unreadable format.
Read more