Edit Question - KnowledgeHub

Title Body

Good Overviews Generally speaking, you're making a decision between fast read times (for example, nested set) or fast write times (adjacency list). Usually, you end up with a combination of the options below that best fit your needs. The following provides some in-depth reading: One more Nested Intervals vs. Adjacency List comparison : the best comparison of Adjacency List, Materialized Path, Nested Set, and Nested Interval I've found. Models for hierarchical data : slides with good explanations of tradeoffs and example usage Representing hierarchies in MySQL : very good overview of Nested Set in particular Hierarchical data in RDBMSs : a most comprehensive and well-organized set of links I've seen, but not much in the way of explanation Options Ones I am aware of and general features: Adjacency List : Columns: ID, ParentID Easy to implement. Cheap node moves, inserts, and deletes. Expensive to find the level, ancestry & descendants, path Avoid N+1 via Common Table Expressions in databases that support them Nested Set (a.k.a <a href="https://www.caktusgroup.com/blog/2016/01/04/modified-preorder-tree-traversal-django/" r

Tags (comma-separated) Cancel