Sciweavers

ICDE
1987
IEEE

A Query Processing Strategy for the Decomposed Storage Model

14 years 3 months ago
A Query Processing Strategy for the Decomposed Storage Model
Handling parallelism in database systems involves the specification of a storage model, a placement strategy, and a query processing strategy. An important goal is to determine the appropriate combination of these three strategies in order to obtain the best performance advantages. In this paper we present a novel and promising query processing strategy for a decomposed storage model. We discuss some of the qualitative advantages of the scheme. We also compare the performance of the proposed "pivot" strategy with conventional query processing for the n-ary storage model. The comparison is performed using the Wisconsin Benchmarks.
Setrag Khoshafian, George P. Copeland, Thomas Jago
Added 28 Aug 2010
Updated 28 Aug 2010
Type Conference
Year 1987
Where ICDE
Authors Setrag Khoshafian, George P. Copeland, Thomas Jagodis, Haran Boral, Patrick Valduriez
Comments (0)