Graph Path Navigation
Navigational query languages for graph databases allow to recursively traverse the edges of a graph while checking for the existence of a path that satisfies certain regular conditions. The basic building block of such languages is the class of regular path queries (RPQs), which are expressions that compute the pairs of nodes that are linked by a path whose label satisfies a regular expression. RPQs are often extended with features that turn them more flexible for practical applications, e.g., with the ability to traverse edges in the backward direction (RPQs with inverses) or to express arbitrary patterns over the data (conjunctive RPQs).
Graph databases provide a natural encoding of many types of data where one needs to deal with objects and relationships between them. An object is represented as a node, and a relationship between two objects is represented as an edge, where...
- Barceló P (2013) Querying graph databases. In: Proceedings of the 32nd ACM Symposium on Principles of Database Systems, PODS 2013, pp 175–188Google Scholar
- Calvanese D, De Giacomo G, Lenzerini M, Vardi MY (2000) Containment of conjunctive regular path queries with inverse. In: Proceedings of the 7th International Conference on Principles of Knowledge Representation and Reasoning, KR 2000, pp 176–185Google Scholar
- Holland DA, Braun UJ, Maclean D, Muniswamy-Reddy KK, Seltzer MI (2008) Choosing a data model and query language for provenance. In: 2nd International Provenance and Annotation Workshop (IPAW)Google Scholar
- Paths TFP (2009) Use cases in property paths task force. http://www.w3.org/2009/sparql/wiki/TaskForce:PropertyPaths#Use_Cases
- Robinson I, Webber J, Eifrem E (2013) Graph Databases, 1st edn. O’Reilly MediaGoogle Scholar