COMPSCI 752
Big data management
Assignment 2 / Semester 1, 2023
Graph Databases
Student ID:
Name:
Comments
The maximum mark achievable is 30.
The assignment contributes up to 5% to your total marks for the course.
Submission
Please submit your solutions as a single pdf file on CANVAS by Saturday, 29 April 2023.
Penalty Dates
The assignment will not be accepted after the last penalty date unless there are special
circumstances (e.g., sickness with certificate). Penalties will be calculated as follows as a
percentage of the mark for the assignment.
By
11:59pm, Sat 29 April 2023 No penalty
11:59pm, Sun 30 April 2023 25% penalty
11:59pm, Mon 01 May 2023 50% penalty
1
Graph databases
Consider a simple application where direct flights between two cities are stored as a property
graph. Nodes and edges may have properties.
Fig. 1. Property Graph
Questions:
1. Write down the formal property graph model (V,E, η, λ, ν) for the property graph in
Figure 1. [6 marks]
2. Write the following English language query in regular property graph logic:
Return all city nodes that can be reached from the city of Papeete with a sequence of
connecting flights with at most two stop-overs. [4 marks]
3. Write the following English language query in regular property graph logic:
Return all city nodes that can be reached from the city of Papeete with a sequence of
connecting flights that have an unlimited number of stop-overs. [4 marks]
4. Write the following English language query in regular property graph logic:
Return all city nodes in France, with a name different from Papeete, that can be reached
from the city of Papeete with a sequence of connecting flights that have an unlimited
number of stop-overs, where each flight is international and operated by the airline “Air
Tahiti”. [4 marks]
5. Write down the queries from Questions 2., 3., and 4. in regular property graph algebra.