Hello friends =) Im using ARQ to do some sparql queries to a OWL ontolgy for my Master Thesis. One thing I need for my thesis is the order O(n) of the graph pattern matching algorithm that is used to resolve the querie after its final transformations and optimization steps.
(http://jena.apache.org/documentation/query/arq-query-eval.html) I have been looking for a while now and I cant find any reference to what algorithm is been used. if there is a paper or any one has the information about the order of the algorithm, its medium and worst case scenario, or maybe some documentation I could read about this, it will be a great help. thanks So much, Best regards =)
