| Document Date: 2013-04-25 03:37:48
Open Document File Size: 351,62 KBShare Result on Facebook
City Trento / / Company THALES / Multiway Join / Google / / Country Italy / / Currency pence / USD / / / Facility Jeffrey D. Ullman‡ National Technical University of Athens / / IndustryTerm constructive algorithms / serial algorithm / map-reduce algorithms / triangle-finding algorithm / distributed computing environment / map-reduce solution / business to business / map-reduce algorithm / trivial algorithms / social networks / online technical report / possible mapreduce algorithms / virtual processors / derived using multiple constructive algorithms / / Organization VLDB Endowment / NB NC / Stanford University / European Union / European Social Fund / National Technical University of Athens / / Person Foto Afrati / Jeff Ullman / Riva del Garda / Anish Das Sarma / Jeffrey D. Ullman / / Position representative / General / reduce-worker / / SportsLeague Stanford University / / Technology 3.4 An Algorithm / triangle-finding algorithm / certain algorithm / possible mapreduce algorithms / map-reduce algorithms / two-round map-reduce algorithms / serial algorithm / map-reduce algorithm / The algorithm / Dom / Dimensions The algorithm / one-round algorithm / one-round map-reduce algorithms / /
SocialTag |
Upper and Lower Bounds on the Cost of a Map-Reduce Computation ∗ Foto N. Afrati† , Anish Das Sarma] , Semih Salihoglu‡ , Jeffrey D. Ullman‡ National Technical University of Athens, ] Google Research, ‡ Stanford