Show simple item record

dc.contributor.authorWang, Junhuen_US
dc.contributor.authorYu, Jeffreyen_US
dc.contributor.editorKitagawa, H.; Ishikawa, Y.; Li, W.; Watanabe, C.en_US
dc.date.accessioned2017-04-24T10:17:27Z
dc.date.available2017-04-24T10:17:27Z
dc.date.issued2010en_US
dc.date.modified2011-03-04T03:16:59Z
dc.identifier.refurihttp://dasfaa2010.cs.tsukuba.ac.jp/en_AU
dc.identifier.doi10.1007/978-3-642-12026-8_20en_AU
dc.identifier.urihttp://hdl.handle.net/10072/36772
dc.description.abstractFinding a homomorphism between tree patterns is an important technique for testing tree pattern containment, and it is the main technique behind algorithms for rewriting tree pattern queries using views. Recent work has shown that for tree patterns P and Q that involve parent-child (/) edges, ancestor-descendant (//) edges, and branching ([]) only, under a non-disjunctive, non-recursive dtd G, testing whether P is contained in Q can be done by chasing P into P using five types of constraints derivable from G, and then testing whether P is contained in Q without G, which in turn can be done by finding a homomorphism from Q to P. We extend this work to non-disjunctive, recursive dtds. We identify three new types of constraints that may be implied by a nondisjunctive recursive dtd, and show that together with the previous five types of constraints, they are necessary, and sufficient in some important cases, to consider for testing containment of tree patterns involving /, //, and [] under G. We present two sets of chase rules to chase a tree pattern repeatedly, and compare the advantages of these chase rules.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherSpringeren_US
dc.publisher.placeGermanyen_US
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofconferencenameDatabase Systems for Advanced Applicationsen_US
dc.relation.ispartofconferencetitle15th International Conference, DASFAA 2010 Proceedings Part Ien_US
dc.relation.ispartofdatefrom2010-04-01en_US
dc.relation.ispartofdateto2010-04-04en_US
dc.relation.ispartoflocationTsukuba, Japanen_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchDatabase Managementen_US
dc.subject.fieldofresearchcode080604en_US
dc.titleChasing Tree Patterns under Recursive DTDsen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.date.issued2010
gro.hasfulltextNo Full Text


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record