FRAGMENTATION - A TECHNIQUE FOR EFFICIENT QUERY-PROCESSING

被引：20
|
作者：
SACCO, GM
机构：
[1] Univ di Torino, Turin, Italy, Univ di Torino, Turin, Italy
来源：
ACM TRANSACTIONS ON DATABASE SYSTEMS | 1986年 / 11卷 / 02期
关键词：
COMPUTER PROGRAMMING - Algorithms;
D O I：
10.1145/5922.5638
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A 'divide and conquer' strategy to compute natural joins by sequential scans on unordered relations is described. This strategy is shown to always be better than merging scans when both relations must be sorted before joining, and generally better in practical cases when only the largest relation must be sorted.
引用
收藏
页码：113 / 133
页数：21
相关论文
共 50 条
12345