申请试用
HOT
登录
注册
 
Sort vs. Hash Revisited

Sort vs. Hash Revisited

陈傲天
/
发布于
/
1766
人观看
Efficient algorithms for processing large volumes of data are very important both for relational and new objectoriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g., intersection, join, and duplicate elimination. In the early relational database systems, only sort-based algorithms were employed. In the last decade, hash-based algorithms have gained acceptance and popularity, and are often considered generally superior
0 点赞
0 收藏
2下载
确认
3秒后跳转登录页面
去登陆