Available since: 6.2.0
Time complexity: O(NK)+O(Mlog(M)) worst case with N being the smallest input sorted set, K being the number of input sorted sets and M being the number of elements in the resulting sorted set.
This command is similar to
ZINTERSTORE, but instead of storing the resulting
sorted set, it is returned to the client.
For a description of the
AGGREGATE options, see
Array reply: the result of intersection (optionally with their scores, in case
WITHSCORES option is given).