11–20 of 77 posts
Could it be efficient to use Apache AGE for e.g. retrieving all comments on an article? Currently I’m using materialized paths to efficiency return all commments but would be keen to know if AGE can help query comments for an article more powerfully.
Afaik this is pretty much the canonical way to store recursive comment trees. Or any kind of DAG.
Could it be efficient to use Apache AGE for e.g. retrieving all comments on an article? Currently I’m using materialized paths to efficiency return all commments but would be keen to know if AGE can help query comments for an article more powerfully.
Have you tried recursive CTEs with a simple id, parent_id etc schema? These should perform very well if those columns are in an index. Afaik this is pretty much the canonical way to store recursive comment trees. Or any kind of DAG.
Anyone tried this? How does the performance compare to neo4j and RedisGraph? I’m about to give RedisGraph a try and I guess I will try this one a go as well.
Could it be efficient to use Apache AGE for e.g. retrieving all comments on an article? Currently I’m using materialized paths to efficiency return all commments but would be keen to know if AGE can help query comments for an article more powerfully.
Have you tried recursive CTEs with a simple id, parent_id etc schema? These should perform very well if those columns are in an index. Afaik this is pretty much the canonical way to store recursive comment trees. Or any kind of DAG.
Could it be efficient to use Apache AGE for e.g. retrieving all comments on an article? Currently I’m using materialized paths to efficiency return all commments but would be keen to know if AGE can help query comments for an article more powerfully.
Have you tried recursive CTEs with a simple id, parent_id etc schema? These should perform very well if those columns are in an index. Afaik this is pretty much the canonical way to store recursive comment trees. Or any kind of DAG.
Recursive CTEs sounds like something you would do if your total comment count in the db is not in the six figures or something. What does HN do?
Could it be efficient to use Apache AGE for e.g. retrieving all comments on an article? Currently I’m using materialized paths to efficiency return all commments but would be keen to know if AGE can help query comments for an article more powerfully.
How are graph edges and nodes exposed to the Postgresql type system?
Could it be efficient to use Apache AGE for e.g. retrieving all comments on an article? Currently I’m using materialized paths to efficiency return all commments but would be keen to know if AGE can help query comments for an article more powerfully.
Have you tried recursive CTEs with a simple id, parent_id etc schema? These should perform very well if those columns are in an index. Afaik this is pretty much the canonical way to store recursive comment trees. Or any kind of DAG.
Storing a pointer to each node’s parent or using sorted sets seems like it would make the parent poster’s query slower. Those approaches would make it easier to reparent comments, though, and they’d support arbitrarily deep trees (whereas the materialized path implementations I’ve seen limit path length).