> I just find your position that btrees are optimised for every query structure But that is not my position! Postgres has many index access methods: hash, btre

> I just find your position that btrees are optimised for every query structure But that is not my position! Postgres has many index access methods: hash, btree, brin, gin, gist, and there are extensions for rum, bloom, skipscans, geospatial indexes such as sp-gist, & vector indexes like ivf/hnws (see pgvector.) I mean, as far as graph databases are concerned, besides pgRouting, there's also Apache AGE which is a graph-"optimised" Postgres. You should learn more about Postgres and databases in general. See comment above. https://news.ycombinator.com/item?id=43203833 https://news.ycombinator.com/item?id=43203833 which is closely related to the argument I am actually making.