package rdf

  1. Overview
  2. Docs

Interface to query Basic Graph Patterns (BGP) in a graph. Here the term representation is abstracted, so that it can be for example an id in a database table, which will make triple matching and joining faster when matching a BGP by querying the real terms only for the result of the whole BGP, instead of retrieving terms and joining results of each triple.

type g
type term
val term : g -> Term.term -> term
val compare : g -> term -> term -> int
val rdfterm : g -> term -> Term.term
val subjects : g -> term list
val objects : g -> term list
val find : ?sub:term -> ?pred:term -> ?obj:term -> g -> (term * term * term) list
OCaml

Innovation. Community. Security.