BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.coscup.org//coscup-2026//talk//N89AEH
BEGIN:VTIMEZONE
TZID:CST
BEGIN:STANDARD
DTSTART:20000101T000000
RRULE:FREQ=YEARLY;BYMONTH=1
TZNAME:CST
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-coscup-2026-N89AEH@pretalx.coscup.org
DTSTART;TZID=CST:20260808T113000
DTEND;TZID=CST:20260808T120000
DESCRIPTION:## Description\n\nModern data is highly connected — such as s
 upply chains\, networks\, and relationships.\n\nPostgreSQL is strong for r
 elational queries\, but when we need to follow multi-step connections\, qu
 eries quickly become complex. JOINs grow\, and the SQL becomes harder to r
 ead\, maintain\, and extend.\n\nSQL/PGQ (SQL:2023) brings graph query capa
 bilities into SQL. It allows us to describe connections and paths more dir
 ectly\, without leaving PostgreSQL.\n\nSQL/PGQ is currently under developm
 ent in PostgreSQL\, and early implementations are already available for ex
 perimentation.\n\nIn this talk\, I show how queries evolve from simple joi
 ns to multi-step paths. We compare traditional SQL and SQL/PGQ\, focusing 
 on readability and how we think about the problem.\n\nUsing a small trade 
 network example\, I demonstrate how SQL/PGQ can simplify queries and help 
 us better understand connected data.\n\n## Outline\n\n- Problem: complex J
 OIN queries  \n- SQL/PGQ basics (SQL:2023)  \n- SQL vs SQL/PGQ examples  \
 n- Graph thinking in PostgreSQL  \n- Current status and how to try it  \n\
 n## Key Takeaways\n\n- JOINs become complex for multi-step queries  \n- SQ
 L/PGQ simplifies relationship queries  \n- Graph thinking improves underst
 anding of data  \n- SQL becomes more powerful\, not replaced
DTSTAMP:20260713T142747Z
LOCATION:RB102
SUMMARY:From JOINs to Graph Thinking: Practical SQL/PGQ in PostgreSQL - Koj
 i Annoura
URL:https://pretalx.coscup.org/coscup-2026/talk/N89AEH/
END:VEVENT
END:VCALENDAR