dc.contributor.author | Wang, Junhu | |
dc.contributor.author | Yu, Jeffrey Xu | |
dc.contributor.author | Pang, Chaoyi | |
dc.contributor.author | Liu, Chengfei | |
dc.date.accessioned | 2017-05-03T14:22:34Z | |
dc.date.available | 2017-05-03T14:22:34Z | |
dc.date.issued | 2012 | |
dc.date.modified | 2013-06-04T03:18:05Z | |
dc.identifier.issn | 0001-5903 | |
dc.identifier.doi | 10.1007/s00236-012-0155-1 | |
dc.identifier.uri | http://hdl.handle.net/10072/47421 | |
dc.description.abstract | Tree patterns represent important fragments of XPath. In this paper, we show that some classes C of tree patterns exhibit such a property that, given a finite number of compatible tree patterns P1, . . . , Pn ? C, there exists another pattern P such that P1, . . . , Pn are all contained in P, and for any tree pattern Q ? C, P1, . . . , Pn are all contained in Q if and only if P is contained in Q.We experimentally demonstrate that the pattern P is usually much smaller than P1, . . . , Pn combined together. Using the existence of P above, we show that testing whether a tree pattern, P, is contained in another, Q ? C, under an acyclic schema graph G, can be reduced to testing whether PG, a transformed version of P, is contained in Q without any schema graph, provided that the distinguished node of P is not labeled *.We then show that, under G, the maximal contained rewriting (MCR) of a tree pattern Q using a view V can be found by finding the MCR of Q using VG without G, when there are no *-nodes on the distinguished path of V and no *-nodes in Q. | |
dc.description.peerreviewed | Yes | |
dc.description.publicationstatus | Yes | |
dc.language | English | |
dc.language.iso | eng | |
dc.publisher | Springer | |
dc.publisher.place | Germany | |
dc.relation.ispartofstudentpublication | N | |
dc.relation.ispartofpagefrom | 173 | |
dc.relation.ispartofpageto | 202 | |
dc.relation.ispartofissue | 3 | |
dc.relation.ispartofjournal | Acta Informatica | |
dc.relation.ispartofvolume | 49 | |
dc.rights.retention | Y | |
dc.subject.fieldofresearch | Theory of computation | |
dc.subject.fieldofresearch | Data management and data science | |
dc.subject.fieldofresearch | Database systems | |
dc.subject.fieldofresearchcode | 4613 | |
dc.subject.fieldofresearchcode | 4605 | |
dc.subject.fieldofresearchcode | 460505 | |
dc.title | Least common container of tree pattern queries and its applications | |
dc.type | Journal article | |
dc.type.description | C1 - Articles | |
dc.type.code | C - Journal Articles | |
gro.faculty | Griffith Sciences, School of Information and Communication Technology | |
gro.date.issued | 2012 | |
gro.hasfulltext | No Full Text | |
gro.griffith.author | Wang, John | |