On Disk Allocation of Intermediate Query Results in Parallel Database Systems

Authors: 
Märtens, Holger
Year: 
1999
Language: 
English
Abstract: 
For complex queries in parallel database systems, substantial amounts of data must be redistributed between operators executed on different processing nodes. Frequently, such intermediate results cannot be held in main memory and must be stored on disk. To limit the ensuing performance penalty, a data allocation must be found that supports parallel I/O to the greatest possible extent. In this paper, we propose declustering even self-contained units of temporary data processed in a single operation (such as individual buckets of parallel hash joins) across multiple disks. Using a suitable analytical model, we find that the improvement of parallel I/O outweighs the penalty of increased fragmentation.
Appeared / Erschienen in: 
Proceedings of Euro-Par '99 Conference, Toulouse, August/September 1999
Pubdate / Erscheinungsdatum: 
1999-08
Promoter / Gefördert durch: 
Deutsche Forschungsgemeinschaft
Pages / Seitenanzahl: 
8
Notes / Bemerkungen: 
The conference proceedings containing this paper were published by Springer-Verlag in the <A HREF='http://www.springer.de/comp/lncs/index.html'>Lecture Notes in Computer Science</A> series. © Springer-Verlag
AttachmentSize
1999-24.pdf76.24 KB