The Community for Technology Leaders
1987 IEEE Third International Conference on Data Engineering (1987)
Los Angeles, CA, USA
Feb. 3, 1987 to Feb. 5, 1987
ISBN: 978-0-8186-0762-2
pp: 636-643
Setrag Khoshafian , Microelectronics and Computer Technology Corporation, Austin, Texas, United States
George Copeland , Microelectronics and Computer Technology Corporation, Austin, Texas, United States
Thomas Jagodits , Microelectronics and Computer Technology Corporation, Austin, Texas, United States
Haran Boral , Microelectronics and Computer Technology Corporation, Austin, Texas, United States
Patrick Valduriez , Microelectronics and Computer Technology Corporation, Austin, Texas, United States
ABSTRACT
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.
INDEX TERMS
CITATION

S. Khoshafian, G. Copeland, T. Jagodits, H. Boral and P. Valduriez, "A query processing strategy for the decomposed storage model," 1987 IEEE Third International Conference on Data Engineering(ICDE), Los Angeles, CA, USA, 1987, pp. 636-643.
doi:10.1109/ICDE.1987.7272433
193 ms
(Ver 3.3 (11022016))