Semantics based buffer reduction for queries over XML data streams

C. Yang, C. Liu, Jianxin Li, J.X. X. Yu, J. Wang

    Research output: Chapter in Book/Conference paperConference paperpeer-review

    4 Citations (Scopus)


    With 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 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 build a SAX-based XML stream query evaluation system and design an algorithm that consumes buffers in line with the concurrency lower bound. After a further analysis of the lower bound, we design several semantic rules for the purpose of breaking the lower bound and incorporate 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. © 2008, Australian Computer Society, Inc.
    Original languageEnglish
    Title of host publicationConferences in Research and Practice in Information Technology Series
    Number of pages9
    Publication statusPublished - 2008
    Event19th Australasian Database Conference - Wollongong, NSW
    Duration: 1 Jan 20081 Jan 2008


    Conference19th Australasian Database Conference
    Abbreviated titleADC 2008


    Dive into the research topics of 'Semantics based buffer reduction for queries over XML data streams'. Together they form a unique fingerprint.

    Cite this