Every decent graph query language should have a way of finding and navigating longer connections in a graph. In SPARQL, this is realised by so-called property paths. From a practitioner's view, these are fairly easy to understand (at least if you have ever heard about basic regular expressions). To add some fundamentals to this university lecture, we will also look at the definition of their semantics, which is still easy but illustrates how one can define such things (somewhat) formally.
► Lecture slides for download: [ Ссылка ] (Lecture 5)
► Related problem sheet to test your knowledge: Exercise 4
► Current and previous versions of the lecture: [ Ссылка ]
