{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:33:19Z","timestamp":1778214799058,"version":"3.51.4"},"publisher-location":"New York, New York, USA","reference-count":11,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Centre for Research and Development Operational Programme Smart Growth","award":["01.01.01-00-0982\/16"],"award-info":[{"award-number":["01.01.01-00-0982\/16"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3184558.3191554","type":"proceedings-article","created":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T18:04:25Z","timestamp":1524074665000},"page":"1171-1178","source":"Crossref","is-referenced-by-count":25,"title":["GraphChain"],"prefix":"10.1145","author":[{"given":"Mirek","family":"Sopek","sequence":"first","affiliation":[{"name":"MakoLab S.A., Lodz, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Przemyslaw","family":"Gradzki","sequence":"additional","affiliation":[{"name":"R&D Team, DC Lublin MakoLab S.A., Lublin, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Witold","family":"Kosowski","sequence":"additional","affiliation":[{"name":"R&D Team, MakoLab S.A., Lodz, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"Kuziski","sequence":"additional","affiliation":[{"name":"R&D Team, MakoLab S.A., Lodz, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafa","family":"Tr\u00f3jczak","sequence":"additional","affiliation":[{"name":"R&D Team, DC Lublin MakoLab S.A., Lublin, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Trypuz","sequence":"additional","affiliation":[{"name":"R&D Team, DC Lublin MakoLab S.A., Lublin, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3184558.3191554-1","doi-asserted-by":"crossref","unstructured":"Jes&#250;s Arias-Fisteus, Norberto Fern&#225;ndez Garc&#305;a, Luis S&#225;nchez Fern&#225;ndez, and Carlos Delgado Kloos. 2010. Hashing and canonicalizing Notation 3 graphs. J. Comput. Syst. Sci. Vol. 76, 7 (2010), 663--685. https:\/\/doi.org\/10.1016\/j.jcss.2010.01.003","DOI":"10.1016\/j.jcss.2010.01.003"},{"key":"key-10.1145\/3184558.3191554-2","unstructured":"Rick Barrett, Rick Cummings, Eugene Agichtein, and Evgeniy Gabrilovich (Eds.). 2017. Proceedings of the 26th International Conference on World Wide Web Companion, Perth, Australia, April 3--7, 2017. ACM. http:\/\/dl.acm.org\/citation.cfmid=3041021"},{"key":"key-10.1145\/3184558.3191554-3","unstructured":"Mihir Bellare and Daniele Micciancio. 1997. A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost Advances in Cryptology - EUROCRYPT '97, International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, May 11--15, 1997, Proceeding (Lecture Notes in Computer Science), Walter Fumy (Ed.), Vol. 1233. Springer, 163--192. https:\/\/doi.org\/10.1007\/3--540--69053-0_13"},{"key":"key-10.1145\/3184558.3191554-4","doi-asserted-by":"crossref","unstructured":"Jeremy J. Carroll. 2003. Signing RDF Graphs. Technical Report HPL-2003--142. Hewlett-Packard Labs.","DOI":"10.1007\/978-3-540-39718-2_24"},{"key":"key-10.1145\/3184558.3191554-5","doi-asserted-by":"crossref","unstructured":"Jeremy J. Carroll, Christian Bizer, Pat Hayes, and Patrick Stickler. 2005. Named graphs, provenance and trust. In WWW '05: Proceedings of the 14th international conference on World Wide Web. ACM, New York, NY, USA, 613--622. https:\/\/doi.org\/10.1145\/1060745.1060835","DOI":"10.1145\/1060745.1060835"},{"key":"key-10.1145\/3184558.3191554-6","unstructured":"Nell Dale and Henry M. Walker. 1996. Abstract data types: specifications, implementations, and applications. Jones &#38; Bartlett Learning."},{"key":"key-10.1145\/3184558.3191554-7","unstructured":"M. English, S. Auer, and S.Domingue. 2016. Blockchain technologies &#38; the Semantic Web: A framework for symbiotic development CS Conference for University of Bonn Students, J. Lehmann, H. Thakkar, L. Halilaj, and R. Asmat (Eds.). 47--61."},{"key":"key-10.1145\/3184558.3191554-8","doi-asserted-by":"crossref","unstructured":"Mark Giereth. 2005. On Partial Encryption of RDF-Graphs. In The Semantic Web - ISWC 2005, 4th International Semantic Web Conference, ISWC 2005, Galway, Ireland, November 6--10, 2005, Proceedings (Lecture Notes in Computer Science), Yolanda Gil, Enrico Motta, V. Richard Benjamins, and Mark A. Musen (Eds.), Vol. Vol. 3729. Springer, 308--322. https:\/\/doi.org\/10.1007\/11574620_24","DOI":"10.1007\/11574620_24"},{"key":"key-10.1145\/3184558.3191554-9","unstructured":"Edzard H&#246;fig and Ina Schieferdecker. 2014. Hashing of RDF Graphs and a Solution to the Blank Node Problem Proceedings of the 10th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2014) co-located with the 13th International Semantic Web Conference (ISWC 2014), Riva del Garda, Italy, October 19, 2014. (CEUR Workshop Proceedings), Fernando Bobillo, Rommel N. Carvalho, Davide Ceolin, Paulo Cesar G. da Costa, Claudia d'Amato, Nicola Fanizzi, Kathryn B. Laskey, Kenneth J. Laskey, Thomas Lukasiewicz, Trevor P. Martin, Matthias Nickles, Michael Pool, Tom De Nies, Olaf Hartig, Paul T. Groth, and Stephen Marsh (Eds.), Vol. Vol. 1259. CEUR-WS.org, 55--66. http:\/\/ceur-ws.org\/Vol-1259\/method2014_submission_1.pdf"},{"key":"key-10.1145\/3184558.3191554-10","doi-asserted-by":"crossref","unstructured":"Aidan Hogan. 2015. Skolemising Blank Nodes while Preserving Isomorphism Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18--22, 2015, Aldo Gangemi, Stefano Leonardi, and Alessandro Panconesi (Eds.). ACM, 430--440. https:\/\/doi.org\/10.1145\/2736277.2741653","DOI":"10.1145\/2736277.2741653"},{"key":"key-10.1145\/3184558.3191554-11","doi-asserted-by":"crossref","unstructured":"Aidan Hogan. 2017. Canonical Forms for Isomorphic and Equivalent RDF Graphs: Algorithms for Leaning and Labelling Blank Nodes. ACM Trans. Web, Vol. 11, 4, Article 22 (July. 2017), 62 pages.","DOI":"10.1145\/3068333"}],"event":{"name":"Companion of the The Web Conference 2018","location":"Lyon, France","acronym":"WWW '18","number":"2018","sponsor":["IW3C2, International World Wide Web Conference Committee","SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"start":{"date-parts":[[2018,4,23]]},"end":{"date-parts":[[2018,4,27]]}},"container-title":["Companion of the The Web Conference 2018 on The Web Conference 2018 - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3184558.3191554","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3191554&ftid=1958281&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:31Z","timestamp":1750208911000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3184558.3191554"}},"subtitle":["A Distributed Database with Explicit Semantics and Chained RDF Graphs"],"proceedings-subject":"The Web Conference 2018","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1145\/3184558.3191554","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}