BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Mahmoud Abo Khamis (relationalAI)
DTSTART:20230607T150000Z
DTEND:20230607T161500Z
DTSTAMP:20260423T040047Z
UID:AAIT/18
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/AAIT/18/">Th
 e Polymatroid Bound: Extensions and Applications in Database Query Evaluat
 ion (part 2).</a>\nby Mahmoud Abo Khamis (relationalAI) as part of Seminar
  on Algorithmic Aspects of Information Theory\n\n\nAbstract\nThis is the s
 econd part of the talk\, the first part of which took place on May 24. I c
 ontinue our discussion of information-theoretic upper bounds on the output
  sizes of database queries. I will recap the polymatroid bound and present
  a corresponding query evaluation algorithm\, called PANDA\, whose runtime
  matches the polymatroid bound [Abo Khamis et al\, PODS’17]. I will also
  discuss this algorithm's shortcomings and related open problems. Acquaint
 ance with the first part of the talk is very desirable\, although formally
  it is not required.\n
LOCATION:https://researchseminars.org/talk/AAIT/18/
END:VEVENT
END:VCALENDAR