Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On foundational aspects of RDF and SPARQL (1910.07519v2)

Published 16 Oct 2019 in cs.DB, cs.FL, and cs.PL

Abstract: We consider the recommendations of the World Wide Web Consortium (W3C) about the Resource Description Framework (RDF) and the associated query language SPARQL. We propose a new formal framework based on category theory which provides clear and concise formal definitions of the main basic features of RDF and SPARQL. We propose to define the notions of RDF graphs as well as SPARQL basic graph patterns as objects of some nested categories. This allows one to clarify, in particular, the role of blank nodes. Furthermore, we consider basic SPARQL CONSTRUCT and SELECT queries and formalize their operational semantics following a novel algebraic graph transformation approach called POIM.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Dominique Duval (28 papers)
  2. Rachid Echahed (18 papers)
  3. Frederic Prost (15 papers)

Summary

We haven't generated a summary for this paper yet.