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.
Fragmentation: a technique for efficient query processing
SACCO, Giovanni
1986-01-01
Abstract
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
p113-sacco-tods-frag.pdf
Accesso riservato
Tipo di file:
POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione
951.73 kB
Formato
Adobe PDF
|
951.73 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
