public class BackchainOwlSameAsPropertiesSPOIterator extends BackchainOwlSameAsIterator
Note: This is a relatively straightforward access path because both values of interest for owl:sameAs (s and o) are known up front. We can collect up all the sames in the ctor and use links between those sames to infer new links between the original s and o.
InferenceEngine,
InferenceEngine.OptionscopyOnly, db, log, sameAs, srcDEFAULT_CHUNK_SIZE| Constructor and Description |
|---|
BackchainOwlSameAsPropertiesSPOIterator(IChunkedOrderedIterator<ISPO> src,
IV s,
IV p,
IV o,
AbstractTripleStore db,
IV sameAs)
Create an iterator that will visit all statements in the source iterator
and also backchain any entailments that would have resulted from
owl:sameAs {2,3}.
|
| Modifier and Type | Method and Description |
|---|---|
void |
close()
Closes the object, releasing any associated resources.
|
IKeyOrder<ISPO> |
getKeyOrder()
The natural order in which elements are being visited.
|
boolean |
hasNext() |
ISPO |
next()
The next element available from the iterator.
|
ISPO[] |
nextChunk()
Return the next "chunk" from the iterator.
|
ISPO[] |
nextChunk(IKeyOrder<ISPO> keyOrder)
Return the next "chunk" of elements.
|
void |
remove()
Removes the last element visited by
IChunkedIterator.next() (optional operation). |
createTempTripleStore, dumpSPO, getSames, getSames, getSelfAndSamespublic BackchainOwlSameAsPropertiesSPOIterator(IChunkedOrderedIterator<ISPO> src, IV s, IV p, IV o, AbstractTripleStore db, IV sameAs)
src - The source iterator. nextChunk() will sort statements
into the IKeyOrder reported by this iterator (as long
as the IKeyOrder is non-null).s - The subject of the triple pattern. Cannot be null.p - The predicate of the triple pattern. Can be null.o - The object of the triple pattern. Cannot be null.db - The database from which we will read the distinct subject
identifiers (iff this is an all unbound triple pattern).sameAs - The term identifier that corresponds to owl:sameAs for the
database.public IKeyOrder<ISPO> getKeyOrder()
IChunkedOrderedIteratornull if not known.public boolean hasNext()
public ISPO next()
IChunkedIteratorpublic ISPO[] nextChunk()
IChunkedIteratorpublic ISPO[] nextChunk(IKeyOrder<ISPO> keyOrder)
IChunkedOrderedIteratorIChunkedOrderedIterator.getKeyOrder() would return non-null
and the request order corresponds to the value that would be returned by
IChunkedOrderedIterator.getKeyOrder() then the elements in the next chunk are NOT
sorted. Otherwise the elements in the next chunk are sorted before they
are returned. The size of the chunk is up to the implementation.keyOrder - The natural order for the elements in the chunk.public void close()
ICloseableICloseable.close() once it is known that the object
will no longer be used.public void remove()
IChunkedIteratorIChunkedIterator.next() (optional operation).
Note: This method is not readily suited for use with IChunkedIterator.nextChunk()
since the latter has already visited everything in the chunk and
IChunkedIterator.remove() would only remove the last item in the chunk. Normally
you will want to accumulate items to be removed in a buffer and then
submit the buffer to some batch api operation when it overflows.
Alternatively, the IRangeQuery.REMOVEALL flag may be used with
the source iterator to remove elements from the index as they are
visited.
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.