<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>ExoBench Blog</title><description>Measured SQL performance findings — query plans, index trade-offs, and planner behavior, benchmarked at real data scales.</description><link>https://exobench.ai</link><item><title>How Fast Are Postgres 19 Graph Queries? Part 1: What Are They Actually Doing?</title><link>https://exobench.ai/blog/pg19-graph-queries-part-1</link><guid isPermaLink="true">https://exobench.ai/blog/pg19-graph-queries-part-1</guid><description>Postgres 19 adds SQL/PGQ graph queries. Measured against a PostgreSQL 19beta1 build, the fixed-depth graph query compiles to the exact same plan as a hand-written join, and the variable-depth traversal that graph databases were built for still falls to a recursive CTE. Apache AGE runs the same indexed traversal under a Cypher wrapper. Numbers from ExoBench in local mode.</description><pubDate>Wed, 05 Aug 2026 00:00:00 GMT</pubDate><category>postgres</category><category>postgres-19</category><category>graph</category><category>sql-pgq</category><category>graph-table</category><category>apache-age</category><category>recursive-cte</category><category>explain-analyze</category><category>neo4j</category></item></channel></rss>