Show simple item record

dc.contributor.authorBizarro, Pedroen_US
dc.contributor.authorDeWitt, Daviden_US
dc.date.accessioned2012-03-15T17:20:23Z
dc.date.available2012-03-15T17:20:23Z
dc.date.created2006en_US
dc.date.issued2006en_US
dc.identifier.citationTR1562en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60498
dc.description.abstractDatabase catalogs often do not contain enough statistical information to correctly cost all possible physi-cal plans. In their absence, the optimizer can produce incorrect estimates and select suboptimal plans for execution. To address this problem for a subclass of queries, we propose SHARP, a new multijoin, adaptive, relational operator that joins three or more relations of a star-join. SHARP reduces the possible impact of optimizer mistakes by determining which plan to execute independently of optimization estimates. During normal query processing, SHARP collects statistics, and by using a combination of late-binding plan decisions and tuple routing strategies, it is able to change join order and table access methods. However, unlike previous tuple routing operators used for in memory stream processing, SHARP was designed to process local relations with sizes much larger than available memory. We have implemented SHARP in the open-source DBMS Predator, and we present an extensive experimental evaluation showing the significant performance benefits of SHARP.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleAdaptive and Robust Query Processing with SHARPen_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