23 citations · 42 across the 3 of their papers we have counts for
3 papers
cs.DB2019
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins
Amine Mhedhbi, Semih Salihoglu
We study the problem of optimizing subgraph queries using the new worst-case optimal join plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time us…
cs.DC2012★ 19 cited
Upper and Lower Bounds on the Cost of a Map-Reduce Computation
Foto N. Afrati, Anish Das Sarma, Semih Salihoglu +1
In this paper we study the tradeoff between parallelism and communication cost in a map-reduce computation. For any problem that is not "embarrassingly parallel," the finer we part…
cs.DB2012★ 23 cited
Vision Paper: Towards an Understanding of the Limits of Map-Reduce Computation
Foto N. Afrati, Anish Das Sarma, Semih Salihoglu +1
A significant amount of recent research work has addressed the problem of solving various data management problems in the cloud. The major algorithmic challenges in map-reduce comp…