Hello; I have been studying about join ordering problems at SPARQL queries and i have been using ARQ for that. I aim to change order of triple patterns at algebra level. But i have some problems and i need to ask you.
1 - Which kind of algorithms are used for join operation? (Nested-loop, merge-join ...etc.) (Especially at "Algebra.exec(op, model)" function) 2- Is ARQ using bushy trees or left-deep trees at execution of query? Could you answer these questions or send related articles? Thank you very much, Best regards. -- Elem GÜZEL
