redis在處理'N'no連接的能力？

Question

如果使用Redis以 可以處理多少個同步訂閱/通道，有任何性能測量？

Answer 1

我還沒有看到這方面的基準，但推送到訂閱頻道的複雜性是在O（N）家庭。 從文檔：

PUBLISH：

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. 

SUBSCRIBE：

O(N) where N is the number of channels to subscribe to.