Advertisement

Processing XML Twig Pattern Query with Wildcards

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7446)

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.

Keywords

Path Query Query Node XPath Query Twig Pattern Twig Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bao, Z., Ling, T.W., Chen, B., Lu, J.: Effective xml keyword search with relevance oriented ranking. In: ICDE, pp. 517–528 (2009)Google Scholar
  2. 2.
    Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal xml pattern matching. In: SIGMOD Conference, pp. 310–321 (2002)Google Scholar
  3. 3.
    Chan, C.Y., Fan, W., Zeng, Y.: Taming xpath queries by minimizing wildcard steps. In: VLDB, pp. 156–167 (2004)Google Scholar
  4. 4.
    Chen, L.J., Papakonstantinou, Y.: Supporting top-k keyword search in xml databases. In: ICDE, pp. 689–700 (2010)Google Scholar
  5. 5.
    Jiang, H., Lu, H., Wang, W.: Efficient processing of XML twig queries with OR-predicates. In: SIGMOD, pp. 59–70 (2004)Google Scholar
  6. 6.
    Lu, J., Chen, T., Ling, T.W.: Efficient processing of XML twig patterns with parent child edges: a look-ahead approach. In: CIKM, pp. 533–542 (2004)Google Scholar
  7. 7.
    Lu, J., Ling, T.W., Bao, Z., Wang, C.: Extended XML tree pattern matching: theories and algorithms. IEEE Trans. Knowl. Data Eng. (2010)Google Scholar
  8. 8.
    Lu, J., Ling, T.W., Chan, C.Y., Chen, T.: From region encoding to extended Dewey: On efficient processing of XML twig pattern matching. In: VLDB, pp. 193–204 (2005)Google Scholar
  9. 9.
    Wu, H., Lin, C., Ling, T.W., Lu, J.: Processing xml twig pattern queries with wildcards. Technical report, http://datasearch.ruc.edu.cn/full
  10. 10.
    Wu, H., Ling, T.-W., Chen, B.: VERT: A Semantic Approach for Content Search and Content Extraction in XML Query Processing. In: Parent, C., Schewe, K.-D., Storey, V.C., Thalheim, B. (eds.) ER 2007. LNCS, vol. 4801, pp. 534–549. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Yu, T., Ling, T.-W., Lu, J.: TwigStackList¬: A Holistic Twig Join Algorithm for Twig Query with Not-Predicates on XML Data. In: Lee, M.L., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 249–263. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. 12.
    Zhang, C., Naughton, J.F., DeWitt, D.J., Luo, Q., Lohman, G.M.: On supporting containment queries in relational database management systems. In: SIGMOD, pp. 425–436 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institute for Infocomm ResearchSingapore
  2. 2.School of InformationRenmin University of ChinaChina
  3. 3.School of ComputingNational University of SingaporeSingapore

Personalised recommendations

Cite paper

Buy options