TY - GEN
T1 - Typing query languages for data graphs
AU - Colazzo, Dario
AU - Sartiani, Carlo
PY - 2014/1/1
Y1 - 2014/1/1
N2 - Graph query languages are essentially 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.
AB - Graph query languages are essentially 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.
U2 - 10.1109/ICDEW.2014.6818297
DO - 10.1109/ICDEW.2014.6818297
M3 - Conference contribution
AN - SCOPUS:84901779526
SN - 9781479934805
T3 - Proceedings - International Conference on Data Engineering
SP - 28
EP - 31
BT - 2014 IEEE 30th International Conference on Data Engineering Workshops, ICDEW 2014
PB - IEEE Computer Society
T2 - 2014 IEEE 30th International Conference on Data Engineering Workshops, ICDEW 2014
Y2 - 31 March 2014 through 4 April 2014
ER -