BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Mahmoud Abo Khamis (relationalAI)
DTSTART:20230524T150000Z
DTEND:20230524T161500Z
DTSTAMP:20260423T035957Z
UID:AAIT/17
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/AAIT/17/">Th
 e Polymatroid Bound: Extensions and Applications in Database Query Evaluat
 ion.</a>\nby Mahmoud Abo Khamis (relationalAI) as part of Seminar on Algor
 ithmic Aspects of Information Theory\n\n\nAbstract\nInformation theory has
  been used to compute upper bounds on the output sizes of database queries
  as well as to devise matching algorithms that can answer these queries wi
 thin these bounds. The polymatroid bound generalizes many of these bounds 
 and has a matching query evaluation algorithm\, called PANDA [Abo Khamis e
 t al\, PODS'17]. In this talk\, we present extensions of the polymatroid b
 ound that utilize the query structure to derive new constraints on entropi
 es. We state open problems regarding the relationship between these extens
 ions and the original bound. On the algorithmic side\, we present the PAND
 A algorithm in detail and discuss its shortcomings and related open proble
 ms.\n
LOCATION:https://researchseminars.org/talk/AAIT/17/
END:VEVENT
END:VCALENDAR