一种基于语义的RDF近似查询方法

计算机科学 ›› 2013, Vol. 40 ›› Issue (9): 169-173.

一种基于语义的RDF近似查询方法

周文健,马睿哲

东北大学信息科学与工程学院沈阳110819;东北大学信息科学与工程学院沈阳110819

出版日期:2018-11-16 发布日期:2018-11-16

RDF Approximate Query Approach Based on Semantics

ZHOU Wen-jian and MA Rui-zhe

Online:2018-11-16 Published:2018-11-16

摘要/Abstract

摘要： 针对返回结果为空或甚少的情况,提出RDF查询松弛和同源词替换相结合的方法:通过RDFS蕴含规则对初始查询进行松弛,选取合适的松弛查询进行同源词替换得到更多的查询结果。为了返回与初始查询在语义上相近的结果,提出面向RDF的语义距离概念,即通过语义距离的计算选取与初始查询在语义上相近的结果。在上述查询策略的基础上,给出基于语义的RDF近似查询处理的算法,通过实验验证了所提方法的可行性,并与现有的RDF查询方法进行了比较。实验结果表明,所提方法在查准率以及查全率方面均具有一定的优越性。

关键词: 语义Web,RDF,近似查询,松弛,语义距离中图法分类号TP391文献标识码A

Abstract: To handle the problem of empty or few answers returned from RDF in response to a user query and the problem of synonyms in RDF queries,an approximate query approach by combining query relaxation and replacement with kinship words was proposed．RDF entailment to triple patterns is applied on the original query to relax it and then appropriate queries are chosen for replacement of kinship words so that more results can be obtained．The notion of semantic distance was introduced.The results that are semantically close to the original query can be determined．An approxiamate query algorithm based on semantics was hereby developed．The proposed approach was verified with experiments and it has good performances in its recall and precision.

Key words: Semantic Web,RDF,Approximate query,Relaxation,Semantic distance

周文健,马睿哲. 一种基于语义的RDF近似查询方法[J]. 计算机科学, 2013, 40(9): 169-173. https://doi.org/

ZHOU Wen-jian and MA Rui-zhe. RDF Approximate Query Approach Based on Semantics[J]. Computer Science, 2013, 40(9): 169-173. https://doi.org/

参考文献

[1] Berners-Lee T,Handler J,Lassila O．The Semantic Web[M]．Scientific American,2001,184:34-43
[2] Miller E,Swick R,Brickley D.Resource Description Framework RDF[C]∥Recommendation,W3C．2004
[3] Clark K G．RDF Data Access Use Cases and Requirements[C]∥W3C Working Draft．March 2005
[4] Hurtado C A,Poulovassilis A,Wood P T．A relaxed approach to RDF querying[C]∥Proceedings of the 5th International Semantic Web Conference．LNCS,2006,4273:314-328
[5] Hurtado C A,Poulovassilis A,Wood P T．Query relaxa-tion in RDF[J]．Journal of Data Semantics,2008,10:31-61
[6] Poulovassilis A,Wood P T．Combining approximation and relaxa-tion in semantic web path queries[C]∥Proceedings of the 2010International Semantic Web Conference．LNCS,2010,6496:631-646
[7] Huang H,Liu C F,Zhou X F．Computing relaxed answers on RDF databases[C]∥Proceedings of the 9th International Conference on Web Information Systems Engineering．LNCS,2008,5175:163-175
[8] Andreasen T,Bulskov H,Knappe R．From ontology over similarity to query evaluation[C]∥Proceedings of the 2nd CoLogNETElsNET Symposium-Questions and Answers:Theoretical and Applied Perspectives．2003:39-50
[9] Maedche A,Staab S．Measuring similarity between ontologies[C]∥Proceedings of the 13th International Conference on Knowledge Engineering and Knowledge Management．LNCS,2002,2473:251-263
[10] Guo Y,Pan Z,Hein J．An evaluation of knowledge base systems for large OWL datasets[C]∥Proceedings of the 3rd International Semantic Web Conference．LNCS,2004,3298:274-288
[11] Jena S D B．http://jena.hpl.hp.com/wiki/SDB
[12] Zhu L,Ma Q,Liu C N．Semantic-distance based evaluation ofranking queries over relational databases[J]．Journal of Intelligent Information Systems,2010,31:415-445

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed