Show simple item record

dc.contributor.authorWang, Junhu
dc.contributor.authorYu, Jeffrey Xu
dc.contributor.authorPang, Chaoyi
dc.contributor.authorLiu, Chengfei
dc.date.accessioned2017-05-03T14:22:34Z
dc.date.available2017-05-03T14:22:34Z
dc.date.issued2012
dc.date.modified2013-06-04T03:18:05Z
dc.identifier.issn0001-5903
dc.identifier.doi10.1007/s00236-012-0155-1
dc.identifier.urihttp://hdl.handle.net/10072/47421
dc.description.abstractTree 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.peerreviewedYes
dc.description.publicationstatusYes
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.publisher.placeGermany
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom173
dc.relation.ispartofpageto202
dc.relation.ispartofissue3
dc.relation.ispartofjournalActa Informatica
dc.relation.ispartofvolume49
dc.rights.retentionY
dc.subject.fieldofresearchTheory of computation
dc.subject.fieldofresearchData management and data science
dc.subject.fieldofresearchDatabase systems
dc.subject.fieldofresearchcode4613
dc.subject.fieldofresearchcode4605
dc.subject.fieldofresearchcode460505
dc.titleLeast common container of tree pattern queries and its applications
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.facultyGriffith Sciences, School of Information and Communication Technology
gro.date.issued2012
gro.hasfulltextNo Full Text
gro.griffith.authorWang, John


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record