Presents a data model that organizes documents in a tree-like structure by storing references to "parent" nodes in "child" nodes.提出了一种数据模型,通过在“子”节点中存储对“父”节点的引用,以树状结构组织文档。
Presents a data model that organizes documents in a tree-like structure by storing references to "child" nodes in "parent" nodes.提出了一种数据模型,通过在“父”节点中存储对“子”节点的引用,以树状结构组织文档。
Presents a data model that organizes documents in a tree-like structure by storing references to "parent" nodes and an array that stores all ancestors.提供了一个数据模型,通过存储对“父”节点的引用和存储所有父节点的数组,以树状结构组织文档。
Presents a data model that organizes documents in a tree-like structure by storing full relationship paths between documents. 提出了一种数据模型,该模型通过存储文档之间的完整关系路径以树状结构组织文档。In addition to the tree node, each document stores the _id of the nodes ancestors or path as a string.除了树节点之外,每个文档还将节点祖先或路径的_id存储为字符串。
Presents a data model that organizes documents in a tree-like structure using the Nested Sets pattern. 提供一个数据模型,该模型使用嵌套集模式以树状结构组织文档。This optimizes discovering subtrees at the expense of tree mutability.这以树的可变性为代价优化了子树的发现。