MINDS @ UW-Madison

Design Tradeoffs of Alternative Query Tree Representations for Multiprocessor Database Machines

Show simple item record


Files Size Format View
TR869.pdf 2.454Mb application/pdf View/Open
Key Value Language
dc.contributor.author Schneider, Donovan en_US
dc.contributor.author DeWitt, David J en_US
dc.date.accessioned 2012-03-15T16:51:22Z
dc.date.available 2012-03-15T16:51:22Z
dc.date.created 1989 en_US
dc.date.issued 1989
dc.identifier.citation TR869
dc.identifier.uri http://digital.library.wisc.edu/1793/59168
dc.description.abstract During the past five years the design, implementation, and evaluation of joint algorithms that exploit large main memories and parallel processors has received a great deal of attention. However, the methods used to represent join queries and their corresponding effects on performance has received little attention during this same time span. In this paper we examine the tradeoffs imposed by left-deep, right-deep and gushy query trees in a multiprocessor environment. Specifically, we address potential parallelism, memory consumption, support for dataflow processing, and the cost of optimization that are dictated by a particular query tree format. Results indicate that for hash-based join algorithms, right-deep query trees provide the best potential to exploit large multiprocessor database machines. en_US
dc.description.provenance Made available in DSpace on 2012-03-15T16:51:22Z (GMT). No. of bitstreams: 1 TR869.pdf: 2454897 bytes, checksum: 2712b55e32d38b37203e1554e3de4794 (MD5) en
dc.description.provenance Create and issued dates reconciled by Wendt Commons staff on 2014-7-11 (AF). en_US
dc.format.mimetype application/pdf en_US
dc.publisher University of Wisconsin-Madison Department of Computer Sciences en_US
dc.title Design Tradeoffs of Alternative Query Tree Representations for Multiprocessor Database Machines en_US
dc.type Technical Report en_US

Part of

Show simple item record