1st International ICST Conference on Scalable Information Systems

Research Article

TWIX: twig structure and content matching of selective queries using binary labeling

  • @INPROCEEDINGS{10.1145/1146847.1146889,
        author={S. Alireza  Aghili and Hua-Gang  Li and Divyakant  Agrawal and Amr El  Abbadi},
        title={TWIX: twig structure and content matching of selective queries using binary labeling},
        proceedings={1st International ICST Conference on Scalable Information Systems},
        publisher={ACM},
        proceedings_a={INFOSCALE},
        year={2006},
        month={6},
        keywords={},
        doi={10.1145/1146847.1146889}
    }
    
  • S. Alireza Aghili
    Hua-Gang Li
    Divyakant Agrawal
    Amr El Abbadi
    Year: 2006
    TWIX: twig structure and content matching of selective queries using binary labeling
    INFOSCALE
    ACM
    DOI: 10.1145/1146847.1146889
S. Alireza Aghili1,*, Hua-Gang Li2,*, Divyakant Agrawal2,*, Amr El Abbadi2,*
  • 1: Query Optimizer Group, NCR/Teradata Engineering, 17095 Via Del Campo, San Diego, CA 92127
  • 2: Department of Computer Science, University of California-Santa Barbara, Santa Barbara, CA 93106
*Contact email: alireza.aghili@ncr.com, huagang@cs.ucsb.edu, agrawal@cs.ucsb.edu, amr@cs.ucsb.edu

Abstract

XML queries specify predicates on the content and the structure of the elements of tree-structured XML documents. Hence, discovering the occurrences of twig (tree structure) query patterns is a core operation for XML query processing. In this paper, we propose a novel technique for matching XML twig query patterns, named TWIX, which results in a substantial reduction of the search space, response time, size and structure invariance through a distributed binary labeling and tree traversal algorithm. Furthermore, TWIX benefits from an interactive graphical user interface for twig query matching.