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. (PODS '10). ECRPQs are an extension of con- junctive regular path queries (CRPQs), a well-studied language for querying graph structured database...

Full description

Bibliographic Details

Main Authors:	Dominik Freydenberger, Nicole Schweikardt
Format:	Default Conference proceeding
Published:	2011
Subjects:	Other information and computing sciences not elsewhere classified untagged Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/26388
Tags:	Add Tag No Tags, Be the first to tag this record!