在关系数据库中存储分层数据有哪些选择? [关闭]
问题: 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