BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.com//bbuzz22//speaker//QTSPFX
BEGIN:VTIMEZONE
TZID:CET
BEGIN:STANDARD
DTSTART:20001029T040000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20000326T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-bbuzz22-988SHD@pretalx.com
DTSTART;TZID=CET:20220614T113000
DTEND;TZID=CET:20220614T121000
DESCRIPTION:Optimization problems are everywhere\, from deciding which clot
 hes to pack in our luggage (aka the knapsack problem)\, to selecting the t
 asks that will be worked during a sprint. Trying to solve these type of pr
 oblems by hand is a tedious task often resulting in sub-optimal decisions.
 \n\nIn this talk\, we'll understand how PostgreSQL recursive queries can h
 elp. Starting from the proper problem definition\, we'll then explore how 
 to build queries that call themselves recursively\, what are the risks ass
 ociated with this approach and safeguards we can set to optimise performan
 ces. Finally we'll demonstrate how two new features released in PostgreSQL
  14 enable an easier handling of the recursive statements.\n\nIf you're in
 to PostgreSQL and eager to understand how recursion works\, this session i
 s for you!
DTSTAMP:20260610T055359Z
LOCATION:Maschinenhaus
SUMMARY:Solving the knapsack problem with recursive queries and PostgreSQL 
 - Francesco Tisiot
URL:https://pretalx.com/bbuzz22/talk/988SHD/
END:VEVENT
END:VCALENDAR