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 OctDisplayed time zone: Eastern Time (US & Canada) change
15:30 - 17:00
|Using Dependent Types and Tactics to Enable Semantic Optimization of Language-Integrated Queries|
|Relative Expressive Power of Downward Fragments of Navigational Query Languages on Trees and Chains|
Jelle Hellings Hasselt University and Transnational University of Limburg, Marc Gyssens Hasselt University and Transnational University of Limburg, Yuqing Wu Indiana University, Dirk Van Gucht Indiana University, Jan Van den Bussche Hasselt University and Transnational University of Limburg, Stijn Vansummeren Université Libre de Bruxelles, George Fletcher Eindhoven University of Technology
|Typing Regular Path Query Languages for Data Graphs|