Papers
Topics
Authors
Recent
Search
2000 character limit reached

Validating and describing linked data portals using shapes

Published 31 Jan 2017 in cs.DB and cs.NI | (1701.08924v1)

Abstract: Linked data portals need to be able to advertise and describe the structure of their content. A sufficiently expressive and intuitive schema language will allow portals to communicate these structures. Validation tools will aid in the publication and maintenance of linked data and increase their quality. Two schema language proposals have recently emerged for describing the structures of RDF graphs: Shape Expressions (ShEx) and Shapes Constraint Language (SHACL). In this paper we describe how these formalisms can be used in the development of a linked data portal to describe and validate its contents. As a use case, we specify a data model inspired by the WebIndex data model, a medium size linked data portal, using both ShEx and SHACL, and we propose a benchmark that can generate compliant test data structures of any size. We then perform some preliminary experiments showing performance of one validation engine based on ShEx.

Citations (9)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.