Hi, I've seen a similar question has been asked in this forum in Sept, but not answered.
What is the complexity of get(row) and get(row, column-name) operations, and insert(row, column)? What about accessing or inserting a column within a SuperColumn by name? In Arin Sarkissian's "WTF is a Supercolumn" he stresses that columns are stored sorted by name. Are they simply stored in a sorted list, requiring a search when inserting and accessing (I forget the worst case complexity of searching/inserting into/deleting from a sorted list), or in some data structure with faster access? Even if you don't know the big-O complexity, a description of the implementation data structure(s), and discussion of what is fast and what is not, would help. Thanks for your help, Kevin.
