arXiv Open Access 2015

Typing Regular Path Query Languages for Data Graphs

Dario Colazzo Carlo Sartiani

Lihat Sumber

Abstrak

Regular path query languages for data graphs are essentially \emph{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.

Topik & Kata Kunci

cs.DB cs.PL

Penulis (2)

Dario Colazzo

Carlo Sartiani

Format Sitasi

APA MLA BibTeX

Colazzo, D., Sartiani, C. (2015). Typing Regular Path Query Languages for Data Graphs. https://arxiv.org/abs/1507.01708

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2015
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓