intersting paper: Fair benchmarks of Graph and Relational Databases in Complex Queries

[hpvd]

Heard about your stunning extension on today’s DuckCon...
Many thanks for your work on this!

Some week ago I stumbled across this insight:

When looking into fair comparisons / benchmarks of relational and graph databases
where each one is optimized by using indexes,
you are able to even find performance benefits for relational databases in several graph like uses-cases because they take much more advantage from indexes than graph DBs do.

Example: Performance of Graph and Relational Databases in Complex Queries https://www.mdpi.com/2076-3417/12/13/6490

Maybe this is somehow useful for your project duckpgq/duckdb in general

[Dtenwolde]

Thank you for the suggestion!

[hpvd]

if you need an idea/source for what different kinds of index can do,
here are some quite impressive numbers from Pinot ("huge" scalable/stream OLAP)
not using vs using inverted/sorted/range/json/text/geospatical/startree index
https://startree.ai/resources/what-makes-apache-pinot-fast-chapter-ii

[hpvd]

just fyi:
duckdb currently seem to be utilising indexes pretty poorly in comparison to sqlite:
there is a factor 15-125x in query speeds (2 orders of magnitude)
on the other hand, if you don’t use indexes duckdb is faster than sqlite
https://www.lukas-barth.net/blog/sqlite-duckdb-benchmark/

this shows ones again the importance of indexes.