互联网络中语义媒体查询的关系路由方法

摘要

A novel relational routing scheme is proposed to solve the problem of querying and aggregating semantic media content on the network at an effective pace. The scheme can route the semantic media query and quickly backtrack relevant content from the network based on the named media and semantic association. First, the models of semantic media and relational query are introduced, along with the necessary data structures and algorithms for relational routing protocol. In particular, the relational matching algorithm, the procedure of relational 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 the application. 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 an effective approach for semantic aggregation of distributed and dynamic media.%针对互联网络中媒体语义关联内容的快速查找和聚合方面的问题,提出了一种新的面向网络的关系路由方案.该方案在命名媒体和语义关联的基础上对网络中的语义关联请求进行路由,然后快速返回关联内容.首先介绍了语义媒体模型和基于网络的关系查询模型,设计了关系路由通信协议的数据结构和算法,尤其是对关系匹配算法、路由过程以及关系请求的非完备性返回避免方法进行了重点介绍.然后,对关系路由的关键问题,如媒体命名、查询偏好以及应用等方面的问题进行了讨论和分析.最后,在实际环境中对关系路由的模型和算法进行了实验.结果表明,关系路由方法能够快速获取语义关联内容,并为分布、动态的媒体语义聚合提供了一条有效的途径.