Dear All
If a dataset graph G backed by TDB runs .find(ANY, ANY, ANY, ANY), are
there any promises made about the order in which quads come out of
the iterator? Failing a promise, how about a strong likelihood of
some specific order? [1]
I ask because we have a (large) dataset for which we wish to apply
an operation (as it happens, text indexing) to each subject+graph
in the graph exactly once. Currently we write code that runs the above
find() call and processes the graph+subject if it has not already
seen it, using a Set<Node> to remember subject Nodes.
If all the quads with the same graph+subject turned up together we could
dispense with this machinery and its overhead.
If not, well, we have other approaches in mind (to avoid big sets).
Chris
[1] I'm not expecting such a promise but it would be remiss of me
not to check and dismiss it a priori ...
--
"It's just the beginning we've seen" - Colosseum, /Tomorrow's Blues/
Epimorphics Ltd, http://www.epimorphics.com
Registered address: Court Lodge, 105 High Street, Portishead, Bristol BS20 6PT
Epimorphics Ltd. is a limited company registered in England (number 7016688)
