Mapping Spatiotemporal Data to RDF: a SPARQL Endpoint for Brussels
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Basic Querying with SPARQL
Basic Querying with SPARQL Andrew Weidner Metadata Services Coordinator SPARQL SPARQL SPARQL SPARQL SPARQL Protocol SPARQL SPARQL Protocol And SPARQL SPARQL Protocol And RDF SPARQL SPARQL Protocol And RDF Query SPARQL SPARQL Protocol And RDF Query Language SPARQL SPARQL Protocol And RDF Query Language SPARQL Query SPARQL Query Update SPARQL Query Update - Insert triples SPARQL Query Update - Insert triples - Delete triples SPARQL Query Update - Insert triples - Delete triples - Create graphs SPARQL Query Update - Insert triples - Delete triples - Create graphs - Drop graphs Query RDF Triples Query RDF Triples Triple Store Query RDF Triples Triple Store Data Dump Query RDF Triples Triple Store Data Dump Subject – Predicate – Object Query Subject – Predicate – Object ?s ?p ?o Query Dog HasName Cocoa Subject – Predicate – Object ?s ?p ?o Query Cocoa HasPhoto ------- Subject – Predicate – Object ?s ?p ?o Query HasURL http://bit.ly/1GYVyIX Subject – Predicate – Object ?s ?p ?o Query ?s ?p ?o Query SELECT ?s ?p ?o Query SELECT * ?s ?p ?o Query SELECT * WHERE ?s ?p ?o Query SELECT * WHERE { ?s ?p ?o } Query select * WhErE { ?spiderman ?plays ?oboe } http://deathbattle.wikia.com/wiki/Spider-Man http://www.mmimports.com/wp-content/uploads/2014/04/used-oboe.jpg Query SELECT * WHERE { ?s ?p ?o } Query SELECT * WHERE { ?s ?p ?o } Query SELECT * WHERE { ?s ?p ?o } Query SELECT * WHERE { ?s ?p ?o } LIMIT 10 SELECT * WHERE { ?s ?p ?o } LIMIT 10 http://dbpedia.org/snorql SELECT * WHERE { ?s ?p ?o } LIMIT 10 http://dbpedia.org/snorql SELECT * WHERE { ?s -
Semantic Web Core Technologies Semantic Web Core Technologies
12/20/13 Semantic Web Core Technologies Semantic Web Core Technologies Muhammad Alsharif, mhalsharif at gmail.com (A paper written under the guidance of Prof. Raj Jain) Download Abstract This is survey of semantic web primary infrastructure. Semantic web aims to link the data everywhere and make them understandable for machines as well as humans. Implementing the full vision of the semantic web has a long way to go but a number of its necessary building blocks are being standardized. In this paper, the three core technologies for linking web data, defining vocabularies, and querying information are going to be introduced and discussed. Keywords: web 3.0, semantic web, semantic web stack, resource description framework, RDF schema, web ontology language, SPARQL Table of Contents 1. Introduction 2. Semantic Web Stack 3. Linked Data 3.1. Resource Description Framework (RDF) 3.2. RDF vs XML 4. Vocabularies 4.1. RDFS 4.2. RDFS vs OWL 5. Query 5.1. SPARQL 5.2. SPARQL vs SQL 6. Summary 7. Acronyms 8. References 1. Introduction The main goal of the semantic web is to improve upon the existing “web of documents†to be a “web of dataâ€. The first version of the web (web 1.0) revolutionized the use of Internet in both academia and industry by introducing the idea of hyperlinking, which has interconnected billions of web pages over the globe and made documents accessible from multiple points. Web 2.0 has expanded over this concept by adding the user interactivity/participation element such as the dynamic creation of data on websites by content management systems (CMS) which has led to the emergence of social media such as blogs, flickr, youtube, twitter, etc. -
Validating RDF Data Using Shapes
83 Validating RDF data using Shapes a Jose Emilio Labra Gayo a University of Oviedo, Spain Abstract RDF forms the keystone of the Semantic Web as it enables a simple and powerful knowledge representation graph based data model that can also facilitate integration between heterogeneous sources of information. RDF based applications are usually accompanied with SPARQL stores which enable to efficiently manage and query RDF data. In spite of its well known benefits, the adoption of RDF in practice by web programmers is still lacking and SPARQL stores are usually deployed without proper documentation and quality assurance. However, the producers of RDF data usually know the implicit schema of the data they are generating, but they don't do it traditionally. In the last years, two technologies have been developed to describe and validate RDF content using the term shape: Shape Expressions (ShEx) and Shapes Constraint Language (SHACL). We will present a motivation for their appearance and compare them, as well as some applications and tools that have been developed. Keywords RDF, ShEx, SHACL, Validating, Data quality, Semantic web 1. Introduction In the tutorial we will present an overview of both RDF is a flexible knowledge and describe some challenges and future work [4] representation language based of graphs which has been successfully adopted in semantic web 2. Acknowledgements applications. In this tutorial we will describe two languages that have recently been proposed for This work has been partially funded by the RDF validation: Shape Expressions (ShEx) and Spanish Ministry of Economy, Industry and Shapes Constraint Language (SHACL).ShEx was Competitiveness, project: TIN2017-88877-R proposed as a concise and intuitive language for describing RDF data in 2014 [1]. -
Computational Integrity for Outsourced Execution of SPARQL Queries
Computational integrity for outsourced execution of SPARQL queries Serge Morel Student number: 01407289 Supervisors: Prof. dr. ir. Ruben Verborgh, Dr. ir. Miel Vander Sande Counsellors: Ir. Ruben Taelman, Joachim Van Herwegen Master's dissertation submitted in order to obtain the academic degree of Master of Science in Computer Science Engineering Academic year 2018-2019 Computational integrity for outsourced execution of SPARQL queries Serge Morel Student number: 01407289 Supervisors: Prof. dr. ir. Ruben Verborgh, Dr. ir. Miel Vander Sande Counsellors: Ir. Ruben Taelman, Joachim Van Herwegen Master's dissertation submitted in order to obtain the academic degree of Master of Science in Computer Science Engineering Academic year 2018-2019 iii c Ghent University The author(s) gives (give) permission to make this master dissertation available for consultation and to copy parts of this master dissertation for personal use. In the case of any other use, the copyright terms have to be respected, in particular with regard to the obligation to state expressly the source when quoting results from this master dissertation. August 16, 2019 Acknowledgements The topic of this thesis concerns a rather novel and academic concept. Its research area has incredibly talented people working on a very promising technology. Understanding the core principles behind proof systems proved to be quite difficult, but I am strongly convinced that it is a thing of the future. Just like the often highly-praised artificial intelligence technology, I feel that verifiable computation will become very useful in the future. I would like to thank Joachim Van Herwegen and Ruben Taelman for steering me in the right direction and reviewing my work quickly and intensively. -
A Review of Openstreetmap Data Peter Mooney* and Marco Minghini† *Department of Computer Science, Maynooth University, Maynooth, Co
CHAPTER 3 A Review of OpenStreetMap Data Peter Mooney* and Marco Minghini† *Department of Computer Science, Maynooth University, Maynooth, Co. Kildare, Ireland, [email protected] †Department of Civil and Environmental Engineering, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133 Milano, Italy Abstract While there is now a considerable variety of sources of Volunteered Geo- graphic Information (VGI) available, discussion of this domain is often exem- plified by and focused around OpenStreetMap (OSM). In a little over a decade OSM has become the leading example of VGI on the Internet. OSM is not just a crowdsourced spatial database of VGI; rather, it has grown to become a vast ecosystem of data, software systems and applications, tools, and Web-based information stores such as wikis. An increasing number of developers, indus- try actors, researchers and other end users are making use of OSM in their applications. OSM has been shown to compare favourably with other sources of spatial data in terms of data quality. In addition to this, a very large OSM community updates data within OSM on a regular basis. This chapter provides an introduction to and review of OSM and the ecosystem which has grown to support the mission of creating a free, editable map of the whole world. The chapter is especially meant for readers who have no or little knowledge about the range, maturity and complexity of the tools, services, applications and organisations working with OSM data. We provide examples of tools and services to access, edit, visualise and make quality assessments of OSM data. We also provide a number of examples of applications, such as some of those How to cite this book chapter: Mooney, P and Minghini, M. -
Introduction Vocabulary an Excerpt of a Dbpedia Dataset
D2K Master Information Integration Université Paris Saclay Practical session (2): SPARQL Sources: http://liris.cnrs.fr/~pchampin/2015/udos/tuto/#id1 https://www.w3.org/TR/2013/REC-sparql11-query-20130321/ Introduction For this practical session, we will use the DBPedia SPARQL access point, and to access it, we will use the Yasgui online client. By default, Yasgui (http://yasgui.org/) is configured to query DBPedia (http://wiki.dbpedia.org/), which is appropriate for our tutorial, but keep in mind that: - Yasgui is not linked to DBpedia, it can be used with any SPARQL access point; - DBPedia is not related to Yasgui, it can be queried with any SPARQL compliant client (in fact any HTTP client that is not very configurable). Vocabulary An excerpt of a dbpedia dataset The vocabulary of DBPedia is very large, but in this tutorial we will only need the IRIs below. foaf:name Propriété Nom d’une personne (entre autre) dbo:birthDate Propriété Date de naissance d’une personne dbo:birthPlace Propriété Lieu de naissance d’une personne dbo:deathDate Propriété Date de décès d’une personne dbo:deathPlace Propriété Lieu de décès d’une personne dbo:country Propriété Pays auquel un lieu appartient dbo:mayor Propriété Maire d’une ville dbr:Digne-les-Bains Instance La ville de Digne les bains dbr:France Instance La France -1- /!\ Warning: IRIs are case-sensitive. Exercises 1. Display the IRIs of all Dignois of origin (people born in Digne-les-Bains) Graph Pattern Answer: PREFIX rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> PREFIX owl: <http://www.w3.org/2002/07/owl#> PREFIX rdfs: <http://www.w3.org/2000/01/rdf-schema#> PREFIX foaf: <http://xmlns.com/foaf/0.1/> PREFIX skos: <http://www.w3.org/2004/02/skos/core#> PREFIX dc: <http://purl.org/dc/elements/1.1/> PREFIX dbo: <http://dbpedia.org/ontology/> PREFIX dbr: <http://dbpedia.org/resource/> PREFIX db: <http://dbpedia.org/> SELECT * WHERE { ?p dbo:birthPlace dbr:Digne-les-Bains . -
Hidden Meaning
FEATURES Microdata and Microformats Kit Sen Chin, 123RF.com Chin, Sen Kit Working with microformats and microdata Hidden Meaning Programs aren’t as smart as humans when it comes to interpreting the meaning of web information. If you want to maximize your search rank, you might want to dress up your HTML documents with microformats and microdata. By Andreas Möller TML lets you mark up sections formats and microdata into your own source code for the website shown in of text as headings, body text, programs. Figure 1 – an HTML5 document with a hyperlinks, and other web page business card. The Heading text block is H elements. However, these defi- Microformats marked up with the element h1. The text nitions have nothing to do with the HTML was originally designed for hu- for the business card is surrounded by meaning of the data: Does the text refer mans to read, but with the explosive the div container element, and <br/> in- to a person, an organization, a product, growth of the web, programs such as troduces a line break. or an event? Microformats [1] and their search engines also process HTML data. It is easy for a human reader to see successor, microdata [2] make the mean- What do programs that read HTML data that the data shown in Figure 1 repre- ing a bit more clear by pointing to busi- typically find? Listing 1 shows the HTML sents a business card – even if the text is ness cards, product descriptions, offers, and event data in a machine-readable LISTING 1: HTML5 Document with Business Card way. -
Open Web Ontobud: an Open Source RDF4J Frontend
Open Web Ontobud: An Open Source RDF4J Frontend Francisco José Moreira Oliveira University of Minho, Braga, Portugal [email protected] José Carlos Ramalho Department of Informatics, University of Minho, Braga, Portugal [email protected] Abstract Nowadays, we deal with increasing volumes of data. A few years ago, data was isolated, which did not allow communication or sharing between datasets. We live in a world where everything is connected, and our data mimics this. Data model focus changed from a square structure like the relational model to a model centered on the relations. Knowledge graphs are the new paradigm to represent and manage this new kind of information structure. Along with this new paradigm, a new kind of database emerged to support the new needs, graph databases! Although there is an increasing interest in this field, only a few native solutions are available. Most of these are commercial, and the ones that are open source have poor interfaces, and for that, they are a little distant from end-users. In this article, we introduce Ontobud, and discuss its design and development. A Web application that intends to improve the interface for one of the most interesting frameworks in this area: RDF4J. RDF4J is a Java framework to deal with RDF triples storage and management. Open Web Ontobud is an open source RDF4J web frontend, created to reduce the gap between end users and the RDF4J backend. We have created a web interface that enables users with a basic knowledge of OWL and SPARQL to explore ontologies and extract information from them. -
A Performance Study of RDF Stores for Linked Sensor Data
Semantic Web 1 (0) 1–5 1 IOS Press 1 1 2 2 3 3 4 A Performance Study of RDF Stores for 4 5 5 6 Linked Sensor Data 6 7 7 8 Hoan Nguyen Mau Quoc a,*, Martin Serrano b, Han Nguyen Mau c, John G. Breslin d , Danh Le Phuoc e 8 9 a Insight Centre for Data Analytics, National University of Ireland Galway, Ireland 9 10 E-mail: [email protected] 10 11 b Insight Centre for Data Analytics, National University of Ireland Galway, Ireland 11 12 E-mail: [email protected] 12 13 c Information Technology Department, Hue University, Viet Nam 13 14 E-mail: [email protected] 14 15 d Confirm Centre for Smart Manufacturing and Insight Centre for Data Analytics, National University of Ireland 15 16 Galway, Ireland 16 17 E-mail: [email protected] 17 18 e Open Distributed Systems, Technical University of Berlin, Germany 18 19 E-mail: [email protected] 19 20 20 21 21 Editors: First Editor, University or Company name, Country; Second Editor, University or Company name, Country 22 Solicited reviews: First Solicited Reviewer, University or Company name, Country; Second Solicited Reviewer, University or Company name, 22 23 Country 23 24 Open reviews: First Open Reviewer, University or Company name, Country; Second Open Reviewer, University or Company name, Country 24 25 25 26 26 27 27 28 28 29 Abstract. The ever-increasing amount of Internet of Things (IoT) data emanating from sensor and mobile devices is creating 29 30 new capabilities and unprecedented economic opportunity for individuals, organisations and states. -
Storage, Indexing, Query Processing, And
Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 23 May 2020 doi:10.20944/preprints202005.0360.v1 STORAGE,INDEXING,QUERY PROCESSING, AND BENCHMARKING IN CENTRALIZED AND DISTRIBUTED RDF ENGINES:ASURVEY Waqas Ali Department of Computer Science and Engineering, School of Electronic, Information and Electrical Engineering (SEIEE), Shanghai Jiao Tong University, Shanghai, China [email protected] Muhammad Saleem Agile Knowledge and Semantic Web (AKWS), University of Leipzig, Leipzig, Germany [email protected] Bin Yao Department of Computer Science and Engineering, School of Electronic, Information and Electrical Engineering (SEIEE), Shanghai Jiao Tong University, Shanghai, China [email protected] Axel-Cyrille Ngonga Ngomo University of Paderborn, Paderborn, Germany [email protected] ABSTRACT The recent advancements of the Semantic Web and Linked Data have changed the working of the traditional web. There is a huge adoption of the Resource Description Framework (RDF) format for saving of web-based data. This massive adoption has paved the way for the development of various centralized and distributed RDF processing engines. These engines employ different mechanisms to implement key components of the query processing engines such as data storage, indexing, language support, and query execution. All these components govern how queries are executed and can have a substantial effect on the query runtime. For example, the storage of RDF data in various ways significantly affects the data storage space required and the query runtime performance. The type of indexing approach used in RDF engines is key for fast data lookup. The type of the underlying querying language (e.g., SPARQL or SQL) used for query execution is a key optimization component of the RDF storage solutions. -
Discovering Alignments in Ontologies of Linked Data∗
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Discovering Alignments in Ontologies of Linked Data∗ Rahul Parundekar, Craig A. Knoblock, and Jose´ Luis Ambite University of Southern California Information Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90292 Abstract The problem of schema linking (aka schema matching in databases and ontology alignment in the Semantic Web) has Recently, large amounts of data are being published received much attention [Bellahsene et al., 2011; Euzenat and using Semantic Web standards. Simultaneously, Shvaiko, 2007; Bernstein et al., 2011; Gal, 2011]. In this there has been a steady rise in links between objects paper we present a novel extensional approach to generate from multiple sources. However, the ontologies alignments between ontologies of linked data sources. Sim- behind these sources have remained largely dis- ilar to previous work on instance-based matching [Duckham connected, thereby challenging the interoperabil- and Worboys, 2005; Doan et al., 2004; Isaac et al., 2007], ity goal of the Semantic Web. We address this we rely on linked instances to determine the alignments. Two problem by automatically finding alignments be- concepts are equivalent if all (or most of) their respective in- tween concepts from multiple linked data sources. stances are linked (by owl:sameAs or similar links). How- Instead of only considering the existing concepts ever, our search is not limited to the existing concepts in in each ontology, we hypothesize new composite the ontology. We hypothesize new concepts by combining concepts, defined using conjunctions and disjunc- existing elements in the ontologies and seek alignments be- tions of (RDF) types and value restrictions, and tween these more general concepts. -
Linked Data Enables Such Web of Data Global Identifier
Lift your data Introduction to Linked Data Ghislain Atemezing1 , Boris Villazón-Terrazas2 1 EURECOM, France [email protected] 2 Ontology Engineering Group , FI , UPM [email protected] Slides available at: http://www.slideshare.net/atemezing/ INSPIRE Conference 2012, Istanbul Acknowledgements: Oscar Corcho, Asunción Gómez-Pérez, Luis Vilches, Raphaël Troncy, Olaf Hartig, Luis Vilches and many others that we may have omitted. Workdistributed under the license Creative Commons Attribution- Noncommercial-Share Alike 3.0 Agenda Linked Data Geospatial LD Datasets 5-star deployment scheme for Linked Open Data Tutorial “Lift your data”, Istanbul 2012 2 Agenda Linked Data Geospatial LD Datasets 5-star deployment scheme for Linked Open Data Tutorial “Lift your data”, Istanbul 2012 3 Current Web Geospatial Database (Spain) Data exposed to the Web via HTML, pdf, etc. Statistical Database (Spain) © Slide adapted from “5min Introduction to Linked Data”- Olaf Hartig Tutorial “Lift your data”, Istanbul 2012 4 Information from ssgeingle pages can be found via sear ch eegngin es © Slide adapted from “5min Introduction to Linked Data”- Olaf Hartig Tutorial “Lift your data”, Istanbul 2012 5 Complex queries over muliltipl e pages/data sources? © Slide adapted from “5min Introduction to Linked Data”- Olaf Hartig Tutorial “Lift your data”, Istanbul 2012 6 What do we actually want? • Use the Web like a single global database • web of documents -> web of data Geospatial Statistical Database Database (Spain) (Spain) © Slide adapted from “5min Introduction to Linked Data”- Olaf Hartig 7 Tutorial “Lift your data”, Istanbul 2012 7 Linked Data enables such Web of Data Global Identifier: URI (Uniform Resource Identifier), which is a string of characters used to identify a name or a resource on the Internet.