Inductive Triple Graphs: A Purely Functional Approach to Represent RDF
نویسندگان
چکیده
RDF is one of the cornerstones of the Semantic Web. It can be considered as a knowledge representation common language based on a graph model. In the functional programming community, inductive graphs have been proposed as a purely functional representation of graphs, which makes reasoning and concurrent programming simpler. In this paper, we propose a simplified representation of inductive graphs, called Inductive Triple Graphs, which can be used to represent RDF in a purely functional way. We show how to encode blank nodes using existential variables, and we describe two implementations of our approach in Haskell and Scala.
منابع مشابه
Inductive representations of RDF graphs
RDF forms the basis of the semantic web technology stack. It is based on a directed graph model where nodes and edges are identified by URIs. Occasionally, such graphs contain literals or blank nodes. The existential nature of blank nodes complicates the graph representation. In this paper we propose a purely functional representation of RDF graphs using a special form of inductive graphs calle...
متن کاملA Graph Model for RDF
The Resource Description Framework (RDF) is a language for metadata assertions about information resources on the World-Wide Web, and is thus a foundation for a future Semantic Web. The atomic construct of RDF are statements, which are triples consisting of the resource being described, a property, and a property value. A collection of RDF statements can be intuitively understood as a graph: re...
متن کاملSupporting Scalable, Persistent Semantic Web Applications
To realize the vision of the Semantic Web, efficient storage and retrieval of large RDF data sets is required. A common technique for persisting RDF data (graphs) is to use a single relational database table, a triple store. But, we believe a single triple store cannot scale for large-scale applications. This paper describes storing and querying persistent RDF graphs in Jena, a Semantic Web pro...
متن کاملA Directed Hypergraph Model for RDF
1 Related Work An RDF document can be viewed as a graph: nodes are resources and arcs are properties. Formally [4], suppose there are three infinite sets: U (URIs), B = {bj : j ∈ N} (blank nodes), and L (literals). (s, p, o) ∈ (U∪B)×U×(U∪B∪L) is an RDF triple, s is called the subject, p the predicate, and o the object. An RDF graph T is a set of RDF triples. The universe of T , univ(T ), is the...
متن کاملJena Property Table Implementation
A common approach to providing persistent storage for RDF is to store statements in a three-column table in a relational database system. This is commonly referred to as a triple store. Each table row represents one RDF statement. For RDF graphs with frequent patterns, an alternative storage scheme is a property table. A property table comprises one column containing a statement subject plus on...
متن کامل