基于有序二叉树的RDF存储模型研究  

Research on RDF storage model based on ordered binary tree

作　　者：李心科[1] 秦冬生[1] 

机构地区：[1]合肥工业大学计算机与信息学院,安徽合肥230009

出　　处：《合肥工业大学学报（自然科学版）》2013年第7期825-830,共6页Journal of Hefei University of Technology：Natural Science

摘　　要：语义网的不断发展使得海量RDF数据存储和查询成为一个重要的研究主题。合理的RDF数据分类方法和组织结构对于提升RDF数据管理和查询性能具有重要作用。文章提出一种基于有序二叉树的RDF数据存储模型,给出了RDF图模型转化为有序二叉树模型的一般步骤,并将RDF数据查询问题转化为有序二叉树的遍历问题,实现了具体的查询算法。实验表明,该存储模型比其他方法具有更短的响应时间。The storage and query of resource description framework（RDF） data has become an important research topic with the development of the semantic Web. Reasonable RDF data classification and organization structure plays an important role in enhancing the performance of the management and query of massive RDF data. In this paper, a RDF data storage model based on ordered binary tree is put forward and the general steps of converting RDF graph model into the model of ordered binary tree are presented. And the query algorithm is put into practice by converting the RDF data query problem into ordered binary tree traversals problem. The experimental results show that this model has faster response time than other methods.

关 键 词：RDF数据查询 有序二叉树 存储模型 云计算 

分 类 号：TP311.521[自动化与计算机技术—计算机软件与理论]