Typing Regular Path Query Languages for Data Graphs
Abstract
Regular path query languages for data graphs are essentially \emph{untyped}. The lack of type information greatly limits the optimization opportunities for query engines and makes application development more complex. In this paper we discuss a simple, yet expressive, schema language for edge-labelled data graphs. This schema language is, then, used to define a query type inference approach with good precision properties.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2015
- DOI:
- 10.48550/arXiv.1507.01708
- arXiv:
- arXiv:1507.01708
- Bibcode:
- 2015arXiv150701708C
- Keywords:
-
- Computer Science - Databases;
- Computer Science - Programming Languages