| java.lang.Object
 com.hp.hpl.jena.db.impl.SpecializedGraphBase
com.hp.hpl.jena.db.impl.SpecializedGraphReifier_RDB
| SpecializedGraphReifier_RDB | | public class SpecializedGraphReifier_RDB extends SpecializedGraphBase implements SpecializedGraphReifier(Code) | |
author:
hkuno
version:
$Version$
version:
TripleStoreGraph is an abstract superclass for TripleStoreGraph
version:
implementations. By "triple store," we mean that the subjects, predicate
version:
and object URI's are stored in a single collection (denormalized). |
| Method Summary | |
| public void | add(Node n, Triple t, CompletionFlag complete)
| | public void | add(Graph g, CompletionFlag complete)
Attempt to add all the triples from a graph to the specialized graph
Caution - this call changes the graph passed in, deleting from
it each triple that is successfully added.
Node that when calling add, if complete is true, then the entire
graph was added successfully and the graph g will be empty upon
return. | | public void | add(Triple frag, CompletionFlag complete)
| | public void | add(List triples, CompletionFlag complete)
| | public void | clear()
| | public void | close()
| | public boolean | contains(Node n, Triple t, CompletionFlag complete)
| | public boolean | contains(Triple t, CompletionFlag complete)
Tests if a triple is contained in the specialized graph.
Parameters:
t - is the triple to be tested
Parameters:
complete - is true if the graph can guarantee that no other specialized graph could hold any matching triples. | | public void | delete(Node n, Triple t, CompletionFlag complete)
| | public void | delete(Triple frag, CompletionFlag complete)
| | public void | delete(List triples, CompletionFlag complete)
| | public ExtendedIterator | find(TripleMatch t, CompletionFlag complete)
| | public ExtendedIterator | findReifiedNodes(Triple t, CompletionFlag complete)
| | public Triple | findReifiedTriple(Node n, CompletionFlag complete)
| | public ExtendedIterator | findReifiedTriples(Node n, CompletionFlag complete)
Find all the triples corresponding to a given reified node.
In a perfect world, there would only ever be one, but when a user calls
add(Triple) there is nothing in RDF that prevents them from adding several
subjects,predicates or objects for the same statement.
The resulting Triples may be incomplete, in which case some of the
nodes may be Node_ANY.
For example, if an application had previously done:
add( new Triple( a, rdf.subject A )) and
add( new Triple( a, rdf.object B )) and
add( new Triple( a, rdf.object B2 ))
Then the result of findReifiedTriple(a, flag) will be an iterator containing
Triple(A, ANY, B) and Triple(ANY, ANY, B2).
Parameters:
n - is the Node for which we are querying.
Parameters:
complete - is true if we know we've returned all the triples which may exist. | | protected void | fragCompact(Node stmtURI)
| | public DBPropLSet | getDBPropLSet()
| | public int | getGraphId()
| | public IPSet | getPSet()
| | static boolean | isReifProp(Node_URI p)
| | protected Triple | rowToFrag(Node stmtURI, Triple row)
| | public char | subsumes(Triple pattern, int reifBehavior)
| | public int | tripleCount()
|
| m_dbPropLSet | | public DBPropLSet m_dbPropLSet(Code) | | caches a copy of LSet properties
|
| my_GID | | public IDBID my_GID(Code) | | holds ID of graph in database (defaults to "0")
|
| SpecializedGraphReifier_RDB | | SpecializedGraphReifier_RDB(DBPropLSet lProp, IPSet pSet, Integer dbGraphID)(Code) | | Constructor
Create a new instance of a TripleStore graph.
|
| SpecializedGraphReifier_RDB | | public SpecializedGraphReifier_RDB(IPSet pSet, Integer dbGraphID)(Code) | | Constructor
Create a new instance of a TripleStore graph, taking
DBPropLSet and a PSet as arguments
|
| add | | public void add(Graph g, CompletionFlag complete)(Code) | | Attempt to add all the triples from a graph to the specialized graph
Caution - this call changes the graph passed in, deleting from
it each triple that is successfully added.
Node that when calling add, if complete is true, then the entire
graph was added successfully and the graph g will be empty upon
return. If complete is false, then some triples in the graph could
not be added. Those triples remain in g after the call returns.
If the triple can't be stored for any reason other than incompatability
(for example, a lack of disk space) then the implemenation should throw
a runtime exception.
Parameters:
g - is a graph containing triples to be added
Parameters:
complete - is true if a subsequent call to contains(triple) will return true for any triple in g. |
| add | | public void add(List triples, CompletionFlag complete)(Code) | | |
| clear | | public void clear()(Code) | | |
| close | | public void close()(Code) | | |
| contains | | public boolean contains(Node n, Triple t, CompletionFlag complete)(Code) | | |
| contains | | public boolean contains(Triple t, CompletionFlag complete)(Code) | | Tests if a triple is contained in the specialized graph.
Parameters:
t - is the triple to be tested
Parameters:
complete - is true if the graph can guarantee that no other specialized graph could hold any matching triples. boolean result to indicate if the triple was contained |
| delete | | public void delete(Triple frag, CompletionFlag complete)(Code) | | |
| delete | | public void delete(List triples, CompletionFlag complete)(Code) | | |
| findReifiedTriple | | public Triple findReifiedTriple(Node n, CompletionFlag complete)(Code) | | |
| findReifiedTriples | | public ExtendedIterator findReifiedTriples(Node n, CompletionFlag complete)(Code) | | Find all the triples corresponding to a given reified node.
In a perfect world, there would only ever be one, but when a user calls
add(Triple) there is nothing in RDF that prevents them from adding several
subjects,predicates or objects for the same statement.
The resulting Triples may be incomplete, in which case some of the
nodes may be Node_ANY.
For example, if an application had previously done:
add( new Triple( a, rdf.subject A )) and
add( new Triple( a, rdf.object B )) and
add( new Triple( a, rdf.object B2 ))
Then the result of findReifiedTriple(a, flag) will be an iterator containing
Triple(A, ANY, B) and Triple(ANY, ANY, B2).
Parameters:
n - is the Node for which we are querying.
Parameters:
complete - is true if we know we've returned all the triples which may exist. ExtendedIterator. |
| fragCompact | | protected void fragCompact(Node stmtURI)(Code) | | |
| getGraphId | | public int getGraphId()(Code) | | |
| subsumes | | public char subsumes(Triple pattern, int reifBehavior)(Code) | | |
| tripleCount | | public int tripleCount()(Code) | | |
|
|