Thank you very much! Just read some stuff in the wiki, such as limitations and secondary index. Adding up to what you said, the search in large rows, by which I mean rows with millions of columns, seams to be like searching normal hash instead of btree style.
So model A it is! Once again thank you for responding.
