Show simple item record

dc.contributor.authorSchneider, Donovanen_US
dc.contributor.authorDeWitt, David Jen_US
dc.date.accessioned2012-03-15T16:51:22Z
dc.date.available2012-03-15T16:51:22Z
dc.date.created1989en_US
dc.date.issued1989
dc.identifier.citationTR869
dc.identifier.urihttp://digital.library.wisc.edu/1793/59168
dc.description.abstractDuring 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.format.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleDesign Tradeoffs of Alternative Query Tree Representations for Multiprocessor Database Machinesen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record