2nd International ICST Conference on Scalable Information Systems

Research Article

Holistically Processing XML Twig Queries with AND, OR, and NOT Predicates

Download357 downloads
  • @INPROCEEDINGS{10.4108/infoscale.2007.201,
        author={Dunren Che},
        title={Holistically Processing XML Twig Queries with AND, OR, and NOT Predicates},
        proceedings={2nd International ICST Conference on Scalable Information Systems},
        proceedings_a={INFOSCALE},
        year={2010},
        month={5},
        keywords={XML query query processing query evaluation twig pattern matching holistic twig join},
        doi={10.4108/infoscale.2007.201}
    }
    
  • Dunren Che
    Year: 2010
    Holistically Processing XML Twig Queries with AND, OR, and NOT Predicates
    INFOSCALE
    ICST
    DOI: 10.4108/infoscale.2007.201
Dunren Che1,*
  • 1: Department of Computer Science Southern Illinois University Carbondale Carbondale, IL 62901, USA
*Contact email: dche@cs.siu.edu

Abstract

Structural joins are important for XML queries, but suffer from producing large, unused intermediate result sets. Holis- tic twig joins claim to solve this problem, but previously pro- posed algorithms fail to support XML queries involving all the three types of logical operations predicates: AND, OR, and NOT, which are however highly desired (such queries are referred to as All-twigs). Currently, there is no holistic twig join algorithm designed for All-twigs. In this paper, we first propose to normalize All-twigs to harness their com- plexity and then present a holistic join framework based on normalized All-twigs.