An Efficient Parallel PathStack Algorithm for Processing XML Twig Queries on Multi-core Systems

  • Jianhua Feng
  • Le Liu
  • Guoliang Li
  • Jianhui Li
  • Yuanhao Sun
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5981)


Multi-cores are more and more popular recently and have being altered the course of computing. Traditional XPath query evaluation algorithms cannot take full advantages of multi-cores, and it is not straightforward to adapt such algorithms on multi-cores. In this paper, we propose an efficient parallel PathStack algorithm, named P-PathStack, for processing XML twig queries. The algorithm first efficiently partitions input element lists into multiple buckets, and then processes data in each bucket in parallel. With efficient partitioning method, our proposed algorithm can avoid many useless elements and achieve very good speedup ratio. We have implemented the algorithm and experimental results show that it achieves high performance and speedup ratio.


Multi-core Partition Parallel PathStack 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Jamex, C., et al.: XML path language (XPath),
  2. 2.
    Boag, S., et al.: XQuery: An XML Query Language,
  3. 3.
    Deutsch, A., Fernandez, M., Florescu, D., et al.: A query language for XML. WWW (1999)Google Scholar
  4. 4.
    Florescu, D., Kossman, D.: Sorting and Querying XML Data using an RDBMS. IEEE Data Engineering (1999)Google Scholar
  5. 5.
    AI-Khalifa, S., Jagadish, H.V., et al.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: Proceedings of the 18th International Conference on Data Engineering, San Jose, California, USA, pp. 141–152 (2002)Google Scholar
  6. 6.
    Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins:Optimal XML Pattern Matching. In: SIGMOD, pp. 310–321 (2002)Google Scholar
  7. 7.
    Jiang, H., et al.: Holistic Twig Joins on Indexed XML Documents. In: VLDB (2003)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.
    Chen, T., Lu, J., Ling, T.W.: On Boosting Holism In XML Twig Pattern Matching Using Structural Indexing Techniques. In: SIGMOD, pp. 455–466 (2005)Google Scholar
  10. 10.
    Li, G., Feng, J., et al.: Exploiting Even Partition to Accelerate Structure Join. In: IEEE XWICT (2006)Google Scholar
  11. 11.
    Feng, J.H., Li, G., Zhou, L., et al.: BBTC: A New Update-supporting Coding Scheme for XML Documents. In: Fan, W., Wu, Z., Yang, J. (eds.) WAIM 2005. LNCS, vol. 3739, pp. 32–44. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Lu, W., Chiu, K., Pan, Y.: A Parallel Approach to XML Parsing. In: 7th IEEE/ACM International Conference on Grid Computing, pp. 223–230 (2006)Google Scholar
  13. 13.
    Lu, W., Gannon, D.: Parallel XML Processing by Work Stealing. In: SOCP (2007)Google Scholar
  14. 14.
    Li, X.: Efficient and Parallel Evaluation of XQuery. Doctor Dissertation. The Ohio State University (2006)Google Scholar
  15. 15.
    OpenMP: Simple, Portable, Scalable SMP Programming,
  16. 16.
  17. 17.
  18. 18.
  19. 19.
    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
  20. 20.
    Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: VLDB, pp. 361–370 (2001)Google Scholar
  21. 21.
    Chien, S.Y., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient Structural Joins on Indexed XML Documents. In: VLDB, pp. 263–274 (2002)Google Scholar
  22. 22.
    Grust, T.: Accelerating XPath Location Steps. In: SIGMOD, pp. 109–120 (2002)Google Scholar
  23. 23.
    Jiang, H.F., Lu, H.J., Ooi, B.C., Wang, W.: XR-Tree:Indexing XML Data for Efficient Structural Joins. In: ICDE (2003)Google Scholar
  24. 24.
    Wu, Y., Patel, J., Jagadish, H.: Structural join order selection for XML query optimization. In: ICDE, pp. 443–454 (2003)Google Scholar
  25. 25.
    Choi, B., Mahoui, M., Wood, D.: On the Optimality of Holistic Algorithms for Twig Queries. In: Mařík, V., Štěpánková, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol. 2736, pp. 28–37. Springer, Heidelberg (2003)Google Scholar
  26. 26.
    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
  27. 27.
    Chen, T., Lu, J., Ling, T.W.: On Boosting Holism In XML Twig Pattern Matching Using Structural Indexing Techniques. In: SIGMO, pp. 455–466 (2005)Google Scholar
  28. 28.
    Mathis, C., Harder, T., Haustein, M.P.: Locking-aware structural join operators for XML query processing. In: SIGMOD, pp. 467–478 (2006)Google Scholar
  29. 29.
    Chen, S., Li, H.-G., Tatemura, J., Hsiung, W.-P., Agrawal, D., Candan, K.S.: Twig2Stack: Bottom-up Processing of Generalized Tree Pattern Queries over XML Documents. In: VLDB (2006)Google Scholar
  30. 30.
    Li, G., Feng, J., Zhou, L.: Efficient holistic twig joins in leaf-to-root combining with root-to-leaf way. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 834–849. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  31. 31.
    Liu, L., Feng, J., Li, G., Qian, Q., Li, J.: Parallel Structural Join Algorithm on Memory-shared Multi-core Systems. In: WAIM, Zhang Jiajie, China (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jianhua Feng
    • 1
  • Le Liu
    • 1
  • Guoliang Li
    • 1
  • Jianhui Li
    • 1
  • Yuanhao Sun
    • 1
  1. 1.Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and TechnologyTsinghua UniversityBeijingChina

Personalised recommendations