User Tools

Site Tools


graph_manipulation

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
graph_manipulation [2012/11/26 01:03]
hsolbrig
graph_manipulation [2012/11/26 02:35] (current)
hsolbrig
Line 29: Line 29:
     * Return: URI of new graph     * Return: URI of new graph
     * Notes: Assertion provenance must be maintained - every assertion must include the name of the graph(s) from which it was derived     * Notes: Assertion provenance must be maintained - every assertion must include the name of the graph(s) from which it was derived
-==== Return ​a graph that contains ​the intersection ​of two or more existing graphs ​==== +==== Apply one or more constraints to a graph producing a new graph ==== 
-    * Inputs: ​List of graph URIs +    * Inputs: A set of constraints ​that includes: 
-    * Return:+       * Subject constraints - the ability to restrict the set of assertions in a graph to those whose subject is a member of the list 
 +       * Predicate constraints - the ability to restrict the set of assertions in the graph to those whose predicate is a member of the list. 
 +       * Target constraints - the ability to restrict the set of assertions in the graph to those whose target: 
 +          * Is a member of a list of named uri'​s 
 +          * Matches ​or approximately matches (via. Regular Expressions and other data matching techniques) a supplied data pattern 
 +          * Meets a pattern that matches sub-expressions 
 +       * Meets a supplied classifier rule (is a subClass of or is a parent class of a named or resolved graph) 
 +==== Resolve a graph ==== 
 +    * Inputs: ​URI of a Graph, desired output notation and format (e.g. owl/​rdf+xml) 
 +    * Output: Resolved ​graph 
 +    * Notes: 
 +       - The resolved output graph has to support iterators - there has to be some mechanism to retrieve the results in chunks 
 +       - The order of the output graph (sort order) should be specifiable 
 +       - The output graph should be able to be constrained to either just asserted or asserted and inferred assertions. ​ The output inferences in the output graph should be based on the entire source graph(s) - not the constraints. ​ (i.e.  a R b, b R c, c R d, d R e  transitive(R) constrained to "​subject a or target e" should yield (a R b, b R d, d R e).
graph_manipulation.txt · Last modified: 2012/11/26 02:35 by hsolbrig