Hi list, I'm trying to identify some performance metrics for SPARQL query execution in ARQ.
In particular I thought it would be interesting to measure the execution time for single iterators for a given SPARQL query in ARQ. This task is easy for iterators like QueryIterSort (and other solution modifiers), which materializes all the results before performing the ordering operation, but it looks a little more complex to measure the execution time of other iterators, which have to wait for the preceding iterators to return their Bindings. A possible solution would be to measure the whole execution time of an iterator (from its instantiation to its exhaustion) and subtract the execution time of its "child" (assuming that there is only one). But would this measurement have a sense? Has anyone already implemented something similar? If this is the case, is there a solution for a situation where an iterator has multiple children? Thanks in advance, Sara Magliacane
