| dc.contributor.author | Γεργατσούλης, Μανώλης | el_GR |
| dc.contributor.author | Αφράτη, Φώτο | el_GR |
| dc.contributor.author | Damigos, M. | en |
| dc.contributor.author | Gergatsoulis, Manolis | en |
| dc.contributor.author | Afrati, Foto | en |
| dc.date.available | 2014-01-13T11:21:38Z | |
| dc.date.issued | 2011 | |
| dc.identifier.issn | 978-145030627-0 | |
| dc.identifier.uri | http://hdl.handle.net/10797/13664 | en |
| dc.description | Περιέχει το πλήρες κείμενο | el_GR |
| dc.description.abstract | In 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.iso | eng | en |
| dc.rights | info:eu-repo/semantics/openAccess | en |
| dc.source | ACM International Conference Proceeding Series
2011, Pages 43-51 | en |
| dc.source | Scopus | en |
| dc.source.uri | http://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%29 | en |
| dc.title | Union rewritings for XPath fragments | en |
| dc.type | Article | en |
| dc.subject.JITA | Τεχνολογίες πληροφόρησης και τεχνολογίες βιβλιοθηκών | el_GR |
| dc.subject.JITA | Information technology and library technology | en |
| dc.identifier.JITA | LZ | en |