{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,6]],"date-time":"2026-11-06T20:42:56Z","timestamp":1793997776592,"version":"4.8.0"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T00:00:00Z","timestamp":1734480000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004836","name":"Danish Council for Independent Research","doi-asserted-by":"crossref","award":["DFF-8048-00051B"],"award-info":[{"award-number":["DFF-8048-00051B"]}],"id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Agence Nationale de la Recherche VeriGraph","award":["ANR-21-CE48-0015"],"award-info":[{"award-number":["ANR-21-CE48-0015"]}]},{"DOI":"10.13039\/501100018870","name":"Poul Due Jensen Foundation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100018870","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,12,18]]},"abstract":"<jats:p>Knowledge Graphs can be encoded using different data models. They are especially abundant using RDF and recently also as property graphs. While knowledge graphs in RDF adhere to the subject-predicate-object structure, property graphs utilize multi-labeled nodes and edges, featuring properties as key\/value pairs. Both models are employed in various contexts, thus applications often require transforming data from one model to another. To enhance the interoperability of the two models, we present a novel technique, S3PG, to convert RDF knowledge graphs into property graphs exploiting two popular standards to express schema constraints, i.e., SHACL for RDF and PG-Schema for property graphs. S3PG is the first approach capable of transforming large knowledge graphs to property graphs while fully preserving information and semantics. We have evaluated S3PG on real-world large-scale graphs, showing that, while existing methods exhibit lossy transformations (causing a loss of up to 70% of query answers), S3PG consistently achieves 100% accuracy. Moreover, when considering evolving graphs, S3PG exhibits fully monotonic behavior and requires only a fraction of the time to incorporate changes compared to existing methods.<\/jats:p>","DOI":"10.1145\/3698817","type":"journal-article","created":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T16:40:35Z","timestamp":1734712835000},"page":"1-25","source":"Crossref","is-referenced-by-count":14,"title":["Transforming RDF Graphs to Property Graphs using Standardized Schemas"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6984-2121","authenticated-orcid":false,"given":"Kashif","family":"Rabbani","sequence":"first","affiliation":[{"name":"Aalborg University, Aalborg, DK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7922-5998","authenticated-orcid":false,"given":"Matteo","family":"Lissandrini","sequence":"additional","affiliation":[{"name":"University of Verona, Verona, IT"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9582-869X","authenticated-orcid":false,"given":"Angela","family":"Bonifati","sequence":"additional","affiliation":[{"name":"Lyon 1 University &amp; CNRS Liris &amp; IUF, Lyon, FR"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7025-8099","authenticated-orcid":false,"given":"Katja","family":"Hose","sequence":"additional","affiliation":[{"name":"TU Wien, Vienna, AT"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,20]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"QuWeDa@ISWC (CEUR Workshop Proceedings","author":"Abuoda Ghadeer","unstructured":"Ghadeer Abuoda, Daniele Dell'Aglio, Arthur Keen, and Katja Hose. 2022. Transforming RDF-star to Property Graphs: A Preliminary Analysis of Transformation Approaches. In QuWeDa@ISWC (CEUR Workshop Proceedings, Vol. 3279). CEUR-WS.org, 17--32."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589778"},{"key":"e_1_2_2_3_1","volume-title":"Pg-keys: Keys for property graphs. In SIGMOD-2021. 2423--2436.","author":"Angles Renzo","year":"2021","unstructured":"Renzo Angles, Angela Bonifati, Stefania Dumbrava, George Fletcher, Keith W Hare, Jan Hidders, Victor E Lee, Bei Li, Leonid Libkin, Wim Martens, et al. 2021. Pg-keys: Keys for property graphs. In SIGMOD-2021. 2423--2436."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534540.3534696"},{"key":"e_1_2_2_5_1","first-page":"1","article-title":"RDF and Property Graphs Interoperability","volume":"2369","author":"Angles Renzo","year":"2019","unstructured":"Renzo Angles, Harsh Thakkar, and Dominik Tomaszuk. 2019. RDF and Property Graphs Interoperability: Status and Issues. AMW 2369 (2019), 1--11.","journal-title":"Status and Issues. AMW"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.2993117"},{"key":"e_1_2_2_7_1","volume-title":"Ives","author":"Auer S\u00f6ren","year":"2007","unstructured":"S\u00f6ren Auer, Christian Bizer, Georgi Kobilarov, Jens Lehmann, Richard Cyganiak, and Zachary G. Ives. 2007. DBpedia: A Nucleus for a Web of Open Data. In ISWC-2007, Vol. 4825. Springer, Busan, Korea, 722--735."},{"key":"e_1_2_2_8_1","volume-title":"The Web Conference.","author":"Belth Caleb","year":"2020","unstructured":"Caleb Belth, Xinyi Zheng, Jilles Vreeken, and Danai Koutra. 2020. What is Normal, What is Strange, and What is Missing in an Knowledge Graph. In The Web Conference."},{"key":"e_1_2_2_9_1","unstructured":"Bio2rdf. 2020. Clinical Trials. https:\/\/download.bio2rdf.org\/#\/current\/clinicaltrials\/. Accessed on February 21 2024."},{"key":"e_1_2_2_10_1","volume-title":"Proceedings of the ISWC 2019 Satellite Tracks (CEUR Workshop Proceedings","volume":"272","author":"Boneva Iovka","year":"2019","unstructured":"Iovka Boneva, J\u00e9r\u00e9mie Dusart, Daniel Fern\u00e1ndez-\u00c1lvarez, and Jos\u00e9 Emilio Labra Gayo. 2019. Shape Designer for ShEx and SHACL constraints. In Proceedings of the ISWC 2019 Satellite Tracks (CEUR Workshop Proceedings, Vol. 2456). CEUR-WS.org, Auckland, New Zealand, 269--272."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554867"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","unstructured":"Angela Bonifati George H. L. Fletcher Hannes Voigt and Nikolay Yakovets. 2018. Querying Graphs. Morgan & Claypool Publishers. https:\/\/doi.org\/10.2200\/S00873ED1V01Y201808DTM051","DOI":"10.2200\/S00873ED1V01Y201808DTM051"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3681972"},{"key":"e_1_2_2_14_1","unstructured":"Marco Brandizi Ajit Singh and Keywan Hassani-Pak. 2018. Getting the best of Linked Data and Property Graphs: rdf2neo and the KnetMiner use case.. In SWAT4LS."},{"key":"e_1_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Hirokazu Chiba Ryota Yamanaka and Shota Matsumoto. 2020. G2GML: Graph to graph mapping language for bridging RDF and property graphs. In ISWC-2020. 160--175.","DOI":"10.1007\/978-3-030-62466-8_11"},{"key":"e_1_2_2_16_1","volume-title":"Astrea: Automatic Generation of SHACL Shapes from Ontologies. In ESWC","author":"Cimmino Andrea","year":"2020","unstructured":"Andrea Cimmino, Alba Fern\u00e1ndez-Izquierdo, and Ra\u00fal Garc\u00eda-Castro. 2020. Astrea: Automatic Generation of SHACL Shapes from Ontologies. In ESWC, Vol. 12123. Springer, Heraklion, Crete, Greece, 497."},{"key":"e_1_2_2_17_1","volume-title":"Accessed 10th","author":"WWW Consortium","year":"2014","unstructured":"WWW Consortium. 2014. RDF 1.1. https:\/\/w3.org\/RDF\/. Accessed 10th April, 2024."},{"key":"e_1_2_2_18_1","volume-title":"Accessed 10th","author":"WWW Consortium","year":"2014","unstructured":"WWW Consortium. 2014. RDF Schema 1.1. https:\/\/www.w3.org\/TR\/rdf-schema\/. Accessed 10th April, 2024."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.3390\/info14030154"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107975"},{"key":"e_1_2_2_21_1","volume-title":"Cypher: An evolving query language for property graphs. In SIGMOD-2018. 1433--1445.","author":"Francis Nadime","year":"2018","unstructured":"Nadime Francis, Alastair Green, Paolo Guagliardo, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Stefan Plantikow, Mats Rydberg, Petra Selmer, and Andr\u00e9s Taylor. 2018. Cypher: An evolving query language for property graphs. In SIGMOD-2018. 1433--1445."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3410352.3410833"},{"key":"e_1_2_2_23_1","volume-title":"Saga: A platform for continuous construction and serving of knowledge at scale. In SIGMOD-2022. 2259--2272.","author":"Ilyas Ihab F","year":"2022","unstructured":"Ihab F Ilyas, Theodoros Rekatsinas, Vishnu Konda, Jeffrey Pound, Xiaoguang Qi, and Mohamed Soliman. 2022. Saga: A platform for continuous construction and serving of knowledge at scale. In SIGMOD-2022. 2259--2272."},{"key":"e_1_2_2_24_1","volume-title":"Shapes constraint language (SHACL). W3C Candidate Recommendation 11, 8","author":"Knublauch Holger","year":"2017","unstructured":"Holger Knublauch and Dimitris Kontokostas. 2017. Shapes constraint language (SHACL). W3C Candidate Recommendation 11, 8 (2017)."},{"key":"e_1_2_2_25_1","unstructured":"Ora Lassila Michael Schmidt Brad Bebee Dave Bechberger Willem Broekema Ankesh Khandelwal Kelvin Lawrence Ronak Sharda and Bryan Thompson. 2021. Graph? Yes! Which one? Help! arXiv preprint arXiv:2110.13348 (2021)."},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543644"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3297753.3297759"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3167132.3167341"},{"key":"e_1_2_2_29_1","volume-title":"https:\/\/neo4j.com. Accessed","year":"2024","unstructured":"Neo4j. 2023. Neo4j. https:\/\/neo4j.com. Accessed: April 1, 2024."},{"key":"e_1_2_2_30_1","volume-title":"neosemantics configuration. https:\/\/neo4j.com\/labs\/neosemantics\/4.0\/config\/. Accessed","year":"2024","unstructured":"Neo4j. 2023. neosemantics configuration. https:\/\/neo4j.com\/labs\/neosemantics\/4.0\/config\/. Accessed: April 1, 2024."},{"key":"e_1_2_2_31_1","volume-title":"neosemantics (n10s): Neo4j RDF & Semantics toolkit. https:\/\/neo4j.com\/labs\/neosemantics\/. Accessed","year":"2024","unstructured":"Neo4j. 2023. neosemantics (n10s): Neo4j RDF & Semantics toolkit. https:\/\/neo4j.com\/labs\/neosemantics\/. Accessed: April 1, 2024."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3329781.3332266"},{"key":"e_1_2_2_33_1","volume-title":"Proceedings of the 9th Workshop on Ontology Design and Patterns (CEUR Workshop Proceedings","volume":"71","author":"Pandit Harshvardhan J.","year":"2018","unstructured":"Harshvardhan J. Pandit, Declan O'Sullivan, and Dave Lewis. 2018. Using Ontology Design Patterns To Define SHACL Shapes. In Proceedings of the 9th Workshop on Ontology Design and Patterns (CEUR Workshop Proceedings, Vol. 2195). CEUR-WS.org, Monterey, USA, 67--71."},{"key":"e_1_2_2_34_1","volume-title":"How Does Knowledge Evolve in Open Knowledge Graphs? TGDK 1, 1","author":"Polleres Axel","year":"2023","unstructured":"Axel Polleres, Romana Pernisch, Angela Bonifati, Daniele Dell'Aglio, Daniil Dobriy, Stefania Dumbrava, Lorena Etcheverry, Nicolas Ferranti, Katja Hose, Ernesto Jim\u00e9nez-Ruiz, Matteo Lissandrini, Ansgar Scherp, Riccardo Tommasini, and Johannes Wachs. 2023. How Does Knowledge Evolve in Open Knowledge Graphs? TGDK 1, 1 (2023), 11:1--11:59."},{"key":"e_1_2_2_35_1","volume-title":"Accessed 10th","author":"Quadrant Top","year":"2023","unstructured":"Top Quadrant. 2023. TopBraid. https:\/\/www.topquadrant.com\/products\/topbraid-composer\/. Accessed 10th April, 2024."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3487553.3524253"},{"key":"e_1_2_2_37_1","volume-title":"Extraction of Validating Shapes from very large Knowledge Graphs. VLDB-2023 16, 5","author":"Rabbani Kashif","year":"2023","unstructured":"Kashif Rabbani, Matteo Lissandrini, and Katja Hose. 2023. Extraction of Validating Shapes from very large Knowledge Graphs. VLDB-2023 16, 5 (2023), 1023--1032."},{"key":"e_1_2_2_38_1","volume-title":"SHACTOR: Improving the Quality of Large-Scale Knowledge Graphs with Validating Shapes. In SIGMOD Conference Companion. ACM, 151--154","author":"Rabbani Kashif","year":"2023","unstructured":"Kashif Rabbani, Matteo Lissandrini, and Katja Hose. 2023. SHACTOR: Improving the Quality of Large-Scale Knowledge Graphs with Validating Shapes. In SIGMOD Conference Companion. ACM, 151--154."},{"key":"e_1_2_2_39_1","volume-title":"https:\/\/github.com\/renzoar\/rdf2pg. Accessed","author":"PG.","year":"2024","unstructured":"rdf2pg. 2023. RDF2PG. https:\/\/github.com\/renzoar\/rdf2pg. Accessed: April 1, 2024."},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00725-x"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-21348-0_21"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01916-6"},{"key":"e_1_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Juan F Sequeda Marcelo Arenas and Daniel P Miranker. 2012. On directly mapping relational databases to RDF and OWL. In TheWebConf-2012. 649--658.","DOI":"10.1145\/2187836.2187924"},{"key":"e_1_2_2_44_1","volume-title":"ESWC-2020","volume":"12123","author":"Tanon Thomas Pellissier","unstructured":"Thomas Pellissier Tanon, Gerhard Weikum, and Fabian M. Suchanek. 2020. YAGO 4: A Reason-able Knowledge Base. In ESWC-2020, Vol. 12123. Springer, Heraklion, Crete, Greece, 583--596."},{"key":"e_1_2_2_45_1","volume-title":"Proceedings 15","author":"Tomaszuk Dominik","year":"2019","unstructured":"Dominik Tomaszuk, Renzo Angles, Lukasz Szeremeta, Karol Litman, and Diego Cisterna. 2019. Serialization for property graphs. In Beyond Databases, Architectures and Structures. Paving the Road to Smart Data Processing and Analysis: In BDAS 2019, Ustroc, Poland, May 28--31, 2019, Proceedings 15. Springer, 57--69."},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629489"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1162\/dint_a_00229"},{"key":"e_1_2_2_48_1","volume-title":"Accessed 10th","author":"C.","year":"2023","unstructured":"W3C. 2023. SHACL- core constraint components. https:\/\/www.w3.org\/TR\/shacl\/#core-components. Accessed 10th April, 2024."},{"key":"e_1_2_2_49_1","volume-title":"Accessed 10th","author":"C.","year":"2023","unstructured":"W3C. 2023. W3C: RDF Type. http:\/\/www.w3.org\/1999\/02\/22-rdf-syntax-ns#type. Accessed 10th April, 2024."},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTech58362.2023.00018"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30952-7_41"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3698817","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3698817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T17:45:27Z","timestamp":1774979127000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3698817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,18]]},"references-count":51,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12,18]]}},"alternative-id":["10.1145\/3698817"],"URL":"https:\/\/doi.org\/10.1145\/3698817","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,18]]}}}