Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/14822
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNEVEN, Frank-
dc.contributor.authorANTONOPOULOS, Timos-
dc.contributor.authorSERVAIS, Frederic-
dc.date.accessioned2013-03-26T14:47:52Z-
dc.date.available2013-03-26T14:47:52Z-
dc.date.issued2013-
dc.identifier.citationICDT '13: Proceedings of the 16th International Conference on Database Theory, p. 141-152-
dc.identifier.isbn978-1-4503-1598-2-
dc.identifier.urihttp://hdl.handle.net/1942/14822-
dc.description.abstractGiven a graph, a relation on its nodes, and a query language Q of interest, we study the Q-definability problem which amounts to deciding whether there exists a query in Q defining precisely the given relation over the given graph. Previous research has identified the complexity of FO- and CQ-de nability. In this paper, we consider the definability problem for regular paths and conjunctive regular path queries (CRPQs) over labelled graphs.-
dc.description.sponsorshipWe acknowledge the financial support of the Future and Emerging Technologies (FET) programme within the Seventh Framework Programme for Research of the European Commission, under the FET-Open grant agreement FOX, number FP7-ICT-233599.-
dc.language.isoen-
dc.publisherACM-
dc.rightsPermission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the ACM. To copy otherwise, or to republish, to post on servers or to redistribute to lists, requires a fee and/or special permissions from the publisher, ACM. EDBT/ICDT 2013, Genoa, Italy. Copyright 2013 ACM.-
dc.subject.otherGraph queries; Databases-
dc.titleDefinability problems for graph query languages-
dc.typeProceedings Paper-
local.bibliographicCitation.conferencedateMarch 18-22, 2013-
local.bibliographicCitation.conferencenameICDT '13: 16th International Conference on Database Theory-
local.bibliographicCitation.conferenceplaceGenoa, Italy-
dc.identifier.epage152-
dc.identifier.spage141-
local.bibliographicCitation.jcatC1-
local.publisher.placeNew York, NY, USA-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
dc.identifier.doi10.1145/2448496.2448514-
local.bibliographicCitation.btitleICDT '13: Proceedings of the 16th International Conference on Database Theory-
item.fulltextWith Fulltext-
item.contributorNEVEN, Frank-
item.contributorANTONOPOULOS, Timos-
item.contributorSERVAIS, Frederic-
item.fullcitationNEVEN, Frank; ANTONOPOULOS, Timos & SERVAIS, Frederic (2013) Definability problems for graph query languages. In: ICDT '13: Proceedings of the 16th International Conference on Database Theory, p. 141-152.-
item.accessRightsOpen Access-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
ANSicdt2013.pdfPeer-reviewed author version384.17 kBAdobe PDFView/Open
2448496.2448514.pdf
  Restricted Access		Published version308.14 kBAdobe PDFView/Open    Request a copy
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.