DROPS

Document

Shapes in Graph Data: Theory and Implementation (Dagstuhl Seminar 24102)

Authors: Shqiponja Ahmetaj, Slawomir Staworko, Jan Van den Bussche, and Maxime Jakubowski

Published in: Dagstuhl Reports, Volume 14, Issue 3 (2024)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar "Shapes in Graph Data: Theory and Implementation" (24102). The seminar brought together active expert and junior researchers, both from academia and industry, to discuss the many open problems and research directions that arise from shapes in graph data, and, more generally, flexible and expressive schema and constraint languages for graph databases. The participants informed each other on how we perceive the research area, reported on the most recent results, discussed open problems and future directions, and in particular, four working groups were formed with promising intentions to work on new research and vision papers.

Cite as

Shqiponja Ahmetaj, Slawomir Staworko, Jan Van den Bussche, and Maxime Jakubowski. Shapes in Graph Data: Theory and Implementation (Dagstuhl Seminar 24102). In Dagstuhl Reports, Volume 14, Issue 3, pp. 9-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{ahmetaj_et_al:DagRep.14.3.9,
  author =	{Ahmetaj, Shqiponja and Staworko, Slawomir and Van den Bussche, Jan and Jakubowski, Maxime},
  title =	{{Shapes in Graph Data: Theory and Implementation (Dagstuhl Seminar 24102)}},
  pages =	{9--30},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2024},
  volume =	{14},
  number =	{3},
  editor =	{Ahmetaj, Shqiponja and Staworko, Slawomir and Van den Bussche, Jan and Jakubowski, Maxime},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.3.9},
  URN =		{urn:nbn:de:0030-drops-211818},
  doi =		{10.4230/DagRep.14.3.9},
  annote =	{Keywords: constraint languages, data for the semantic web, graph data, schema languages}
}

Document

DOI: 10.4230/LIPIcs.ICDT.2022.15

Expressiveness of SHACL Features

Authors: Bart Bogaerts, Maxime Jakubowski, and Jan Van den Bussche

Published in: LIPIcs, Volume 220, 25th International Conference on Database Theory (ICDT 2022)

Abstract

SHACL is a W3C-proposed schema language for expressing structural constraints on RDF graphs. Recent work on formalizing this language has revealed a striking relationship to description logics. SHACL expressions can use four fundamental features that are not so common in description logics. These features are zero-or-one path expressions; equality tests; disjointness tests; and closure constraints. Moreover, SHACL is peculiar in allowing only a restricted form of expressions (so-called targets) on the left-hand side of inclusion constraints. The goal of this paper is to obtain a clear picture of the impact and expressiveness of these features and restrictions. We show that each of the four features is primitive: using the feature, one can express boolean queries that are not expressible without using the feature. We also show that the restriction that SHACL imposes on allowed targets is inessential, as long as closure constraints are not used.

Cite as

Bart Bogaerts, Maxime Jakubowski, and Jan Van den Bussche. Expressiveness of SHACL Features. In 25th International Conference on Database Theory (ICDT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 220, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{bogaerts_et_al:LIPIcs.ICDT.2022.15,
  author =	{Bogaerts, Bart and Jakubowski, Maxime and Van den Bussche, Jan},
  title =	{{Expressiveness of SHACL Features}},
  booktitle =	{25th International Conference on Database Theory (ICDT 2022)},
  pages =	{15:1--15:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-223-5},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{220},
  editor =	{Olteanu, Dan and Vortmeier, Nils},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.15},
  URN =		{urn:nbn:de:0030-drops-158890},
  doi =		{10.4230/LIPIcs.ICDT.2022.15},
  annote =	{Keywords: Expressive power, schema languages}
}

Search Results

Documents authored by Jakubowski, Maxime

Shapes in Graph Data: Theory and Implementation (Dagstuhl Seminar 24102)

Abstract

Cite as

Expressiveness of SHACL Features

Abstract

Cite as

Thanks for your feedback!

Could not send message