Show simple item record

dc.contributor.authorYang, Chien_US
dc.contributor.authorLiu, Chengfeien_US
dc.contributor.authorLi, Jianxinen_US
dc.contributor.authorYu, Jeffreyen_US
dc.contributor.authorWang, Junhuen_US
dc.date.accessioned2017-05-03T12:38:08Z
dc.date.available2017-05-03T12:38:08Z
dc.date.issued2010en_US
dc.date.modified2011-06-07T06:57:26Z
dc.identifier.issn1443458Xen_US
dc.identifier.urihttp://hdl.handle.net/10072/37377
dc.description.abstractWith respect to current methods for query evaluation over XML data streams, adoption of certain types of buffering techniques is unavoidable. Under lots of circumstances, the buffer scale may increase exponentially, which can cause memory bottleneck. Some optimization techniques have been proposed to solve the problem. However, the limit of these techniques has been defined by a concurrency lower bound and has been theoretically proved. In this paper, we show through an empirical study that this lower bound can be broken by taking semantic information into account for buffer reduction. To demonstrate this, we built a SAX-based XML stream query evaluation system and designed an algorithm that consumes buffers in line with the concurrency lower bound. After a further analysis of the lower bound, we designed several semantic rules for the purpose of breaking the lower bound and incorporated these rules in the lower bound algorithm. Experiments are conducted to show that the algorithms deploying semantic rules individually and collectively all significantly outperform the lower bound algorithm that does not consider semantic information.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.format.extent587164 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherAustralian Computer Societyen_US
dc.publisher.placeAustraliaen_US
dc.publisher.urihttp://www.acs.org.au/jrpit/JRPIT42.2.111.pdfen_US
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofpagefrom111en_US
dc.relation.ispartofpageto128en_US
dc.relation.ispartofissue2en_US
dc.relation.ispartofjournalJournal of Research and Practice in Information Technologyen_US
dc.relation.ispartofvolume42en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchDatabase Managementen_US
dc.subject.fieldofresearchcode080604en_US
dc.titleA query system for XML data stream and its semantics-based buffer reductionen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
dcterms.licensehttp://creativecommons.org/licenses/by-nc-nd/2.5/au/en_US
gro.rights.copyrightCopyright 2010 Australian Computer Society Inc. The attached file is reproduced here in accordance with the copyright policy of the publisher. No further distribution permitted. For information about this journal please refer to the journal's website. The online version of this work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 2.5 License (http://creativecommons.org/licenses/by-nc-nd/2.5/au/)en_AU
gro.date.issued2010
gro.hasfulltextFull Text


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