Hbase 或 BigTable 是否像大型矩阵存储？
我一直在对 HBase 和 Google 的 BigTable 进行一些研究。
对我来说，HBase 和 BigTable 看起来就像一个巨大的 Matrix 存储。
每个行键映射到一个大的 m*n 矩阵（X），其中 m 是总行数，n 是总列数。 X总共由Q个k*2矩阵组成。其中 m=Q*k, n=2*Q
是这样吗？
谢谢！
I have been doing some research on the HBase and Google's BigTable.
HBase and BigTable look like a massive Matrix store for me.
Each row key is mapped to a big m*n matrix(X), which m is the number of total rows, n is the number of total columns. And X consists total of Q k*2 matrices. Which m=Q*k, n=2*Q
Is this right?
Thanks!
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
看待 HBase 有不同的逻辑方式。您当然可以将其用作大型稀疏矩阵。不过，你的描述对我来说似乎有点不对劲。
一个表就是一个矩阵；行由列族组成；列族由列限定符组成。每个列限定符可以有 N 个版本。实际上，您不希望在当前实现中拥有过多的列族。因此，从矩阵的角度来看，最好将每个表/行视为具有单个列族。
另外，您对 X、Q 和 k 的定义不清楚。数学符号应该是精确的，但如果你在没有定义术语的情况下使用它，它只会让它变得难以理解。
There are different logical ways of looking at HBase. You certainly can use it as a large sparse matrix. Your description seemed slightly off to me however.
A table is a matrix; rows are composed of column families; column families are composed of column qualifiers. Each column qualifier can have N versions. Practically, you don't want to have more than a small number of column families in the current implementation. So, from a matrix point of view, it is best to think of each table/row as having a single column family.
Also, your definition of X, Q, and k are not clear. Mathematical notation is supposed to be precise, but if you use it without defining your terms, it just makes it impenetrable.