原始二叉树数据库还是 MongoDb/MySQL/等？
我将在索引之前和压缩方法之后存储数 TB 的信息。
我应该使用排序文件等手动编写二叉树数据库，还是使用 MongoDB 甚至 MySQL 之类的东西？
我担心 MySQL 和其他数据库的每条记录的（空间）成本。我还知道有些数据库甚至允许压缩，但它们会转换为只读表。这些表/记录需要经常被新数据访问和覆盖。我想如果我用 C++ 编写一些东西，我就能将每条记录的空间成本保持在最低限度。
我应该怎么办？
I will be storing terabytes of information, before indexes, and after compression methods.
Should I code up a Binary Tree Database by hand using sort files etc, or use something like MongoDB or even something like MySQL?
I am worried about (space) cost per record with things like MySQL and other DB's that are around. I also know that some databases even allow for compression, but they convert to read only tables. These tables/records need to be accessed and overwritten with new data fairly often. I think if I were to code something in C++ I'd be able to keep the cost of space per record to a minimum.
What should I do?
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
如今，一些新的非关系数据库正在变得流行，它们专门用于管理大规模数据。
查看 Hadoop 或 Cassandra，这两个都在 Apache 项目中。
There are new non-relational databases that are becoming popular these days, that specialize in managing large-scale data.
Check out Hadoop or Cassandra, both of these are at the Apache Project.