Thank you Peter. Following your suggestions, of using key of super column as range token won't I have a storage problem?
I couldn't find information about this so I'll just ask: If I have a (Super/)ColumnFamily that contains 1 "key" for the row but that row contains millions of k:v entries. Would that be a efficient Cassandra design? Does cassandra store a CF row on a single now or can it / should it distribute this data? Does having millions of k:v entries in a single row of a CF would be considered a good practice? (in terms of query time, range scans and co ?) Thank you, Maxim. On Sun, Jan 23, 2011 at 11:14 AM, Peter Schuller < [email protected]> wrote: > > I'm new to dynamo. I'm looking to implement something similar to prefix > > search for keys (much like S3 allows you to list all the keys that match > a > > certain prefix). > > Can I implement this with Cassandra? I'm using Hector as the client but > > would gladly go thrift is necessary. > > Range queries on keys is possible when using the order preserving > partitioner; see the partitioner section of: > > http://wiki.apache.org/cassandra/StorageConfiguration > > In addition, range slicing is supported within a single row, based on > column names, independently of which partitioner is used. Depending on > whether your data is such that you can suitably put whatever is to be > range queried over into a single row, that may allow you to do this > without using the order preserving partitioner (which has some > downsides in that ring balancing becomes more difficult). > > -- > / Peter Schuller >
