基于本体的分布式查询分解算法研究  

Study on decomposition of distributed query based on ontology

作　　者：尹康银[1] 宋自林[1] 石翌轶[1] 

机构地区：[1]解放军理工大学指挥自动化学院,江苏南京210007

出　　处：《系统工程与电子技术》2008年第4期658-662,共5页Systems Engineering and Electronics

摘　　要：针对相关领域数据分布在不同站点,数据源的准确定位是分布式语义查询系统的关键,提出子本体交叉递归推理方法,该方法利用子本体间相互交叉的特点,从增强子本体中获取隐含的查询结果,从而保证分布式查询的语义完整性,提高了查全率。在此基础上,将分布式RDF查询分解为多个查询片段的分解策略保证分布式语义查询模式的分布透明性。最后描述算法的详细设计过程,并分析时空复杂度,其结果分析表明算法具有较好的计算性能。Data related with one domain are distributed at different sites and thus precisely locating the data source is a key point in the distributed semantic query system. To solve this, a cross recursive inference method about sub ontology is put forward, which makes use of the mutual parts between the sub ontologies and queries the results from the enhanced sub ontology. Based on these, a distributed RDF query would be decomposed into multi sub-query fragments by a decomposition strategy which adopts recursive inference method. The decomposition strategy ensures the semantic integrity and the recall when querying distributed sources, and keeps the transparency of distributed semantic query. In the end, a detailed algorithm is presented and the time and space complexity are analyzed. The analyses show that the calculating performance of this algorithm is fine.

关 键 词：本体论 分布式查询 RDF 查询分解 子本体交叉递归推理 

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