Get the IRI of the Graph
The IRI of the Graph
Set the IRI of the Graph
The new IRI of the Graph
The IRI of the Graph
Test if a graph has a capability
Capability tested
True if the graph has the reuqested capability, false otherwise
Remove all RDF triples in the Graph
A Promise fulfilled when the clear operation has been completed
Delete a RDF triple from the RDF Graph
RDF Triple to delete
A Promise fulfilled when the deletion has been completed
Estimate the cardinality of a Triple pattern, i.e., the number of matching RDF Triples in the RDF Graph.
Triple pattern to estimate cardinality
A Promise fulfilled with the pattern's estimated cardinality
Evaluates a Basic Graph pattern, i.e., a set of triple patterns, on the Graph using a PipelineStage.
The set of triple patterns to evaluate
Execution options
A PipelineStage which evaluates the Basic Graph pattern on the Graph
Evaluates an union of Basic Graph patterns on the Graph using a PipelineStage.
The set of BGPs to evaluate
Execution options
A PipelineStage which evaluates the Basic Graph pattern on the Graph
Get a PipelineInput which finds RDF triples matching a triple pattern in the graph.
Triple pattern to find
Execution options
A PipelineInput which finds RDF triples matching a triple pattern
Get a PipelineStage which finds RDF triples matching a triple pattern and a set of keywords in the RDF Graph. The search can be constrained by min and max relevance (a 0 to 1 score signifying how closely the literal matches the search terms).
The Graph class provides a default implementation that computes the relevance score as the percentage of words matching the list of input keywords. If the minRank and/or maxRanks parameters are used, then the graph materializes all matching RDF triples, sort them by descending rank and then selects the appropriates ranks. Otherwise, the rank is not computed and all triples are associated with a rank of -1.
Consequently, the default implementation should works fines for a basic usage, but more advanced users should provides their own implementation, integrated with their own backend. For example, a SQL-based RDF Graph should rely on GIN or GIST indexes for the full text search.
Triple pattern to find
SPARQL variable on which the keyword search is performed
List of keywords to seach for occurence
True if only values that contain all of the specified search terms should be considered.
Minimum relevance score (set it to null to disable it)
Maximum relevance score (set it to null to disable it)
Minimum rank of the matches (set it to null to disable it)
Maximum rank of the matches (set it to null to disable it)
Execution options
A PipelineInput which output tuples of shape [matching RDF triple, score, rank].
Insert a RDF triple into the RDF Graph
RDF Triple to insert
A Promise fulfilled when the insertion has been completed
Generated using TypeDoc
An abstract RDF Graph, accessed through a RDF Dataset
Thomas Minier