What is wrong with using the SORT method as you described, other than
perhaps needlessly sorting the hashes before returning them (and
couldn't you use the 'nosort' option of SORT?) Does the GET user_*
properly return all fields of every hash referenced by the list?
Am I the only one who finds the concrete instruction set of Redis
rather annoying, as it must be for the developers to keep thinking of
mnemonics for new operations, and for client library maintainers. Why
couldn't plain MGET key, key, ... work polymorphically for all data
types, not just string values? And also accept an offset and limit?
What about maintaining sorted lists with O(log(N)) operations for
insert that are able to reference hash keys? e.g.,
LINSERT theList by user_*->name newUserId