Massively Parallel Evaluation of Relational Queries II

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=MY-7DyLRVEc


Duration: 39:20
313 views
8

Xiao Hu (University of Waterloo), Paris Koutris (UW Madison)
https://simons.berkeley.edu/talks/xiao-hu-university-waterloo-2023-09-27
Fine-Grained Complexity Logic and Query Evaluation



Other Videos By Simons Institute for the Theory of Computing


2023-10-06Machine-Checked Proofs and the Rise of Formal Methods in Mathematics | Theoretically Speaking
2023-10-04A Theory of Alternating Paths and Blossoms, from the Perspective of Minimum Length pt.2
2023-10-04A Theory of Alternating Paths and Blossoms, from the Perspective of Minimum Length
2023-10-03The Power of Graph Learning | Richard M. Karp Distinguished Lecture
2023-09-29Incremental View Maintenance: Beyond Worst-Case Analysis II
2023-09-29Incremental View Maintenance: Beyond Worst-Case Analysis I
2023-09-28Fine-Grained Complexity and Algorithm Design for Graph Reachability and Distance Problems
2023-09-28Optimizing Relational Programs II
2023-09-28Optimizing Relational Programs I
2023-09-27Distributed Graph Techniques in the MPC Model
2023-09-27Massively Parallel Evaluation of Relational Queries II
2023-09-27Massively Parallel Evaluation of Relational Queries I
2023-09-26Intermediate Relational Algorithm Design
2023-09-26Introduction to Relational Algorithms
2023-09-25Accessing Answers to Unions of Conjunctive Queries with Ideal Time Guarantees: I
2023-09-25Fine Grained Complexity
2023-09-25Accessing Answers to Unions of Conjunctive Queries with Ideal Time Guarantees: II
2023-09-22Accelerating the Multiplicative-Weights Framework for Graph Linear Programs
2023-09-22Parallel Batch-Dynamic Graph Algorithms
2023-09-22Recent Progress on Sublinear Time Algorithms for Maximum Matching: Lower Bounds
2023-09-21Faster High Accuracy Multi-Commodity Flows via Graph Techniques


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Fine-Grained Complexity Logic and Query Evaluation
Xiao Hu
Paris Koutris