Skip to main navigation Skip to search Skip to main content

Index for supporting XML structural join efficiently and effectively-CATI

  • Yaxin Yu*
  • , Guoren Wang
  • , Haining Zhang
  • , Jianxin Li
  • *Corresponding author for this work
  • Northeastern University China

Research output: Contribution to journalArticlepeer-review

Abstract

Evaluating structural joins is a crucial operation for performance of XML queries. Proposed in this paper is a novel index CATI, namely, compact ancestor tree index, which can support XML structural join effectively. The basic idea of CATI is to extract ancestor node occurrences from a given ancestor-descendant query (A-D query) pattern or a twig query pattern to establish a compact ancestor tree, and all descendant occurrences of an ancestor node will be linked behind the direct ancestor node in the ancestor tree. Since the stack-tree based join algorithm is a widely used technique due to its excellent join efficiency, the performance of CATI is compared with stack-tree for A-D query and twig query via extensive experiments on a real XML test database. The experimental results show that the performance of the CATI based structural join has significant improvement gains over the stack-tree based join.

Original languageEnglish
Pages (from-to)111-118
Number of pages8
JournalJisuanji Yanjiu yu Fazhan/Computer Research and Development
Volume44
Issue number1
DOIs
Publication statusPublished - Jan 2007
Externally publishedYes

Keywords

  • Ancestor-descendant query
  • CATI
  • Stack-tree
  • Structural join
  • Twig query
  • XML

Fingerprint

Dive into the research topics of 'Index for supporting XML structural join efficiently and effectively-CATI'. Together they form a unique fingerprint.

Cite this