![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BeyondMR@SIGMOD 2016: San Francisco, CA, USA
- Foto N. Afrati, Jacek Sroka, Jan Hidders:
Proceedings of the 3rd ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, BeyondMR@SIGMOD 2016, San Francisco, CA, USA, July 1, 2016. ACM 2016, ISBN 978-1-4503-4311-4 - Andreas Kunft, Alexander Alexandrov, Asterios Katsifodimos, Volker Markl:
Bridging the gap: towards optimization across linear and relational algebra. 1 - Andrea Lattuada, Frank McSherry, Zaheer Chothia:
Faucet: a user-level, modular technique for flow control in dataflow engines. 2 - Bingjing Zhang, Bo Peng, Judy Qiu:
Model-centric computation abstractions in machine learning applications. 3 - Gösta Grahne, Shahab Harrafi, Iraj Hedayati, Ali Moallemi:
DFA minimization in map-reduce. 4 - Johannes Schildgen, Thomas Lottermann, Stefan Deßloch:
Cross-system NoSQL data transformations with NotaQL. 5 - Harunobu Daikoku, Hideyuki Kawashima, Osamu Tatebe:
On exploring efficient shuffle design for in-memory MapReduce. 6 - Jingjing Wang, Magdalena Balazinska:
Toward elastic memory management for cloud data analytics. 7 - Jeffrey D. Ullman, Jonathan R. Ullman:
Some pairs problems. 8 - Prakash Ramanan, Ashita Nagar:
Tight bounds on one- and two-pass MapReduce algorithms for matrix multiplication. 9 - Paraschos Koutris, Nivetha Singara Vadivelu:
Deterministic load balancing for parallel joins. 10
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.