In response to the ever increasing scale, distribution, and complexity of data processing, database research in the past few years has focused on adaptive query processing. However, many of these solutions, although aimed at processing wide-area data, remain centralized solutions. In this paper, we present FREddies, an extension of the centralized Eddy operator for use in a P2P query processing system. FREddies operate within the framework of PIER, a DHT-based P2P query processor. FREddies optimize the query during runtime and require no global knowledge. We show that FREddies using rudimentary routing policies can perform competitively with a traditional static query optimization approach. Furthermore, we validate our simulation results in the real world environment of PlanetLab.
Title
FREddies: DHT-Based Adaptive Query Processing via FedeRated Eddies
Published
2004-07-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-04-1339
Type
Text
Extent
12 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
