Investigating the Relevance of Linked Open Data Sets with SPARQL Queries

Thomas Holst, Edzard Höfig
{"title":"Investigating the Relevance of Linked Open Data Sets with SPARQL Queries","authors":"Thomas Holst, Edzard Höfig","doi":"10.1109/COMPSACW.2013.31","DOIUrl":null,"url":null,"abstract":"Linked open data sets are often complex in structure and large in size. Understanding unfamiliar data is a central process when establishing trust with hitherto unknown information. Unfortunately, this can be problematic: manual inspection might be prohibitively time-intensive and would require the complete data set to be available. We propose to investigate the structure and content of data sets using a series of specific queries executed over a given SPARQL endpoint. Within the paper we first define 14 queries, motivate why we created them, and explain how they work. Subsequently, we are demonstrating the feasibility of this approach by applying the queries in the context of a real-world use case study.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPSACW.2013.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Linked open data sets are often complex in structure and large in size. Understanding unfamiliar data is a central process when establishing trust with hitherto unknown information. Unfortunately, this can be problematic: manual inspection might be prohibitively time-intensive and would require the complete data set to be available. We propose to investigate the structure and content of data sets using a series of specific queries executed over a given SPARQL endpoint. Within the paper we first define 14 queries, motivate why we created them, and explain how they work. Subsequently, we are demonstrating the feasibility of this approach by applying the queries in the context of a real-world use case study.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用SPARQL查询调查链接开放数据集的相关性
链接的开放数据集通常结构复杂,规模大。理解不熟悉的数据是建立对迄今为止未知信息的信任的核心过程。不幸的是,这可能是有问题的:人工检查可能非常耗时,并且需要完整的数据集。我们建议使用在给定SPARQL端点上执行的一系列特定查询来研究数据集的结构和内容。在本文中,我们首先定义了14个查询,解释了创建它们的原因,并解释了它们是如何工作的。随后,我们将通过在实际用例研究的上下文中应用查询来演示此方法的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Patrol Guidance Mechanism in a Context-Aware Environment Investigating the Relevance of Linked Open Data Sets with SPARQL Queries A Distributed Protective Approach for Multiechelon Supply Systems Model Checking for SpaceWire Link Interface Design Using Uppaal An Optimal Route Selection Mechanism for Outbound Connection on IPv6 Site Multihoming Environment
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1