###
Journal of Software:2012.23(10):2760-2771

互联网络中语义媒体查询的关系路由方法
廖祝华,张国清,杨景,傅川,张国强
(中国科学院计算技术研究所, 北京 100190;中国科学院研究生院, 北京 100049;知识处理和网络化制造湖南省高校重点实验室(湖南科技大学), 湖南湘潭 411201;中国科学院计算技术研究所, 北京 100190;中国移动通信研究院, 北京 100053;中国科学院计算技术研究所, 北京 100190;南京师范大学计算机科学与技术学院, 江苏南京 210012)
Scheme of Relational Routing for Querying Semantic Media on Internetwork
LIAO Zhu-Hua,ZHANG Guo-Qing,YANG Jing,FU Chuan,ZHANG Guo-Qiang
(Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100190, China;Graduate University, The Chinese Academy of Sciences, Beijing 100190, China;Key Laboratory of Knowledge Processing and Networked Manufacturing (Hu’nan University of Science and Technology), Xiangtan411201, China;Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100190, China;The Research Institution of China Mobile, Beijing 100053, China;Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100190, China;School of Computer Science and Technology, Nanjing Normal University, Nanjing 210012, China)
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2815   Download 3023
Received:January 18, 2011    Revised:December 31, 2011
> 中文摘要: 针对互联网络中媒体语义关联内容的快速查找和聚合方面的问题,提出了一种新的面向网络的关系路由方案.该方案在命名媒体和语义关联的基础上对网络中的语义关联请求进行路由,然后快速返回关联内容.首先介绍了语义媒体模型和基于网络的关系查询模型,设计了关系路由通信协议的数据结构和算法,尤其是对关系匹配算法、路由过程以及关系请求的非完备性返回避免方法进行了重点介绍.然后,对关系路由的关键问题,如媒体命名、查询偏好以及应用等方面的问题进行了讨论和分析.最后,在实际环境中对关系路由的模型和算法进行了实验.结果表明,关系路由方法能够快速获取语义关联内容,并为分布、动态的媒体语义聚合提供了一条有效的途径.
Abstract:A novel relational routing scheme is proposed to solve the problem of querying and aggregatingsemantic media content on the network at an effective pace. The scheme can route the semantic media query andquickly backtrack relevant content from the network based on the named media and semantic association. First, themodels of semantic media and relational query are introduced, along with the necessary data structures andalgorithms for relational routing protocol. In particular, the relational matching algorithm, the procedure ofrelational routing and the approach for avoiding incomplete response of pending relational query are elaborated on.Second, the key problems of relational routing are discusse, such as media naming, query preference and theapplication. Finally, the experimentation of relational routing model and algorithms on real platform are made.Results show that the scheme is highly efficient for retrieving semantically relevant content and provides aneffective approach for semantic aggregation of distributed and dynamic media.
文章编号:     中图分类号:    文献标志码:
基金项目:“核高基”国家科技重大专项(2011ZX03002-002-03, 2011ZX03002-004-03); 国家自然科学基金(61174152, 61100178, 61100054); 北京市自然科学基金(4112057); “核高基”国家科技重大专项(2011ZX03002-002-03, 2011ZX03002-004-03); 国家自然科学基金(61174152, 61100178, 61100054); 北京市自然科学基金(4112057);
Foundation items:
Reference text:

廖祝华,张国清,杨景,傅川,张国强.互联网络中语义媒体查询的关系路由方法.软件学报,2012,23(10):2760-2771

LIAO Zhu-Hua,ZHANG Guo-Qing,YANG Jing,FU Chuan,ZHANG Guo-Qiang.Scheme of Relational Routing for Querying Semantic Media on Internetwork.Journal of Software,2012,23(10):2760-2771