Master’s Thesis Presentation • Data Systems — Domain Ordering and Box Cover Problems for Beyond Worst-Case Join Processing

Kaleb Alway, Master’s candidate
David R. Cheriton School of Computer Science

Recent developments in join query processing have lead to join algorithms with runtime proportional to the minimum size of a geometric box certificate for the query instance. Many query instances admit a smaller box certificate when the elements of the attributes' domains are ordered differently. Finding the domain ordering which minimizes the box certificate size improves the runtime of join queries. We present hardness results for this and related box cover problems, as well as algorithms which approximate special cases of the problem.