Processing XML Twig Pattern Query with Wildcards

  • Huayu Wu
  • Chunbin Lin
  • Tok Wang Ling
  • Jiaheng Lu
Conference paper

DOI: 10.1007/978-3-642-32600-4_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7446)
Cite this paper as:
Wu H., Lin C., Ling T.W., Lu J. (2012) Processing XML Twig Pattern Query with Wildcards. In: Liddle S.W., Schewe KD., Tjoa A.M., Zhou X. (eds) Database and Expert Systems Applications. DEXA 2012. Lecture Notes in Computer Science, vol 7446. Springer, Berlin, Heidelberg

Abstract

In this paper, we present a novel and complementary technique to optimize XML twig pattern queries with wildcards(*). Our approach is based on utilizing a new axis called AD-dis, to equivalently rewrite a query with wildcards (non-branching as well as branching wildcards) into a single query without any wildcards. We present efficient rewriting algorithms and also twig pattern matching algorithms to process the rewritten queries with AD-dis, which is proven to be I/O and CPU optimal. In addition, the experimental results not only verify the scalability and efficiency of our extended matching algorithms, but also demonstrate the effectiveness of our rewriting algorithms.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Huayu Wu
    • 1
  • Chunbin Lin
    • 2
  • Tok Wang Ling
    • 3
  • Jiaheng Lu
    • 2
  1. 1.Institute for Infocomm ResearchSingapore
  2. 2.School of InformationRenmin University of ChinaChina
  3. 3.School of ComputingNational University of SingaporeSingapore

Personalised recommendations