2015/07/07 by Colazzo, Dario, Sartiani, Carlo
#Databases (cs.DB) #FOS: Computer and information sciences #Programming Languages (cs.PL)
paper · doi:10.48550/arxiv.1507.01708
Regular path query languages for data graphs 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.