Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Computer Research and Development》 2005-10
Add to Favorite Get Latest Update

An Efficient Matching Algorithm for RDF Graph Patterns

Wang Jinling, Jin Beihong, and Li Jing (Technology Center of Software Engineering, Institute of Software, Chinese Acade my of Sciences, Beijing 100080)  
The semantic Web is increasingly accepted as the next generation of WWW. The fo undation of semantic Web is resource description framework (RDF). As more and m ore information is represented in RDF format, the efficient dissemination and filtering of RDF information becomes an important problem. In information dissem ination systems under the semantic Web, input RDF data should be matched with a database of user profiles, which can be represented as RDF graph patterns. Base d on the characteristics of RDF and several restrictions on the RDF graph, a nov el matching algorithm is proposed for RDF graph patterns. RDF graph and RDF pat terns are all traversed from a special node to form BFS trees; the matching state of two BFS trees are represented as an AND-OR tree to avoid backtracking. RD F patterns are indexed according to the concept model to further improve efficie ncy. Experimental results show that the algorithm is much more efficient than c onventional graph matching algorithms.
【Fund】: 国家“九七三”重点基础研究发展规划基金项目(2002CB312005);; 国家自然科学基金项目(60173023);; 国家“八六三”高技术研究发展计划基金项目(2001AA113010)
【CateGory Index】: TP391.1
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved