Show simple item record

dc.contributor.authorWang, Junhu
dc.contributor.authorWang, Kewen
dc.contributor.authorLi, Jiuyong
dc.contributor.editorLi, Q
dc.contributor.editorFeng, L
dc.contributor.editorPei, J
dc.contributor.editorWang, SX
dc.contributor.editorZhou, XF
dc.contributor.editorZhu, QM
dc.date.accessioned2017-05-03T14:22:28Z
dc.date.available2017-05-03T14:22:28Z
dc.date.issued2009
dc.date.modified2010-08-26T07:38:45Z
dc.identifier.issn0302-9743
dc.identifier.doi10.1007/978-3-642-00672-2_12
dc.identifier.urihttp://hdl.handle.net/10072/30609
dc.description.abstractContained rewriting and maximal contained rewriting of tree pattern queries using views have been studied recently for the class of tree patterns involving /, //, and []. Given query Q and view V, it has been shown that a contained rewriting of Q using V can be obtained by finding a useful embedding of Q in V. However, for the same Q and V, there may be many useful embeddings and thus many contained rewritings. Some of the useful embeddings may be redundant in that the rewritings obtained from them are contained in those obtained from other useful embeddings. Redundant useful embeddings are useless and they waste computational resource. Thus it becomes important to identify and remove them. In this paper, we show that the criteria for identifying redundant useful embeddings given in a previous work are neither sufficient nor necessary. We then present some useful observations on the containment relationship of rewritings, and based on which, a heuristic algorithm for removing redundant useful embeddings. We demonstrate the efficiency of our algorithm using examples.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.format.extent288222 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.publisher.placeGermany
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom113
dc.relation.ispartofpageto125
dc.relation.ispartofjournalLecture Notes in Computer science
dc.relation.ispartofvolume5446
dc.rights.retentionY
dc.subject.fieldofresearchDatabase systems
dc.subject.fieldofresearchcode460505
dc.titleFinding irredundant contained rewritings of tree pattern queries using views
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.facultyGriffith Sciences, School of Information and Communication Technology
gro.rights.copyright© 2009 Springer Berlin / Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.com
gro.date.issued2009
gro.hasfulltextFull Text
gro.griffith.authorWang, Kewen
gro.griffith.authorWang, John


Files in 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