申请试用
HOT
登录
注册
 
The Adaptive Radix Tree: ARTful Indexing for MainMemory Database

The Adaptive Radix Tree: ARTful Indexing for MainMemory Database

陈傲天
/
发布于
/
1940
人观看
Main memory capacities have grown up to a point where most databases fit into RAM. For main-memory database systems, index structure performance is a critical bottleneck. Traditional in-memory data structures like balanced binary search trees are not efficient on modern hardware, because they do not optimally utilize on-CPU caches. Hash tables, also often used for main-memory indexes, are fast but only support point queries. To overcome these shortcomings, we present ART, an adaptive
9 点赞
3 收藏
0下载
确认
3秒后跳转登录页面
去登陆