GDb Queries (cont)
Graphs contain arbitrary-length paths
Need an expression mechanism for describing such paths
- path expressions are regular expressions involving edge labels
- e.g.
L* is a sequence of one or more connected L edges
GDb query languages:
- SPARQL = based on the RDF model (widely available via RDF)
- Cypher = based on the Property Graph model (used in Neo4j)
|
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}