News for hackers. Stuff that matters.

A comment on Postgres as a Graph Database: (Ab)Using PgRouting. Parent comment

Re:Postgres as a Graph Database: (Ab)Using PgRouting by bubblyworld on Friday February 28, 2025 @08:38AM (#43205424)
No need for the snark. If you want specific details of how postgres differs from graph databases I have nothing for you. I just find your position that btrees are optimised for every query structure... obviously false on general grounds? Like a thing to do to make recursive queries faster is to store relations as direct pointers of some kind, rather than doing index scans for every level of join.

Perhaps we're talking past each other about the word "optimised".

[ Parent | on HN ]
Re:Postgres as a Graph Database: (Ab)Using PgRouting by tucnak on Monday March 03, 2025 @04:22AM (#43239941)
> 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 which is closely related to the argument I am actually making.

[ Parent | on HN ]
Re:Postgres as a Graph Database: (Ab)Using PgRouting by bubblyworld on Wednesday March 05, 2025 @11:56AM (#43269194)
Fair, and I apologise for misrepresenting it. I should definitely learn more about databases in general!
[ Parent | on HN ]