如果有任何关于 Redis 的性能测量 它可以同时处理多少个订阅/ channel ?
最佳答案
我还没有看到这方面的基准,但推送到订阅 channel 的复杂性在 O(N) 系列中。 来自文档:
发布:
O(N+M) where N is the number of clients subscribed to the
receiving channel and M is the total number of subscribed
patterns (by any client).
PSUBSCRIBE(订阅模式):
O(N) where N is the number of patterns the client is already subscribed to.
订阅:
O(N) where N is the number of channels to subscribe to.
关于javascript - redis 处理 'N' 没有连接的能力?,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/9614042/