Common Foundations for SHACL, ShEx, and PG-Schema. Ahmetaj, S., Boneva, I., Hidders, J., Hose, K., Jakubowski, M., Labra-Gayo, J., Martens, W., Murlak, F., Okulmus, C., Polleres, A., Savković, O., & ans Dominik Tomaszuk, M. S. In The Web Conference 2025, Sydney, Australia, 2025. to appear, accepted for publicationabstract bibtex Graphs have emerged as an important foundation for a variety of applications, including capturing and reasoning over factual knowledge, semantic data integration, social networks, and providing factual knowledge for machine learning algorithms. To formalise certain properties of the data and to ensure data quality, there is a need to describe the \emphschema of such graphs. Because of the breadth of applications and availability of different data models, such as RDF and property graphs, both the Semantic Web and the database community have independently developed \emphgraph schema languages: SHACL, ShEx, and PG-Schema. Each language has its unique approach to defining constraints and validating graph data, leaving potential users in the dark about their commonalities and differences. In this paper, we provide formal, concise definitions of the \emphcore components of each of these schema languages.We employ a uniform framework to facilitate a comprehensive comparison between the languages and identify a common set of functionalities, shedding light on both overlapping and distinctive features of the three languages.
@inproceedings{ahme-etal-2025WWW,
title = {Common Foundations for SHACL, ShEx, and PG-Schema},
author = {Shqiponja Ahmetaj and Iovka Boneva and Jan Hidders and Katja Hose and Maxime Jakubowski and Jose-Emilio Labra-Gayo and Wim Martens and Filip Murlak and Cem Okulmus and Axel Polleres and Ognjen Savkovi\'c and Mantas Simkus ans Dominik Tomaszuk},
year = 2025,
booktitle = {The Web Conference 2025},
address = {Sydney, Australia},
note = {to appear, accepted for publication},
abstract = {Graphs have emerged as an important foundation for a variety of applications, including capturing and reasoning over factual knowledge, semantic data integration, social networks, and providing factual knowledge for machine learning algorithms. To formalise certain properties of the data and to ensure data quality, there is a need to describe the \emph{schema} of such graphs. Because of the breadth of applications and availability of different data models, such as RDF and property graphs, both the Semantic Web and the database community have independently developed \emph{graph schema languages}: SHACL, ShEx, and PG-Schema. Each language has its unique approach to defining constraints and validating graph data, leaving potential users in the dark about their commonalities and differences. In this paper, we provide formal, concise definitions of the \emph{core
components} of each of these schema languages.We employ a uniform framework to facilitate a comprehensive comparison between the languages and identify a common set of functionalities, shedding light on both overlapping and distinctive features of the three languages.},
}
Downloads: 0
{"_id":"5ewACoR6CcdCFCzWT","bibbaseid":"ahmetaj-boneva-hidders-hose-jakubowski-labragayo-martens-murlak-etal-commonfoundationsforshaclshexandpgschema-2025","author_short":["Ahmetaj, S.","Boneva, I.","Hidders, J.","Hose, K.","Jakubowski, M.","Labra-Gayo, J.","Martens, W.","Murlak, F.","Okulmus, C.","Polleres, A.","Savković, O.","ans Dominik Tomaszuk, M. S."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Common Foundations for SHACL, ShEx, and PG-Schema","author":[{"firstnames":["Shqiponja"],"propositions":[],"lastnames":["Ahmetaj"],"suffixes":[]},{"firstnames":["Iovka"],"propositions":[],"lastnames":["Boneva"],"suffixes":[]},{"firstnames":["Jan"],"propositions":[],"lastnames":["Hidders"],"suffixes":[]},{"firstnames":["Katja"],"propositions":[],"lastnames":["Hose"],"suffixes":[]},{"firstnames":["Maxime"],"propositions":[],"lastnames":["Jakubowski"],"suffixes":[]},{"firstnames":["Jose-Emilio"],"propositions":[],"lastnames":["Labra-Gayo"],"suffixes":[]},{"firstnames":["Wim"],"propositions":[],"lastnames":["Martens"],"suffixes":[]},{"firstnames":["Filip"],"propositions":[],"lastnames":["Murlak"],"suffixes":[]},{"firstnames":["Cem"],"propositions":[],"lastnames":["Okulmus"],"suffixes":[]},{"firstnames":["Axel"],"propositions":[],"lastnames":["Polleres"],"suffixes":[]},{"firstnames":["Ognjen"],"propositions":[],"lastnames":["Savković"],"suffixes":[]},{"firstnames":["Mantas","Simkus"],"propositions":["ans"],"lastnames":["Dominik","Tomaszuk"],"suffixes":[]}],"year":"2025","booktitle":"The Web Conference 2025","address":"Sydney, Australia","note":"to appear, accepted for publication","abstract":"Graphs have emerged as an important foundation for a variety of applications, including capturing and reasoning over factual knowledge, semantic data integration, social networks, and providing factual knowledge for machine learning algorithms. To formalise certain properties of the data and to ensure data quality, there is a need to describe the \\emphschema of such graphs. Because of the breadth of applications and availability of different data models, such as RDF and property graphs, both the Semantic Web and the database community have independently developed \\emphgraph schema languages: SHACL, ShEx, and PG-Schema. Each language has its unique approach to defining constraints and validating graph data, leaving potential users in the dark about their commonalities and differences. In this paper, we provide formal, concise definitions of the \\emphcore components of each of these schema languages.We employ a uniform framework to facilitate a comprehensive comparison between the languages and identify a common set of functionalities, shedding light on both overlapping and distinctive features of the three languages.","bibtex":"@inproceedings{ahme-etal-2025WWW,\n title = {Common Foundations for SHACL, ShEx, and PG-Schema},\n author = {Shqiponja Ahmetaj and Iovka Boneva and Jan Hidders and Katja Hose and Maxime Jakubowski and Jose-Emilio Labra-Gayo and Wim Martens and Filip Murlak and Cem Okulmus and Axel Polleres and Ognjen Savkovi\\'c and Mantas Simkus ans Dominik Tomaszuk},\n year = 2025,\n booktitle = {The Web Conference 2025},\n address = {Sydney, Australia},\n note = {to appear, accepted for publication},\n abstract = {Graphs have emerged as an important foundation for a variety of applications, including capturing and reasoning over factual knowledge, semantic data integration, social networks, and providing factual knowledge for machine learning algorithms. To formalise certain properties of the data and to ensure data quality, there is a need to describe the \\emph{schema} of such graphs. Because of the breadth of applications and availability of different data models, such as RDF and property graphs, both the Semantic Web and the database community have independently developed \\emph{graph schema languages}: SHACL, ShEx, and PG-Schema. Each language has its unique approach to defining constraints and validating graph data, leaving potential users in the dark about their commonalities and differences. In this paper, we provide formal, concise definitions of the \\emph{core\ncomponents} of each of these schema languages.We employ a uniform framework to facilitate a comprehensive comparison between the languages and identify a common set of functionalities, shedding light on both overlapping and distinctive features of the three languages.},\n}\n\n","author_short":["Ahmetaj, S.","Boneva, I.","Hidders, J.","Hose, K.","Jakubowski, M.","Labra-Gayo, J.","Martens, W.","Murlak, F.","Okulmus, C.","Polleres, A.","Savković, O.","ans Dominik Tomaszuk, M. S."],"key":"ahme-etal-2025WWW","id":"ahme-etal-2025WWW","bibbaseid":"ahmetaj-boneva-hidders-hose-jakubowski-labragayo-martens-murlak-etal-commonfoundationsforshaclshexandpgschema-2025","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"www.polleres.net/mypublications.bib","dataSources":["gixxkiKt6rtWGoKSh"],"keywords":[],"search_terms":["common","foundations","shacl","shex","schema","ahmetaj","boneva","hidders","hose","jakubowski","labra-gayo","martens","murlak","okulmus","polleres","savković","ans dominik tomaszuk"],"title":"Common Foundations for SHACL, ShEx, and PG-Schema","year":2025}