| Document Date: 2007-09-13 17:09:38
Open Document File Size: 523,58 KBShare Result on Facebook
City Beijing / / Company AT&T / Sprint / Yahoo! / Intel / / Country China / / Currency USD / / Event FDA Phase / / Facility Fortran library / JLAPACK library / Ion Stoica University of California at Berkeley / / IndustryTerm Search strategies / heuristic approximation algorithm / linear decomposition algorithms / target solution / lightweight synchronization protocol / query processing / numerical computing / solutions / exhaustive search solution qis / possible search strategies / in-network processing / real time / search strategy / query processor / search loops / possible solutions / deconstruction algorithm / correct solution / search algorithm / intelligent data-processing algorithms / basis solution / basic algorithm / reconstruction algorithm / algorithmic solution / basic decomposition algorithm / overall search space / decomposition algorithms / then search / heuristic algorithm / no-sharing solution / search loop strategies / large-scale distributed query processing engine / search strategies possible / heuristic algorithms / search loop / conservative optimization algorithm / numerical computing literature / large-scale distributed monitoring applications / our other solutions / search space / overlay network / distributed query systems / decomposition algorithm / / OperatingSystem Linux / / Organization University of California / Network Operations Center / ASIC / / Person Joseph M. Hellerstein / Ryan Huebsch / / / Position General / coordinator / garbage collector / representative / / Product ATi / decomposition / / ProgrammingLanguage Java / C / Fortran / Fortran 77 / / ProvinceOrState Oregon / California / / Technology heuristic algorithm / RAM / three algorithms / heuristic approximation algorithm / search algorithm / Linux / previous algorithms / linear decomposition algorithms / intelligent data-processing algorithms / basic decomposition algorithm / DUP-INSENSITIVE AGGREGATES The previous algorithms / lightweight synchronization protocol / ASIC / conservative optimization algorithm / specific deconstruction algorithm / DNS / Java / DHT-based P2P query processor / specific decomposition algorithm / Basic Composition algorithm / ISP / decomposition algorithms / simulation / OMPOSITION algorithm / reconstruction algorithm / decomposition algorithm / Network Operations Center / basic algorithm / /
SocialTag |
Sharing Aggregate Computation for Distributed Queries Ryan Huebsch, Minos Garofalakis, Joseph M. Hellerstein, and Ion Stoica University of California at Berkeley, Intel Research Berkeley & Yahoo! Research ABSTRACT An eme