Show simple item record

dc.contributor.authorΓεργατσούλης, Μανώληςel_GR
dc.contributor.authorΑφράτη, Φώτοel_GR
dc.contributor.authorDamigos, M.en
dc.contributor.authorGergatsoulis, Manolisen
dc.contributor.authorAfrati, Fotoen
dc.date.available2014-01-13T11:21:38Z
dc.date.issued2011
dc.identifier.issn978-145030627-0
dc.identifier.urihttp://hdl.handle.net/10797/13664en
dc.descriptionΠεριέχει το πλήρες κείμενοel_GR
dc.description.abstractIn this paper, we study the problem of finding an equivalent rewriting of an XPath query using multiple views, and we show that the union operator may be required in order to find such a rewriting. In particular, focusing on the fragment of XPath containing both descendant edges and wildcard labels, we propose an algorithm that outputs a union of single-view rewritings (if there exists any) which equivalently rewrites a given query. For the same fragment of XPath, we give necessary and sufficient conditions for query containment and equivalence of unions of queries.en
dc.language.isoengen
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceACM International Conference Proceeding Series 2011, Pages 43-51en
dc.sourceScopusen
dc.source.urihttp://www.scopus.com/record/display.url?eid=2-s2.0-84855318183&origin=resultslist&sort=plf-f&src=s&st1=gergatsoulis&st2=&nlo=1&nlr=20&nls=count-f&sid=D9369EFF27F81ECA48474BAE855DB2E1.WlW7NKKC52nnQNxjqAQrlA%3a63&sot=anl&sdt=aut&sl=41&s=AU-ID%28%22Gergatsoulis%2c+Manolis%22+6602969138%29&relpos=4&relpos=4&citeCnt=0&searchTerm=AU-ID%28%5C%26quot%3BGergatsoulis%2C+Manolis%5C%26quot%3B+6602969138%29en
dc.titleUnion rewritings for XPath fragmentsen
dc.typeArticleen
dc.subject.JITAΤεχνολογίες πληροφόρησης και τεχνολογίες βιβλιοθηκώνel_GR
dc.subject.JITAInformation technology and library technologyen
dc.identifier.JITALZen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record