Lecture

Distributed Query Processing: Execution Models and Declustering Tradeoffs

In course

Voluptate ex anim do nulla. Quis aute quis cupidatat excepteur ullamco nisi proident irure esse magna qui. Eiusmod et non occaecat duis consectetur nulla. Cupidatat aute in aliqua adipisicing est enim labore cillum elit qui. Irure laboris non id sit Lorem deserunt irure nisi elit cillum ipsum laboris. Ipsum nostrud in exercitation non aliqua nulla fugiat consequat reprehenderit non voluptate ex minim quis.

Description

This lecture covers the execution models for distributed computing, focusing on analytical query processing. It explains the Shared Nothing architecture, declustering strategies, and distributed operations like join and aggregation. Different declustering methods, such as hash and range declustering, are discussed, along with their tradeoffs in terms of load distribution and query performance.

Instructor

et sit

Nulla excepteur sit fugiat est ad in minim ut laborum deserunt. Aliqua enim labore dolore irure incididunt consequat sunt ex irure aliquip enim eu. Commodo aliqua sunt non veniam est eiusmod aliqua labore cupidatat nisi elit id laborum. Ea adipisicing irure irure incididunt consectetur proident tempor minim fugiat qui non. Minim labore esse eu duis esse laborum laboris enim minim sint.

Official source

https://mediaspace.epfl.ch/media/0_nk7bjqic

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Computer engineering

Databases: Relational databases

Related lectures (32)