.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
Efficient algorithms for processing large volumes of data are very important both for relational and new object-oriented 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 to sort-based algorithms such as merge-join. In this article, we compare the concepts behind sort- and hash-based query-processing algorithms and conclude that 1) many dualities exist between the two types of algorithms, 2) their costs differ mostly by percentages rather than factors, 3) several special cases exist that favor one or the other choice, and 4) there is a strong reason why both hash- and sort-based algorithms should be available in a query-processing system. Our conclusions are supported by experiments performed using the Volcano query execution engine.
Keyword:
DATABASE QUERY PROCESSING
VALUE-MATCHING
PERFORMANCE
SORTING
MERGE-JOIN
HASHING
HASH JOIN
HYBRID HASH JOIN
COMPARISON
DUALITY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏Electric field effects on the droplet structure in polymer dispersed cholesteric liquid crystals电场对聚合物分散胆甾相液晶中液滴结构的影响.png)
PREAI
分享收藏
查看更多内容