Show simple item record

dc.contributor.authorLi, Jiangen_US
dc.contributor.authorWang, Junhuen_US
dc.contributor.editorG Goos, J Hartmanisen_US
dc.date.accessioned2017-05-03T14:22:27Z
dc.date.available2017-05-03T14:22:27Z
dc.date.issued2008en_US
dc.date.modified2012-07-24T22:35:02Z
dc.identifier.issn03029743en_US
dc.identifier.doi10.1007/978-3-540-85654-2_45en_US
dc.identifier.urihttp://hdl.handle.net/10072/23610
dc.description.abstractTwig pattern matching plays a crucial role in data processing. Existing twig pattern matching algorithms can be classified into two-phase algorithms and one-phase algorithms. While the two-phase algorithms (e.g., ) suffer from expensive merging cost, the one-phase algorithms (e.g., , , ) either lack efficient filtering of useless elements, or use over-complicated data structures. In this paper, we present two novel one-phase holistic twig matching algorithms, TwigMix and , which combine the efficient selection of useful elements (introduced in ) with the simple lists for storing final solutions (introduced in ). simply introduces the element selection function of into to avoid manipulation of useless elements in the stack and lists. further improves this by introducing some pointers in the lists to completely avoid the use of stacks. Our experiments show significantly and consistently outperforms and (up to several times faster), and is up to two times faster than .en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_US
dc.format.extent333318 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_US
dc.publisherSpringeren_US
dc.publisher.placeGermanyen_US
dc.relation.ispartofstudentpublicationNen_US
dc.relation.ispartofpagefrom523en_US
dc.relation.ispartofpageto536en_US
dc.relation.ispartofjournalLecture Notes in Computer scienceen_US
dc.relation.ispartofvolume5181en_US
dc.rights.retentionYen_US
dc.subject.fieldofresearchDatabase Managementen_US
dc.subject.fieldofresearchcode080604en_US
dc.titleFast Matching of Twig Patternsen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.rights.copyrightCopyright 2008 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.comen_US
gro.date.issued2008
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