Towards efficient dissemination of linked data in the Internet of Things

Yongrui Qin, Quan Z. Sheng, Nickolas J G Falkner, Ali Shemshadi, Edward Curry

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

The Internet of Things (IoT) envisions smart objects collecting and sharing data at a global scale via the Internet. One challenging issue is how to disseminate data to relevant data consumers efficiently. In this paper, we leverage semantic technologies which can facilitate machine-to-machine communications, such as Linked Data, to build an efficient information dissemination system for semantic IoT. The system integrates Linked Data streams generated from various data collectors and disseminates matched data to relevant data consumers based on Basic Graph Patterns (BGPs) registered in the system by those consumers. To efficiently match BGPs against Linked Data streams, we introduce two types of matching, namely semantic matching and pattern matching, by considering whether the matching process supports semantic relatedness computation. Two new data structures, namely MVR-tree and TP-automata, are introduced to suit these types of matching respectively. Experiments show that an MVR-tree designed for semantic matching can achieve a twofold increase in throughput compared with the naive R-tree based method. TP-automata, as the first approach designed for pattern matching over Linked Data streams, also provides two to three orders of magnitude improvements on throughput compared with semantic matching approaches.

LanguageEnglish
Title of host publicationProceedings of the 2014 ACM International Conference on Information and Knowledge Management
Subtitle of host publicationCIKM 2014
PublisherAssociation for Computing Machinery, Inc
Pages1779-1782
Number of pages4
ISBN (Electronic)9781450325981
DOIs
Publication statusPublished - 3 Nov 2014
Externally publishedYes
Event23rd ACM International Conference on Information and Knowledge Management - Shanghai, China
Duration: 3 Nov 20147 Nov 2014
Conference number: 23
https://dl.acm.org/citation.cfm?id=26618291 (Link to Conference Details)

Conference

Conference23rd ACM International Conference on Information and Knowledge Management
Abbreviated titleCIKM 2014
CountryChina
CityShanghai
Period3/11/147/11/14
Internet address

Fingerprint

Semantics
Pattern matching
Throughput
Information dissemination
Data structures
Internet of things
Linked data
Dissemination
Internet
Data streams
Experiments
Graph
Automata

Cite this

Qin, Y., Sheng, Q. Z., Falkner, N. J. G., Shemshadi, A., & Curry, E. (2014). Towards efficient dissemination of linked data in the Internet of Things. In Proceedings of the 2014 ACM International Conference on Information and Knowledge Management: CIKM 2014 (pp. 1779-1782). Association for Computing Machinery, Inc. https://doi.org/10.1145/2661829.2661889
Qin, Yongrui ; Sheng, Quan Z. ; Falkner, Nickolas J G ; Shemshadi, Ali ; Curry, Edward. / Towards efficient dissemination of linked data in the Internet of Things. Proceedings of the 2014 ACM International Conference on Information and Knowledge Management: CIKM 2014. Association for Computing Machinery, Inc, 2014. pp. 1779-1782
@inproceedings{c0860cc297cf47eb929b867716255f01,
title = "Towards efficient dissemination of linked data in the Internet of Things",
abstract = "The Internet of Things (IoT) envisions smart objects collecting and sharing data at a global scale via the Internet. One challenging issue is how to disseminate data to relevant data consumers efficiently. In this paper, we leverage semantic technologies which can facilitate machine-to-machine communications, such as Linked Data, to build an efficient information dissemination system for semantic IoT. The system integrates Linked Data streams generated from various data collectors and disseminates matched data to relevant data consumers based on Basic Graph Patterns (BGPs) registered in the system by those consumers. To efficiently match BGPs against Linked Data streams, we introduce two types of matching, namely semantic matching and pattern matching, by considering whether the matching process supports semantic relatedness computation. Two new data structures, namely MVR-tree and TP-automata, are introduced to suit these types of matching respectively. Experiments show that an MVR-tree designed for semantic matching can achieve a twofold increase in throughput compared with the naive R-tree based method. TP-automata, as the first approach designed for pattern matching over Linked Data streams, also provides two to three orders of magnitude improvements on throughput compared with semantic matching approaches.",
keywords = "Information dissemination, Linked data, Query index",
author = "Yongrui Qin and Sheng, {Quan Z.} and Falkner, {Nickolas J G} and Ali Shemshadi and Edward Curry",
note = "No record of this in Eprints. HN 29/11/2017",
year = "2014",
month = "11",
day = "3",
doi = "10.1145/2661829.2661889",
language = "English",
pages = "1779--1782",
booktitle = "Proceedings of the 2014 ACM International Conference on Information and Knowledge Management",
publisher = "Association for Computing Machinery, Inc",

}

Qin, Y, Sheng, QZ, Falkner, NJG, Shemshadi, A & Curry, E 2014, Towards efficient dissemination of linked data in the Internet of Things. in Proceedings of the 2014 ACM International Conference on Information and Knowledge Management: CIKM 2014. Association for Computing Machinery, Inc, pp. 1779-1782, 23rd ACM International Conference on Information and Knowledge Management, Shanghai, China, 3/11/14. https://doi.org/10.1145/2661829.2661889

Towards efficient dissemination of linked data in the Internet of Things. / Qin, Yongrui; Sheng, Quan Z.; Falkner, Nickolas J G; Shemshadi, Ali; Curry, Edward.

Proceedings of the 2014 ACM International Conference on Information and Knowledge Management: CIKM 2014. Association for Computing Machinery, Inc, 2014. p. 1779-1782.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Towards efficient dissemination of linked data in the Internet of Things

AU - Qin, Yongrui

AU - Sheng, Quan Z.

AU - Falkner, Nickolas J G

AU - Shemshadi, Ali

AU - Curry, Edward

N1 - No record of this in Eprints. HN 29/11/2017

PY - 2014/11/3

Y1 - 2014/11/3

N2 - The Internet of Things (IoT) envisions smart objects collecting and sharing data at a global scale via the Internet. One challenging issue is how to disseminate data to relevant data consumers efficiently. In this paper, we leverage semantic technologies which can facilitate machine-to-machine communications, such as Linked Data, to build an efficient information dissemination system for semantic IoT. The system integrates Linked Data streams generated from various data collectors and disseminates matched data to relevant data consumers based on Basic Graph Patterns (BGPs) registered in the system by those consumers. To efficiently match BGPs against Linked Data streams, we introduce two types of matching, namely semantic matching and pattern matching, by considering whether the matching process supports semantic relatedness computation. Two new data structures, namely MVR-tree and TP-automata, are introduced to suit these types of matching respectively. Experiments show that an MVR-tree designed for semantic matching can achieve a twofold increase in throughput compared with the naive R-tree based method. TP-automata, as the first approach designed for pattern matching over Linked Data streams, also provides two to three orders of magnitude improvements on throughput compared with semantic matching approaches.

AB - The Internet of Things (IoT) envisions smart objects collecting and sharing data at a global scale via the Internet. One challenging issue is how to disseminate data to relevant data consumers efficiently. In this paper, we leverage semantic technologies which can facilitate machine-to-machine communications, such as Linked Data, to build an efficient information dissemination system for semantic IoT. The system integrates Linked Data streams generated from various data collectors and disseminates matched data to relevant data consumers based on Basic Graph Patterns (BGPs) registered in the system by those consumers. To efficiently match BGPs against Linked Data streams, we introduce two types of matching, namely semantic matching and pattern matching, by considering whether the matching process supports semantic relatedness computation. Two new data structures, namely MVR-tree and TP-automata, are introduced to suit these types of matching respectively. Experiments show that an MVR-tree designed for semantic matching can achieve a twofold increase in throughput compared with the naive R-tree based method. TP-automata, as the first approach designed for pattern matching over Linked Data streams, also provides two to three orders of magnitude improvements on throughput compared with semantic matching approaches.

KW - Information dissemination

KW - Linked data

KW - Query index

UR - http://www.scopus.com/inward/record.url?scp=84937565021&partnerID=8YFLogxK

U2 - 10.1145/2661829.2661889

DO - 10.1145/2661829.2661889

M3 - Conference contribution

SP - 1779

EP - 1782

BT - Proceedings of the 2014 ACM International Conference on Information and Knowledge Management

PB - Association for Computing Machinery, Inc

ER -

Qin Y, Sheng QZ, Falkner NJG, Shemshadi A, Curry E. Towards efficient dissemination of linked data in the Internet of Things. In Proceedings of the 2014 ACM International Conference on Information and Knowledge Management: CIKM 2014. Association for Computing Machinery, Inc. 2014. p. 1779-1782 https://doi.org/10.1145/2661829.2661889