bokomslag Algorithmic Aspects of Parallel Data Processing
Data & IT

Algorithmic Aspects of Parallel Data Processing

Paraschos Koutris Semih Salihoglu Dan Suciu

Pocket

1739:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-12 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 144 sidor
  • 2018
The last decade has seen a huge and growing interest in processing large data sets on large distributed clusters. This trend began with the MapReduce framework, and has been widely adopted by several other systems, including PigLatin, Hive, Scope, Dremmel, Spark and Myria to name a few. While the applications of such systems are diverse (for example, machine learning, data analytics), most involve relatively standard data processing tasks like identifying relevant data, cleaning, filtering, joining, grouping, transforming, extracting features, and evaluating results. This has generated great interest in the study of algorithms for data processing on large distributed clusters. Algorithmic Aspects of Parallel Data Processing discusses recent algorithmic developments for distributed data processing. It uses a theoretical model of parallel processing called the Massively Parallel Computation (MPC) model, which is a simplification of the BSP model where the only cost is given by the amount of communication and the number of communication rounds. The survey studies several algorithms for multi-join queries, sorting, and matrix multiplication. It discusses their relationships and common techniques applied across the different data processing tasks.
  • Författare: Paraschos Koutris, Semih Salihoglu, Dan Suciu
  • Format: Pocket/Paperback
  • ISBN: 9781680834062
  • Språk: Engelska
  • Antal sidor: 144
  • Utgivningsdatum: 2018-02-22
  • Förlag: now publishers Inc