Expressiveness and static analysis of extended conjunctive regular path queries

We study the expressiveness and the complexity of static analysis of extended conjunctive regular path queries (ECRPQs), introduced by Barceló et al. (2010) [3]. ECRPQs are an extension of conjunctive regular path querie s (CRPQs), a well-studied language for querying graph structured databases. Our...

Full description

Bibliographic Details

Main Authors:	Dominik Freydenberger, Nicole Schweikardt
Format:	Default Article
Published:	2013
Subjects:	Distributed computing and systems software not elsewhere classified Theory of computation not elsewhere classified Other information and computing sciences not elsewhere classified untagged Computation Theory and Mathematics Information and Computing Sciences not elsewhere classified Distributed Computing
Online Access:	https://hdl.handle.net/2134/26542
Tags:	Add Tag No Tags, Be the first to tag this record!