Affiliation:
1. Universita` di Torino, Italy
Abstract
A “divide and conquer” strategy to compute natural joins by sequential scans on unordered relations is described. This strategy is shown to always he better than merging SCBIIS when both relations must he sorted before joining, and generally better in practical cases when only the largest relation mutt be sorted.
Publisher
Association for Computing Machinery (ACM)
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Buffer Management;Encyclopedia of Database Systems;2018
2. Buffer Management;Encyclopedia of Database Systems;2017
3. Particle swarm optimisation for data warehouse logical design;International Journal of Bio-Inspired Computation;2012
4. A hash partition strategy for distributed query processing;Advances in Database Technology — EDBT '96;1996
5. Fast algorithms for universal quantification in large databases;ACM Transactions on Database Systems;1995-06