On 18/08/17 15:43, [email protected] wrote:
This might be a better question for the Jena dev@ list. I'm copying it
there.
Yes - Markus - you may get on better on the dev@ list and search the
archives.
In any event, can you say a little more about what you mean by "a new
querying algorithm"? Presumably you have some specific technique you are
investigating?
ajs6f
[email protected] wrote on 8/18/17 10:37 AM:
Dear Jena development-community,
my name is Markus Buchta and I am student at the University of
Technology of Vienna.
For my bachelor's thesis I want to implement a new querying algorithm
into Jena.
Since the the project is pretty large and pretty hard to understand
for a new developer, I want to know if you have any tips for me?
First steps:
Look at OpExecutor. This is where the algebra is actually executed.
Or if you are just considering basic graph patterns,
StageGenerator
Andy
I asking myself where should I start and what is even possible to
change at the query evaluation process?
It is - in small and large parts with varying degrees of work.
I want to already thank you for your help and wish you a nice weekend.
Sincerely
Markus Buchta
