Typing regular path query languages for data graphs

Dario Colazzo, Carlo Sartiani

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationDBPL 2015 - Proceedings of the 15th Symposium on Database Programming Languages
EditorsThomas Neumann, James Cheney
PublisherAssociation for Computing Machinery, Inc
Pages69-78
Number of pages10
ISBN (Electronic)9781450339025
DOIs
Publication statusPublished - 27 Oct 2015
Externally publishedYes
Event15th Symposium on Database Programming Languages, DBPL 2015 - Pittsburgh, United States
Duration: 27 Oct 2015 → …

Publication series

NameDBPL 2015 - Proceedings of the 15th Symposium on Database Programming Languages

Conference

Conference15th Symposium on Database Programming Languages, DBPL 2015
Country/TerritoryUnited States
CityPittsburgh
Period27/10/15 → …

Keywords

  • Data graphs
  • RPQs
  • Type inference

Fingerprint

Dive into the research topics of 'Typing regular path query languages for data graphs'. Together they form a unique fingerprint.

Cite this