Mirek Sopek
ABSTRACT
In this paper we present a new idea of creating a Blockchain compliant distributed database which exposes its data with explicit semantics, is easily and natively accessible, and which applies Blockchain securitization mechanisms to the RDF graph data model directly, without additional packaging or specific serialisation. Essentially, the resulting database forms the linked chain of named RDF graphs and is given a name: GraphChain. Such graphs can then be published with the help of any standard mechanisms using triplestores or as linked data objects accessible via standard web mechanisms using the HTTP protocol to make them available on the web. They can also be easily queried using techniques like SPARQL or methods typical to available RDF graphs frameworks (like rdflib, Apache Jena, RDF4J, OWL API, RDF HDT, dotnetRDF and others). The GraphChain concept comes with its own, OWL-compliant ontology that defines all the structural, invariant elements of the GraphChain and defines their basic semantics. The paper describes also a few simple, prototypical GraphChain implementations with examples created using Java, .NET/C# and JavaScript/Node.js frameworks.
- Jesús Arias-Fisteus, Norberto Fernández Garcıa, Luis Sánchez Fernández, and Carlos Delgado Kloos. 2010. Hashing and canonicalizing Notation 3 graphs. J. Comput. Syst. Sci. Vol. 76, 7 (2010), 663--685. Google Scholar
Digital Library
- 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 Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Jeremy J. Carroll. 2003. Signing RDF Graphs. Technical Report HPL-2003--142. Hewlett-Packard Labs.Google Scholar
- 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. Google ScholarDigital Library
- Nell Dale and Henry M. Walker. 1996. Abstract data types: specifications, implementations, and applications. Jones & Bartlett Learning. Google ScholarDigital Library
- M. English, S. Auer, and S.Domingue. 2016. Blockchain technologies & 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.Google Scholar
- 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. Google ScholarDigital Library
- Edzard Hö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 Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
Index Terms
- GraphChain: A Distributed Database with Explicit Semantics and Chained RDF Graphs
Recommendations
Using the relation ontology Metarel for modelling Linked Data as multi-digraphs
Linked Data for Health Care and the Life SciencesThe Semantic Web standards OWL and RDF are often used to represent biomedical information as Linked Data; however, the OWL/RDF syntax, which combines both, was never optimised for querying. By combining two formal paradigms for modelling Linked Data, ...
Using SPARQL to query bioportal ontologies and metadata
ISWC'12: Proceedings of the 11th international conference on The Semantic Web - Volume Part IIBioPortal is a repository of biomedical ontologies--the largest such repository, with more than 300 ontologies to date. This set includes ontologies that were developed in OWL, OBO and other languages, as well as a large number of medical terminologies ...
BioPortal as a dataset of linked biomedical ontologies and terminologies in RDF
BioPortal is a repository of biomedical ontologies --the largest such repository, with more than 300 ontologies to date. This set includes ontologies that were developed in OWL, OBO and other formats, as well as a large number of medical terminologies ...
Comments