> Thanks. Just wanted to note that counting the number of rows where foo=bar is
> a fairly ubiquitous task in db applications. In case of "big data",
> trafficking all these data to client just to count something isn't optimal
> at all.

You can ask Cassandra to do the counting, but the cost is still going
to involve reading the data on the Cassandra end. Hence, O(n) rather
than O(1). (It would obviously be nice if counts could be done O(1),
but it's not trivial to implement or obvious how to do it in order for
it to be generally useful. Even non-distributed databases like
PostgreSQL have issues with that.)

-- 
/ Peter Schuller

Reply via email to