Exploit sequencing to accelerate XML twig query answering

  • Authors:

  • Qian Qian;Jianhua Feng;Jianyong Wang;Lizhu Zhou

  • Affiliations:

  • Deptartment of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;Deptartment of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;Deptartment of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;Deptartment of Computer Science and Technology, Tsinghua University, Beijing, P.R. China

  • Venue:
  • DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Speeding up query evaluation in large XML repositories becomes a challenging and all-important problem with vast XML-related applications arising. In this paper, we present SCALER, an efficient algorithm for XML query answering based on UDFTS and effective twig structure matching scheme. UDFTS not only constructs a one-to-one correspondence between trees and sequences but also maintains critical parent-child relationships for twig structure matching. With SCALER, XML queries can be performed by subsequence matching without breaking twigs into sub paths and evaluating these paths individually. Thus, costly join operations can be avoided elegantly. We also show the correctness of query answering by eliminating false dismissals and false alarms naturally in SCALER. By a thorough experimental study on various real-life data, we prove the efficiency and scalability of SCALER over the previous known alternative.