A Relation Routing Scheme for Distributed Semantic Media Query
Performing complex semantic queries over large-scale distributed media contents is a challenging task for rich media applications. The dynamics and openness of data sources make it uneasy to realize a query scheme that simultaneously achieves precision, scalability, and reliability. In this paper, a...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2013/915963 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832561041917083648 |
---|---|
author | Zhuhua Liao Guoqiang Zhang Aiping Yi Guoqing Zhang Wei Liang |
author_facet | Zhuhua Liao Guoqiang Zhang Aiping Yi Guoqing Zhang Wei Liang |
author_sort | Zhuhua Liao |
collection | DOAJ |
description | Performing complex semantic queries over large-scale distributed media contents is a challenging task for rich media applications. The dynamics and openness of data sources make it uneasy to realize a query scheme that simultaneously achieves precision, scalability, and reliability. In this paper, a novel relation routing scheme (RRS) is proposed by renovating the routing model of Content Centric Network (CCN) for directly querying large-scale semantic media content. By using proper query model and routing mechanism, semantic queries with complex relation constrains from users can be guided towards potential media sources through semantic guider nodes. The scattered and fragmented query results can be integrated on their way back for semantic needs or to avoid duplication. Several new techniques, such as semantic-based naming, incomplete response avoidance, timeout checking, and semantic integration, are developed in this paper to improve the accuracy, efficiency, and practicality of the proposed approach. Both analytical and experimental results show that the proposed scheme is a promising and effective solution for complex semantic queries and integration over large-scale networks. |
format | Article |
id | doaj-art-cbd16d4fbae84617a43bfb7f253555c8 |
institution | Kabale University |
issn | 1537-744X |
language | English |
publishDate | 2013-01-01 |
publisher | Wiley |
record_format | Article |
series | The Scientific World Journal |
spelling | doaj-art-cbd16d4fbae84617a43bfb7f253555c82025-02-03T01:26:11ZengWileyThe Scientific World Journal1537-744X2013-01-01201310.1155/2013/915963915963A Relation Routing Scheme for Distributed Semantic Media QueryZhuhua Liao0Guoqiang Zhang1Aiping Yi2Guoqing Zhang3Wei Liang4Key Laboratory of Knowledge Processing and Networked Manufacturing, University of Hunan Province, Xiangtan 411201, ChinaSchool of Computer Science and Technology, Nanjing Normal University, Nanjing 210023, ChinaHunan University of Science and Technology, Xiangtan 411201, ChinaInstitute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, ChinaInstitute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, ChinaPerforming complex semantic queries over large-scale distributed media contents is a challenging task for rich media applications. The dynamics and openness of data sources make it uneasy to realize a query scheme that simultaneously achieves precision, scalability, and reliability. In this paper, a novel relation routing scheme (RRS) is proposed by renovating the routing model of Content Centric Network (CCN) for directly querying large-scale semantic media content. By using proper query model and routing mechanism, semantic queries with complex relation constrains from users can be guided towards potential media sources through semantic guider nodes. The scattered and fragmented query results can be integrated on their way back for semantic needs or to avoid duplication. Several new techniques, such as semantic-based naming, incomplete response avoidance, timeout checking, and semantic integration, are developed in this paper to improve the accuracy, efficiency, and practicality of the proposed approach. Both analytical and experimental results show that the proposed scheme is a promising and effective solution for complex semantic queries and integration over large-scale networks.http://dx.doi.org/10.1155/2013/915963 |
spellingShingle | Zhuhua Liao Guoqiang Zhang Aiping Yi Guoqing Zhang Wei Liang A Relation Routing Scheme for Distributed Semantic Media Query The Scientific World Journal |
title | A Relation Routing Scheme for Distributed Semantic Media Query |
title_full | A Relation Routing Scheme for Distributed Semantic Media Query |
title_fullStr | A Relation Routing Scheme for Distributed Semantic Media Query |
title_full_unstemmed | A Relation Routing Scheme for Distributed Semantic Media Query |
title_short | A Relation Routing Scheme for Distributed Semantic Media Query |
title_sort | relation routing scheme for distributed semantic media query |
url | http://dx.doi.org/10.1155/2013/915963 |
work_keys_str_mv | AT zhuhualiao arelationroutingschemefordistributedsemanticmediaquery AT guoqiangzhang arelationroutingschemefordistributedsemanticmediaquery AT aipingyi arelationroutingschemefordistributedsemanticmediaquery AT guoqingzhang arelationroutingschemefordistributedsemanticmediaquery AT weiliang arelationroutingschemefordistributedsemanticmediaquery AT zhuhualiao relationroutingschemefordistributedsemanticmediaquery AT guoqiangzhang relationroutingschemefordistributedsemanticmediaquery AT aipingyi relationroutingschemefordistributedsemanticmediaquery AT guoqingzhang relationroutingschemefordistributedsemanticmediaquery AT weiliang relationroutingschemefordistributedsemanticmediaquery |