Typing Regular Path Query Languages for Data Graphs
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.
Tue 27 Oct
|15:30 - 16:00|
|16:00 - 16:30|
Jelle HellingsHasselt University and Transnational University of Limburg, Marc GyssensHasselt University and Transnational University of Limburg, Yuqing WuIndiana University, Dirk Van GuchtIndiana University, Jan Van den BusscheHasselt University and Transnational University of Limburg, Stijn VansummerenUniversité Libre de Bruxelles, George H. L. FletcherEindhoven University of Technology
|16:30 - 17:00|