What about the indexing when=
adding a new element? Is it incremental?

Thanks a=
gain

--90e6ba4fc3a0032fd20496fd9881--
On 9 December 2010 14:38, David Boxe=
nhorn <david@look=
in2.com> wrote:

How about a regular CF whe= re keys are N@N ?

Then, getting a matrix row would be the same cost = as getting a matrix column (N gets), and it would be very easy to add eleme= nt N+1.

On Thu, Dec 9, 2010 at 1:48 PM, S=E9bastien Druon <sdruon@spotuse.com= > wrote:Hello,For a specific case, we are thinking about repres= enting a N to N relationship with a NxN Matrix in Cassandra.The = relations will be only between a subset of elements, so the Matrix will mos= tly contain empty elements.We have a set of questions concerning this:-= what is the best way to represent this matrix? what would have the best pe= rformance in reading? in writing?=A0=A0. a super column family w= ith n column families, with n columns each=A0=A0. a column family with n columns and n linesIn the second case, we would need to extract 2 kinds of information:<= /div>- all the relations for a line: this should be no specific proble= m;- all the relations for a column: in that case we would need an index = for the columns, right? and then get all the lines where the value of the c= olumn in question is not null... is it the correct way to do?When using indexes, say we want to add another element N+1. What impact in = terms of time would it have on the indexation job?Thanks a lot for the answers,Best regards,S=E9bastien Druon