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 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.

[1]  JAMAL N. AL-KARAKI,et al.  Routing techniques in wireless sensor networks: a survey , 2004, IEEE Wireless Communications.

[2]  Scott Shenker,et al.  A data-oriented (and beyond) network architecture , 2007, SIGCOMM '07.

[3]  Vassilis Christophides,et al.  Semantic Query Routing and Processing in P2P Database Systems: The ICS-FORTH SQPeer Middleware , 2004, EDBT Workshops.

[4]  Deborah Estrin,et al.  Named Data Networking (NDN) Project , 2010 .

[5]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[6]  Hector Garcia-Molina,et al.  Routing indices for peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[7]  Vassilis Christophides,et al.  RQL: a declarative query language for RDF , 2002, WWW.

[8]  Sasu Tarkoma,et al.  Publish/Subscribe for Internet: PSIRP Perspective , 2010, Future Internet Assembly.

[9]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[10]  Laks V. S. Lakshmanan,et al.  Hierarchical or relational? A case for a modern hierarchical data model , 1999, Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX'99) (Cat. No.PR00453).

[11]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[12]  Hector Garcia-Molina,et al.  Semantic Overlay Networks for P2P Systems , 2004, AP2PC.

[13]  Laura M. Haas,et al.  Data integration through database federation , 2002, IBM Syst. J..

[14]  Surajit Chaudhuri,et al.  Exploiting web search engines to search structured databases , 2009, WWW '09.

[15]  Christian Dannewitz,et al.  NetInf: An Information-Centric Design for the Future Internet , 2013 .

[16]  Srinivasan Seshan,et al.  XIA: an architecture for an evolvable and trustworthy internet , 2011, HotNets-X.

[17]  Petros Daras,et al.  Towards a Content-Centric Internet , 2010, Future Internet Assembly.

[18]  Steffen Staab,et al.  Federated Data Management and Query Optimization for Linked Open Data , 2011, New Directions in Web Data Management 1.

[19]  Jürgen Umbrich,et al.  Searching and browsing Linked Data with SWSE: The Semantic Web Search Engine , 2011, J. Web Semant..

[20]  Lou Berger,et al.  The OSPF Opaque LSA Option , 1998, RFC.

[21]  Michael G. Strintzis,et al.  Similarity content search in content centric networks , 2010, ACM Multimedia.

[22]  Xiaoping Sun.  SCAN: a small-world structured p2p overlay for multi-dimensional queries , 2007, WWW '07.

[23]  Farnoush Banaei Kashani,et al.  SWAM: a family of access methods for similarity-search in peer-to-peer data networks , 2004, CIKM '04.

[24]  Lixia Zhang,et al.  Ad hoc networking via named data , 2010, MobiArch '10.