Browse > Article

Structural Semi-Join Operators for Efficient Path Processing in XML Databases  

Son, Seok-Hyun (건국대학교 신기술융합학과)
Shin, Hyo-Seop (건국대학교 신기술융합학과)
Abstract
The structural join is one of core operators for efficient processing of XML queries. It can be mainly used for path-represented XML queries as it efficiently retrieves the node pairs that form a hierarchical relationship (i.e., ancestor-descendant, Parent-child relationship) among large-scale XML nodes. However, the structural join algorithms still suffer potential overhead in the middle of processing of XML path queries. In addressing this problem, the structural semi-join is proposed as a novel operator that retrieves only the ancestor or descendant nodes as join results for efficient processing. In this paper, we describe the algorithms for the structural semi-join and present the methods of XML path processing based on the structural semi-join algorithms. The experimental results show that the structural semi-join algorithms are very efficient in processing XML path processing.
Keywords
XML; Structural Join; Structural Semi-Join; XML path processing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 K.-L. Wu, S.-K. Chen, and P. S. Yu, "Efficient structural joins with on-the-fly-indexing," In Proc. of 2005 International Conference on World Wide Web, pp.1028-1029, May 2005.
2 Q. Li and B. Moon, "Indexing and querying XML data for regular path expressions," In Proc. of 2001 International Conference on Very Large Data Bases conference, pp.361-370, September 2001.
3 C. Mathis and T. Harder, "Hash-based structural join algorithms," In Proc. of 2006 International Conference on Extending Database Technology, pp.136-149, March 2006.
4 C. Luo, Z. Jiang, W.-C. Hou, F. Yan, and C.-F. Wang, "Estimating XML structural join size quickly and economically," In Proc. of 2006 International Conference on Data Engineering, pp.62-62, April 2006.
5 S.-Y. Chien, Z. Vagena, D. Zhang, V. J. Tsotras, and C. Zaniolo, "Efficient structural joins on indexed XML documents," In Proc. of 2002 International Conference on Very Large Data Bases, pp.263-274, August 2002.
6 P. Mandawat and V. J. Tsotras, "Indexing schemes for efficient aggregate computation over structural joins," In Proc. of 2005 International Workshop on Web & Data Bases, pp.55-60, June 2005.
7 Y. Wu, J. M. Patel, and H. V. Jagadish. "Structural join order selection for XML query optimization," In Proc. of 2003 International Conference on Data Engineering, pp.443-454, March 2003.
8 C. Zhang, J. F. Naughton, Q. Luo, and D. J. DeWitt, and G. M. Lohman, "On supporting containment queries in relational database management systems," In Proc. of 2001 International Conference on Special Interest Group on Management Of Data, pp.425-436, May 2001.
9 S. Son, H. Shin and Z. Xu, "Structural Semi-Join : A light-weight structural operator for efficient XML query pattern matching," In Proc. of 2007 International Database Engineering & Application Symposium, pp.233-240, September 2007.
10 N. Bruno, N. Koudas, and D. Srivastava, "Holistic twig joins: optimal XML pattern matching," In Proc. of 2002 International Conference on Special Interest Group on Management Of Data, pp. 310-321, June 2002.
11 C. Mathis, T. Harder, and M. P. Haustein, "Locking-aware structural join operators for XML query processing," In Proc. of 2006 International Conference on Special Interest Group on Management Of Data, pp.467-478, June 2006.
12 D. Srivastava, S. A.-Khalifa, H. V. Jagadish, N. Koudas, J. M. Patel, and Y. Wu, "Structural joins: A primitive for efficient XML query pattern matching," In Proc. of 2002 International Conference on Data Engineering, pp.141-152, February 2002.
13 H. Li, M.-L. Lee, W. Hsu, and C. Chen, "An evaluation of XML indexes for structural join," ACM SIGMOD Record, 33(3), pp.28-33, April 2004.   DOI
14 K. Liu, F. H. Lochovsky, "Efficient computation of aggregate structural joins," In Proc. of 2003 International Conference on Web Information Systems Engineering, pp.21-30, December 2003.