BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Information Systems Group - ECPv6.4.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://isg.ics.uci.edu
X-WR-CALDESC:Events for Information Systems Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260306T130000
DTEND;TZID=America/Los_Angeles:20260306T140000
DTSTAMP:20260422T134819
CREATED:20260219T064700Z
LAST-MODIFIED:20260219T065044Z
UID:2311-1772802000-1772805600@isg.ics.uci.edu
SUMMARY:Zheng LUO (UCLA):  Generating Join Trees for Yannakakis Algorithm
DESCRIPTION:ISG seminar on March 6\, Friday\, 1 – 2 pm\, DBH 3011 \nTitle: Generating Join Trees for Yannakakis Algorithm \nAbstract:\nMost research on query optimization has centered on binary join algorithms like hash join and sort-merge join. However\, recent years have seen growing interest in theoretically optimal algorithms\, notably Yannakakis algorithm. These algorithms require new optimization techniques\, as they rely on join trees where each node represents a relation\, very different from the operator trees for binary joins.\nOur recent theoretical work proposes three approaches to constructing join trees for Alpha-acyclic queries:\n(1) an algorithm to enumerate all join trees\, which forms the basis of a cost-based optimizer;\n(2) a 1-shot approach to construct a unique shallowest join tree for any Berge-acyclic query\, thus enabling parallel execution of large join queries;\n(3) a simple algorithm that converts any connected left-deep linear plan of a Gamma-acyclic query into a join tree\, allowing reuse of existing optimizers developed for binary joins.\nIn this talk\, we will also discuss how the theoretical results can turbocharge query processing in modern database systems. \nBio:\nZheng LUO is a Ph.D. student at the University of California\, Los Angeles (UCLA)\, advised by Prof. Remy WANG.\nHis research interests are twofold\, spanning from theory to systems.\n(1) His current work centers on the theoretical aspects of query optimization in relational databases by examining the algorithms and data structures that improve the efficiency of query processing;\n(2) He is also exploring ways to put theory into practice by implementing theoretical results and integrating them into systems.
URL:https://isg.ics.uci.edu/event/yannakakis/
LOCATION:DBH 3011
END:VEVENT
END:VCALENDAR