Suppose there is only one node with R rows. What is the theoretical time complexity of Cassandra's main operations?
In particular, I want to know:
key = item. I guess this is O(log(R))right?key > item, that is, a slice. Will C * display all lines of R to judge whether the condition is met, which leads to O(R)? What about ordered rows?key > 10 AND key < 12. Will C * first select everything that matches key > 10and then filter with key < 12? Or will C * combine them into one condition for a request?
source
share