Strongly Minimal MapReduce Algorithms: A TeraSort Case Study

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Strongly Minimal MapReduce Algorithms: A TeraSort Case Study
Συγγραφείς: Xia, DanielAff10, Simpson, MichaelAff10, Srinivasan, VenkateshAff10, Thomo, AlexAff10
Συνεισφορές: Goos, Gerhard, Founding EditorAff1, Hartmanis, Juris, Founding EditorAff2, Bertino, Elisa, Editorial Board MemberAff3, Gao, Wen, Editorial Board MemberAff4, Steffen, Bernhard, Editorial Board MemberAff5, Woeginger, Gerhard, Editorial Board MemberAff6, Yung, Moti, Editorial Board MemberAff7, Herzig, Andreas, editorAff8, Kontinen, Juha, editorAff9
Πηγή: Foundations of Information and Knowledge Systems : 11th International Symposium, FoIKS 2020, Dortmund, Germany, February 17–21, 2020, Proceedings. 12012:301-317
Βάση Δεδομένων: Springer Nature eBooks