Changes between Version 53 and Version 54 of VIQUEN


Ignore:
Timestamp:
08/21/10 12:10:24 (9 years ago)
Author:
nixdell
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • VIQUEN

    v53 v54  
    6060[[Image(extract_edges.png, left)]]
    6161
    62 Extract Edges: this operation specifies a subset of RDF edges that should be added to the default graph.
    63 "From Graph" indicates the graph that should be used to locate the specified RDF triples. The table indicates the triple pattern to be found. Another triple may be added to the table by clicking on the (+) button. Selecting a triple and clicking on the (-) button will delete that triple. If the specified triple pattern is found in the specified input graph, the triples are added to the default graph. (Note that this operation completely overwrites the default graph coming in to the operation.) Variables may be specified in the table using a "?", for example "?variable". These variables are then bound to sets of triples by adding a WHERE clause (see WHERE operations below).
     62This operation specifies a subset of RDF edges that should be added to the default graph. "From Graph" indicates the graph that should be used to locate the specified RDF triples. The table indicates the triple pattern to be found. Another triple may be added to the table by clicking on the (+) button. Selecting a triple and clicking on the (-) button will delete that triple. If the specified triple pattern is found in the specified input graph, the triples are added to the default graph. (Note that this operation completely overwrites the default graph coming in to the operation.) Variables may be specified in the table using a "?", for example "?Object". The variables are then bound to sets of triples by adding a WHERE clause (see WHERE operations below).
    6463
    6564==== Extract Tree ====
    6665[[Image(extract_tree_node.png, left)]]
    6766
     67This operation allows a user to indicate a root node and a set of properties that should be recursively followed to extract a subgraph of the input. This operation will maintain the structure of the extracted subgraph. "From Graph" indicates the graph that should be used to construct the tree. "Root" indicates the node in the graph to be used as the root of the tree. The table specifies the properties/edges that should be followed, and the direction in which to follow the edges: outgoing (from the root node), incoming (to the root node) or both. Another property may be added to the table by clicking on the (+) button. Selecting a property and clicking on the (-) button will delete that property. Variables may be specified in the table using a "?", for example "?property". The variables are then bound to sets of triples by adding a WHERE clause (see WHERE operations below).
     68
    6869==== Extract Reachable ====
    6970[[Image(extract_reachable.png, left)]]
    7071
     72This operation allows a user to indicate a root node and a set of properties that should be recursively followed to identify the set of nodes that can be reached by traversing those properties. Unlike "Extract Tree", this operation does not maintain the structure of the extracted subgraph, but rather produces a flat list of the nodes that can be reached. "From Graph" indicates the graph that should be used to find the nodes. "Root" indicates the node in the graph from which to begin. The table specifies the properties/edges that should be followed, and the direction in which to follow the edges: outgoing (from the root node), incoming (to the root node) or both. Another property may be added to the table by clicking on the (+) button. Selecting a property and clicking on the (-) button will delete that property. Variables may be specified in the table using a "?", for example "?property". The variables are then bound to sets of triples by adding a WHERE clause (see WHERE operations below).
     73
    7174==== Extract Path ====
    7275[[Image(extract_path.png, left)]]
     76
     77This operation allows a user to specify a root node, a leaf node and a list of properties; the operation returns the subgraph containing the path from the root to the leaf by recursively traversing the list of properties. "From Graph" indicates the graph that should be used to find the path. "Root" indicates the node in the graph from which to begin. "Leaf" indicates the node in the graph which is the end of the path. The table specifies the properties/edges that should be followed, and the direction in which to follow the edges: outgoing (from the root node), incoming (to the root node) or both. Another property may be added to the table by clicking on the (+) button. Selecting a property and clicking on the (-) button will delete that property. Variables may be specified in the table using a "?", for example "?property". The variables are then bound to sets of triples by adding a WHERE clause (see WHERE operations below).
    7378
    7479==== Extract Recursive ====