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.
Typing regular path query languages for data graphs
SARTIANI, CARLO
2015-01-01
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
dbpl2015.pdf
solo utenti autorizzati
Tipologia:
Pdf editoriale
Licenza:
DRM non definito
Dimensione
439.07 kB
Formato
Adobe PDF
|
439.07 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
