N auti LOD

Author:

Fionda Valeria1,Pirrò Giuseppe2,Gutierrez Claudio3

Affiliation:

1. Department of Mathematics and Computer Science, University of Calabria

2. WeST, University of Koblenz

3. DCC, University of Chile

Abstract

The Web of Linked Data is a huge graph of distributed and interlinked datasources fueled by structured information. This new environment calls for formal languages and tools to automatize navigation across datasources (nodes in such graph) and enable semantic-aware and Web-scale search mechanisms. In this article we introduce a declarative navigational language for the Web of Linked Data graph called N auti LOD. N auti LOD enables one to specify datasources via the intertwining of navigation and querying capabilities. It also features a mechanism to specify actions (e.g., send notification messages) that obtain their parameters from datasources reached during the navigation. We provide a formalization of the N auti LOD semantics, which captures both nodes and fragments of the Web of Linked Data. We present algorithms to implement such semantics and study their computational complexity. We discuss an implementation of the features of N auti LOD in a tool called swget, which exploits current Web technologies and protocols. We report on the evaluation of swget and its comparison with related work. Finally, we show the usefulness of capturing Web fragments by providing examples in different knowledge domains.

Funder

European Social Fund

Calabria region

EU Framework Programme for Research and Innovation

projects FONDECYT No. 1110287

European Commission

Millenium Nucleus CIWS, NC120004

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Reference53 articles.

1. K. Alexander R. Cyganiak M. Hausenblas and J. Zhao. 2010. Describing Linked Datasets with the voiD Vocabulary. Retrieved from http://www.w3.org/2001/sw/interest/void/. K. Alexander R. Cyganiak M. Hausenblas and J. Zhao. 2010. Describing Linked Datasets with the voiD Vocabulary. Retrieved from http://www.w3.org/2001/sw/interest/void/.

2. Extending SPARQL with regular expression patterns (for querying RDF)

3. Survey of graph database models

Cited by 30 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3