Re: cli composite type literal with empty string component

2012-02-08 Thread Bryce Allen
In case anyone else is curious about what is going on here: https://github.com/pycassa/pycassa/issues/112 The links to the Cassandra JIRA are instructive. -Bryce On Wed, 8 Feb 2012 10:59:37 -0600 Bryce Allen wrote: > Never mind; the issue with addressing composite column names with >

Re: cli composite type literal with empty string component

2012-02-08 Thread Bryce Allen
2012 10:25:07 -0600 Bryce Allen wrote: > I have a CF defined like this in CLI syntax: > > create column family Test > with key_validation_class = UTF8Type > and comparator = 'CompositeType(AsciiType, UTF8Type)' > and default_validation_class = UTF8Ty

cli composite type literal with empty string component

2012-02-08 Thread Bryce Allen
I have a CF defined like this in CLI syntax: create column family Test with key_validation_class = UTF8Type and comparator = 'CompositeType(AsciiType, UTF8Type)' and default_validation_class = UTF8Type and column_metadata = [ { column_name : 'deleted:', validation

Re: two dimensional slicing

2012-01-30 Thread Bryce Allen
On Mon, 30 Jan 2012 11:14:37 -0600 Bryce Allen wrote: > With RP, the idea is to query many versions in ListVersionIndex > starting at the desired version going backward, hoping that it will > hit a compact version. We could also maintain a separate > CompactVersion index, and accept a

Re: two dimensional slicing

2012-01-30 Thread Bryce Allen
list every version update? > > CF: VersionedList > row: > col_name: name > col_value: last updated version > > So you slice one row at the upper version and discard all the columns > where the value is less than the lower version ? > > Cheers > > ---

Re: two dimensional slicing

2012-01-26 Thread Bryce Allen
o implement both and compare them, but at this point I need to focus on one to get things working, so I'm trying to make a best initial guess. > > On 21/01/2012, at 6:20 AM, Bryce Allen wrote: > > > I'm storing very large versioned lists of names, and I'd like to > &

two dimensional slicing

2012-01-20 Thread Bryce Allen
I'm storing very large versioned lists of names, and I'd like to query a range of names within a given range of versions, which is a two dimensional slice, in a single query. This is easy to do using ByteOrderedPartitioner, but seems to require multiple (non parallel) queries and extra CFs when usi

Re: How to reliably achieve unique constraints with Cassandra?

2012-01-06 Thread Bryce Allen
e about ZooKeeper, but I know if you have a partition > between HazelCast nodes, than the nodes can acquire the same lock > independently in each divided partition. How does ZooKeeper handle > this situation? > > -- Drew > > > On Jan 6, 2012, at 12:48 PM, Bryce Allen wro

Re: How to reliably achieve unique constraints with Cassandra?

2012-01-06 Thread Bryce Allen
with it explicitly. > > On Fri, Jan 6, 2012 at 1:16 PM, Bryce Allen > wrote: > > This looks like it: > > http://cassandra-user-incubator-apache-org.3065146.n2.nabble.com/Implementing-locks-using-cassandra-only-tp5527076p5527076.html > > > > There's also some

Re: How to reliably achieve unique constraints with Cassandra?

2012-01-06 Thread Bryce Allen
ck, to prevent the issue you > describe below. > > There was a pretty detailed discussion of locking with only Cassandra > a month or so back on this list. > > -Jeremiah > > On 01/06/2012 02:42 PM, Bryce Allen wrote: > > On Fri, 6 Jan 2012 10:38:17 -0800 > >

Re: How to reliably achieve unique constraints with Cassandra?

2012-01-06 Thread Bryce Allen
On Fri, 6 Jan 2012 10:03:38 -0800 Drew Kutcharian wrote: > I know that this can be done using a lock manager such as ZooKeeper > or HazelCast, but the issue with using either of them is that if > ZooKeeper or HazelCast is down, then you can't be sure about the > reliability of the lock. So this po

Re: How to reliably achieve unique constraints with Cassandra?

2012-01-06 Thread Bryce Allen
On Fri, 6 Jan 2012 10:38:17 -0800 Mohit Anchlia wrote: > It could be as simple as reading before writing to make sure that > email doesn't exist. But I think you are looking at how to handle 2 > concurrent requests for same email? Only way I can think of is: > > 1) Create new CF say tracker > 2)

Re: Choosing a Partitioner Type for Random java.util.UUID Row Keys

2011-12-22 Thread Bryce Allen
---- > Aaron Morton > Freelance Developer > @aaronmorton > http://www.thelastpickle.com > > On 21/12/2011, at 9:03 AM, Bryce Allen wrote: > > > I wasn't aware of CompositeColumns, thanks for the tip. However I > > think it still doesn't allow me to do the q

Re: Choosing a Partitioner Type for Random java.util.UUID Row Keys

2011-12-20 Thread Bryce Allen
e all columns with a particular time stamp. > > Even if you have a random key, I would use the RP unless you > have an extreme use case. > > Cheers > > - > Aaron Morton > Freelance Developer > @aaronmorton > http://www.thelastpickle.com > > On 21

Re: Choosing a Partitioner Type for Random java.util.UUID Row Keys

2011-12-20 Thread Bryce Allen
I think it comes down to how much you benefit from row range scans, and how confident you are that going forward all data will continue to use random row keys. I'm considering using BOP as a way of working around the non indexes super column limitation. In my current schema, row keys are random UU