Abstract
Linked Data has forged new ground in developing easy-to-use, distributed databases. The prevalence of this data has enabled a new genre of social and scientific applications. At the same time, Semantic Web technology has failed to significantly displace SQL or XML in industrial applications, in part because it offers no equivalent schema publication and enforcement mechanisms to ensure data consistency. The RDF community has recognized the need for a formal mechanism to publish verifiable assertions about the structure and content of RDF Graphs, RDF Datasets and related resources. We propose a formal model that could serve as a foundation for describing the various types invariants, pre- and post-conditions for RDF datasets and then demonstrate how the model can be used to analyze selected example constraints. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Solbrig, H., Prud’Hommeaux, E., Chute, C. G., & Davies, J. (2014). A formal model for RDF dataset constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8388 LNCS, pp. 244–260). Springer Verlag. https://doi.org/10.1007/978-3-319-06826-8_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
