Title :
A query processing strategy for the decomposed storage model
Author :
Setrag Khoshafian;George Copeland;Thomas Jagodits;Haran Boral;Patrick Valduriez
Author_Institution :
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.
Conference_Titel :
Data Engineering, 1987 IEEE Third International Conference on
Print_ISBN :
978-0-8186-0762-2
DOI :
10.1109/ICDE.1987.7272433