Towards an RDF validation language based on regular expression derivatives

Jose Emilio Labra Gayo, Eric Prud'hommeaux, Slawek Staworko, Harold Solbrig

Research output: Contribution to journalConference article

Abstract

There is a growing interest in the validation of RDF based solutions where one can express the topology of an RDF graph using some schema language that can check if RDF documents comply with it. Shape Expressions have been proposed as a simple, intuitive language that can be used to describe expected graph patterns and to validate RDF graphs against those patterns. The syntax and semantics of Shape Expressions are designed to be familiar to users of regular expressions. In this paper, we propose an implementation of Shape Expressions inspired by the regular expression derivatives but adapted to RDF graphs.

Original languageEnglish (US)
Pages (from-to)197-204
Number of pages8
JournalCEUR Workshop Proceedings
Volume1330
StatePublished - Jan 1 2015
Externally publishedYes
EventJoint Workshops of the International Conference on Extending Database Technology and the International Conference on Database Theory, EDBT/ICDT-WS 2015 - Brussels, Belgium
Duration: Mar 27 2015 → …

Fingerprint

Semantics
Topology
Derivatives

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Towards an RDF validation language based on regular expression derivatives. / Gayo, Jose Emilio Labra; Prud'hommeaux, Eric; Staworko, Slawek; Solbrig, Harold.

In: CEUR Workshop Proceedings, Vol. 1330, 01.01.2015, p. 197-204.

Research output: Contribution to journalConference article

Gayo, JEL, Prud'hommeaux, E, Staworko, S & Solbrig, H 2015, 'Towards an RDF validation language based on regular expression derivatives', CEUR Workshop Proceedings, vol. 1330, pp. 197-204.
Gayo, Jose Emilio Labra ; Prud'hommeaux, Eric ; Staworko, Slawek ; Solbrig, Harold. / Towards an RDF validation language based on regular expression derivatives. In: CEUR Workshop Proceedings. 2015 ; Vol. 1330. pp. 197-204.
@article{6d0573c21f3f4dc39af36857e98a8d77,
title = "Towards an RDF validation language based on regular expression derivatives",
abstract = "There is a growing interest in the validation of RDF based solutions where one can express the topology of an RDF graph using some schema language that can check if RDF documents comply with it. Shape Expressions have been proposed as a simple, intuitive language that can be used to describe expected graph patterns and to validate RDF graphs against those patterns. The syntax and semantics of Shape Expressions are designed to be familiar to users of regular expressions. In this paper, we propose an implementation of Shape Expressions inspired by the regular expression derivatives but adapted to RDF graphs.",
author = "Gayo, {Jose Emilio Labra} and Eric Prud'hommeaux and Slawek Staworko and Harold Solbrig",
year = "2015",
month = "1",
day = "1",
language = "English (US)",
volume = "1330",
pages = "197--204",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

TY - JOUR

T1 - Towards an RDF validation language based on regular expression derivatives

AU - Gayo, Jose Emilio Labra

AU - Prud'hommeaux, Eric

AU - Staworko, Slawek

AU - Solbrig, Harold

PY - 2015/1/1

Y1 - 2015/1/1

N2 - There is a growing interest in the validation of RDF based solutions where one can express the topology of an RDF graph using some schema language that can check if RDF documents comply with it. Shape Expressions have been proposed as a simple, intuitive language that can be used to describe expected graph patterns and to validate RDF graphs against those patterns. The syntax and semantics of Shape Expressions are designed to be familiar to users of regular expressions. In this paper, we propose an implementation of Shape Expressions inspired by the regular expression derivatives but adapted to RDF graphs.

AB - There is a growing interest in the validation of RDF based solutions where one can express the topology of an RDF graph using some schema language that can check if RDF documents comply with it. Shape Expressions have been proposed as a simple, intuitive language that can be used to describe expected graph patterns and to validate RDF graphs against those patterns. The syntax and semantics of Shape Expressions are designed to be familiar to users of regular expressions. In this paper, we propose an implementation of Shape Expressions inspired by the regular expression derivatives but adapted to RDF graphs.

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

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

M3 - Conference article

AN - SCOPUS:84924939576

VL - 1330

SP - 197

EP - 204

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -