Earticle

초록

영어

Twig query is a core operation in processing and optimizing XML structural queries. Recently, various algorithms have been proposed for finding twig patterns efficiently. Most of them are based on region labeling, pay little attention on nodes level information, and require additional caches such as stacks or lists to maintain the intermediate matching results, which cause the performance bottleneck of these algorithms. In contrast to previous work, we present a bottom-up algorithm for twig queries, which does not require additional caches and introduces idea of string searching to determine binary relationship between two nodes. Be- sides, this paper presents a node filtering mechanism–PathLevel, which can also be used in other algorithms for speeding up the query. Comprehensive experiments on several datasets demonstrate our method is an effective way for twig query.

목차

Abstract
 1. Introduction
 2. Preliminaries
  2.1 Node’s Level
 3. Bottom-up Algorithm: TwigLevel
  3.1 Problem Statement
  3.2 Path Level Algorithm
  3.3 Twig Level Algorithm
 4. Experimental Evaluation
  4.1 Experimental Setting
  4.2 Path Query
  4.3 Twig Query
 5. Conclusion and Future Work
 Acknowledgements
 References

키워드

저자

• Tang Zhi-xian [ College of Computer and Information, Hohai University ]
• Feng Jun [ College of Computer and Information, Hohai University ]
• Xu Li-ming [ College of Computer and Information, Hohai University ]
• Shi Ya-qing [ College of Computer and Information, Hohai University, Institute of Command Information Systems, PLA University of Science and Technology ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605