Composite semijoins in distributed query processing (Q749211)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4172371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Composite semijoins in distributed query processing |
scientific article; zbMATH DE number 4172371 |
Statements
Composite semijoins in distributed query processing (English)
0 references
1990
0 references
This paper deals with minimizing the response time for distributed queries, using the composite semijoin operation. A composite semijoin is a semijoin in which the projection and transmission involve multiple columns. Several sets of distributed query processing algorithms are considered and these algorithms are extended to include the reductions produced by composite semijoins. A simulation experiment is developed to show that the composite algorithms are superior to the algorithms without the composites.
0 references
data transmission reduction
0 references
composite semijoin
0 references
distributed query processing
0 references
0.7891011834144592
0 references
0.7861281037330627
0 references
0.7847825288772583
0 references
0.7845938801765442
0 references
