ORCA is a system for benchmarking Linked Data crawlers. More information about the benchmark can be found in the IEEE ICSC paper. The code base can be found on github.
The goal of the PG is to extend the benchmark by adding more features. Some of these features are (in no particular order):
The topic is briefly explained in the slides that have been used during the presentation of the project groups on February 15th.
Q: Will there be prior assignments? What would these assignments look like?
A: Yes, there will be assignments to ensure that participants are able to program in Java. To this end, the assignments will be simple Java programming tasks.
Q: Is there a seminar connected to this PG?
A: No.
Q: What are the prerequisites for this PG?
A: You should be able to program in Java. Knowledge about RDF, knowledge graphs and/or graph theory are beneficial. If you don't know these things you will have to study it at the beginning of the PG. Unfortunately, there won't be the time to give an introduction into these topics.
In case you have further questions, feel free to contact Michael Röder.
L.079.07007 Project Group: ORCA: a crawler analysis benchmark (in English)