Lecture

Optimization in Large Search Spaces: GPU-Accelerated Join Order

Description

This lecture covers the optimization in large search spaces, focusing on GPU-accelerated join order. It discusses highly able but too much work, landscape of optimal join order algorithms, and leveraging graph topology to reduce computational overheads. The instructor presents massively parallel dynamic programming, trees, and the key idea of join graph conscious subset generation. The lecture also explores a new dynamic programming variant with high parallelizability and low computational overheads, providing heuristic solutions for larger queries. It concludes with a summary of optimization times for star queries and MusicBrainz dataset, showcasing the efficiency of GPU-accelerated optimization.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace
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.