An Efficient Storage Model of Tree-Like Structure in MongoDB
Jiaqi Yao · 2016
The tree-like structure is a common structure, which is used in many projects. Queries based on tree's attributes and queries based on node's attributes are the two frequently used query's patterns. However, the existing storage models don't support both of them efficiently. In this paper, we propose a hybrid storage model, which stores nodes and relations between nodes separately, and we also build the inverted index between nodes and trees. The experiment results show that the hybrid storage model is more efficient than the existing models.