Towards an RDF Validation Language Based on Regular Expression Derivatives

José Emilio Labra Gayo; Eric Prud'hommeaux; Iovka Boneva; Slawek Staworko; Harold R. Solbrig; Samuel Hym

Towards an RDF Validation Language Based on Regular Expression Derivatives

José Emilio Labra Gayo, Eric Prud'hommeaux, Iovka Boneva, Slawek Staworko, Harold R. Solbrig, Samuel Hym

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

There is a growing interest in the validation of RDF based solutions where one can express the opology 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 language	English
Title of host publication	Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), Brussels, Belgium, March 27th, 2015.
Pages	197-204
Number of pages	8
Publication status	Published - 2015

Access to Document

Gyo Prud'hommeaux ET AL 2015 Towards an RDF Validation Language Based on Regular Expression DerivativesFinal published version, 253 KB

http://ceur-ws.org/Vol-1330/paper-32.pdf

Cite this

@inproceedings{15afb0b37464442da3f39cdc4076a54c,

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 opology 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, {Jos{\'e} Emilio Labra} and Eric Prud'hommeaux and Iovka Boneva and Slawek Staworko and Solbrig, {Harold R.} and Samuel Hym",

year = "2015",

language = "English",

pages = "197--204",

booktitle = "Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), Brussels, Belgium, March 27th, 2015.",

}

Towards an RDF Validation Language Based on Regular Expression Derivatives. / Gayo, José Emilio Labra; Prud'hommeaux, Eric; Boneva, Iovka et al.

Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), Brussels, Belgium, March 27th, 2015.. 2015. p. 197-204.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Towards an RDF Validation Language Based on Regular Expression Derivatives

AU - Gayo, José Emilio Labra

AU - Prud'hommeaux, Eric

AU - Boneva, Iovka

AU - Staworko, Slawek

AU - Solbrig, Harold R.

AU - Hym, Samuel

PY - 2015

Y1 - 2015

N2 - There is a growing interest in the validation of RDF based solutions where one can express the opology 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 opology 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.

M3 - Conference contribution

SP - 197

EP - 204

BT - Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), Brussels, Belgium, March 27th, 2015.

ER -

Towards an RDF Validation Language Based on Regular Expression Derivatives

Abstract

Access to Document

Fingerprint

Cite this