I haven't actually tried to use that schema yet, it was just my first idea.
If we use that solution our app would have to read the whole table once a
day or so to find the top 5000'ish words.
On Fri, Jan 17, 2014 at 2:49 PM, Jonathan Lacefield jlacefi...@datastax.com
wrote:
Hi David,
How
When updating, use table that uses rows of words and increment the count?
--
Colin
+1 320 221 9531
On Jan 20, 2014, at 6:58 AM, David Tinker david.tin...@gmail.com wrote:
I haven't actually tried to use that schema yet, it was just my first idea.
If we use that solution our app would
Hi David,
How do you know that you are receiving a seek for each row? Are you
querying for a specific word at a time or do the queries span multiple
words, i.e. what's the query pattern? Also, what is your goal for read
latency? Most customers can achieve microsecond partition key base query
I have an app that stores lots of bits of text in Cassandra. One of
the things I need to do is keep a global word frequency table.
Something like this:
CREATE TABLE IF NOT EXISTS word_count (
word text,
count value,
PRIMARY KEY (word)
);
This is slow to read as the rows (100's of thousands