2nd International ICST Conference on Scalable Information Systems

Research Article

Efficient Processing of Branch Queries for High-Performance XML Filtering

Download56 downloads
  • @INPROCEEDINGS{10.4108/infoscale.2007.213,
        author={Ryan H. Choi and Raymond K. Wong},
        title={Efficient Processing of Branch Queries for High-Performance XML Filtering},
        proceedings={2nd International ICST Conference on Scalable Information Systems},
        proceedings_a={INFOSCALE},
        year={2010},
        month={5},
        keywords={},
        doi={10.4108/infoscale.2007.213}
    }
    
  • Ryan H. Choi
    Raymond K. Wong
    Year: 2010
    Efficient Processing of Branch Queries for High-Performance XML Filtering
    INFOSCALE
    ICST
    DOI: 10.4108/infoscale.2007.213
Ryan H. Choi1,2,*, Raymond K. Wong1,2,*
  • 1: The University of New South Wales, Sydney, NSW, Australia
  • 2: National ICT Australia, Sydney, NSW, Australia
*Contact email: ryanc@cse.unsw.edu.au, wong@cse.unsw.edu.au

Abstract

In this paper, we consider the problem of filtering a continuous stream of XML data efficiently against a large number of branch XPath queries. Several approaches have been proposed, and many of them improve their run-time efficiencies by sharing some paths between branch queries. This paper further improves the run-time efficiencies by classifying and grouping semantically equivalent twig patterns, and identifying the common paths that are shared between these groups. Query structure matching is done at index compilation phase, and the paths shared between these groups of queries are processed once. Experiments show that our proposal is efficient and scalable compared to previous work.