机构地区: 中山大学软件学院
出 处: 《中山大学学报(自然科学版)》 2005年第B06期138-141,共4页
摘 要: 目录是一种应用广泛的树形数据组织方式,为便于共享、并发等操作,往往要将其存储在关系数据库中。根据目录结构通常是由根向叶子分层访问的特点,本文提出一种基于关系数据库的节点分层存储方法,该方法通过存储节点绝对路径的hash值和子节点集来提高节点的查找和分层提取速度。文章还将该方法与其他常用的存储方法进行对比,结果表明该方法对于目录的检索有很高的适用性。 Directory is an approach widely used in tree_structure data organizing. The mapping from tree-structure data to RDBMS is widely discussed in XML_related approaches. Here, a simple and efficient storage form is considered, which stores both the hash value computed from a tree node's full path and its children nodes. Its performance is also discussed.
领 域: [自动化与计算机技术] [自动化与计算机技术]