Asserting the optimality of serial SJRPs in processing simple queries in chain networks (Q1061509)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Asserting the optimality of serial SJRPs in processing simple queries in chain networks |
scientific article; zbMATH DE number 3911757
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asserting the optimality of serial SJRPs in processing simple queries in chain networks |
scientific article; zbMATH DE number 3911757 |
Statements
Asserting the optimality of serial SJRPs in processing simple queries in chain networks (English)
0 references
1984
0 references
It is shown that the optimal strategy for processing a simple query in a chain network under the total time minimalization objective can be obtained as a strictly serial sequence of semi-join operations or as two such sequences merging only at the resulting node.
0 references
distributed database systems
0 references
query processing
0 references
chain network
0 references
semi-join
0 references
