|
|---|
|
|
|
|
|
|
H******7
发帖数: 1728 | 1 说：
YOU Have to design a database that can store terabytes of date. It should
support efficient range queries. How
would you do it?
书上答案是
Use B+ tree.
省略一些解释
大家觉得这个回答好么？
为什么ｔｂ级别就要用ｂ+ ｔｒｅｅ?
那pb级别呢？ｂ+ｔｒｅｅ还给力不？上ｍａｐ-ｒｅｄｕｃｅ? | t****0
发帖数: 235 | 2
should
【在 H******7 的大作中提到】
: 说：
: YOU Have to design a database that can store terabytes of date. It should
: support efficient range queries. How
: would you do it?
: 书上答案是
: Use B+ tree.
: 省略一些解释
: 大家觉得这个回答好么？
: 为什么ｔｂ级别就要用ｂ+ ｔｒｅｅ?
: 那pb级别呢？ｂ+ｔｒｅｅ还给力不？上ｍａｐ-ｒｅｄｕｃｅ?
| j*****u
发帖数: 1133 | 3 I think the reason to pick B+ tree is to support range queries not because o
f data in tb size. size doesn't matter for B+ tree as long as you have enoug
h storage.
【在 H******7 的大作中提到】
: 说：
: YOU Have to design a database that can store terabytes of date. It should
: support efficient range queries. How
: would you do it?
: 书上答案是
: Use B+ tree.
: 省略一些解释
: 大家觉得这个回答好么？
: 为什么ｔｂ级别就要用ｂ+ ｔｒｅｅ?
: 那pb级别呢？ｂ+ｔｒｅｅ还给力不？上ｍａｐ-ｒｅｄｕｃｅ?
|
|
|
|
|
|
|
