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 articlepeer-review

2 Scopus citations


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
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 → …

ASJC Scopus subject areas

  • General Computer Science


Dive into the research topics of 'Towards an RDF validation language based on regular expression derivatives'. Together they form a unique fingerprint.

Cite this