Show simple item record

dc.contributor.convenorTore Rischen_US
dc.contributor.authorWang, Junhuen_US
dc.contributor.authorLi, Jiangen_US
dc.contributor.authorYu, Jeffreyen_US
dc.contributor.editorAnastasia Ailamaki, Sihem Amer-Yahia, et alen_US
dc.date.accessioned2017-04-24T11:39:34Z
dc.date.available2017-04-24T11:39:34Z
dc.date.issued2011en_US
dc.date.modified2013-05-30T00:53:44Z
dc.identifier.refurihttp://www.edbt.org/Proceedings/2011-Uppsala/index.htmlen_US
dc.identifier.doi10.1145/1951365.1951386en_US
dc.identifier.urihttp://hdl.handle.net/10072/43558
dc.description.abstractWe revisit the problem of answering tree pattern queries using views. We first show that, for queries and views that do not have nodes labeled with the wildcard *, there is an alternative to the approach of query rewriting which does not require us to find any rewritings explicitly yet which produces the same answers as the maximal contained rewriting. Then, using the new approach, we give a simple criterion and a corresponding algorithm for identifying redundant view answers, which are view answers that can be ignored when evaluating the maximal contained rewriting. Finally, for queries and views that do have nodes labeled *, we provide a method to find the maximal contained rewriting and show how to answer the query using views without explicitly finding the rewritings.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_US
dc.format.extent797796 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_US
dc.publisherACMen_US
dc.publisher.placeSwedenen_US
dc.publisher.urihttp://www.edbt.org/Proceedings/2011-Uppsala/index.htmlen_US
dc.relation.ispartofstudentpublicationNen_US
dc.relation.ispartofconferencenameEDBTen_US
dc.relation.ispartofconferencetitleEDBT/ICDT 2011 Joint Conference Electronic Conference Proceedingsen_US
dc.relation.ispartofdatefrom2011-03-22en_US
dc.relation.ispartofdateto2011-03-24en_US
dc.relation.ispartoflocationSwedenen_US
dc.rights.retentionYen_US
dc.subject.fieldofresearchDatabase Managementen_US
dc.subject.fieldofresearchcode080604en_US
dc.titleAnswering Tree Pattern Queries Using Views, a revisiten_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.rights.copyrightCopyright ACM 2011. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in EDBT/ICDT '11 Proceedings of the 14th International Conference on Extending Database Technology , ISBN 978-1-4503-0528-0, dx.doi.org/10.1145/1951365.1951386en_US
gro.date.issued2011
gro.hasfulltextFull Text


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