한국정보과학회논문지:컴퓨팅의 실제 및 레터 (Journal of KIISE:Computing Practices and Letters)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

XML 데이터베이스에서 효율적인 경로처리를 위한 구조적 세미조인 기법

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

  • 손석현 (건국대학교 신기술융합학과) ;
  • 신효섭 (건국대학교 신기술융합학과)
  • 발행 : 2010.02.15
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

구조적 조인은 효율적인 XML 질의 처리를 위한 핵심 연산자 중의 하나이다. 구조적 조인은 대용량의 XML 노드들을 대상으로 계층관계(조상-자손 및 부모-자식관계)를 형성하는 쌍을 효율적으로 계산한다는 측면에서, 경로패턴으로 표현된 질의를 처리하는 데 주로 사용될 수 있다. 하지만 구조적 조인 알고리즘은 XML의 경로 처리과정에서 많은 오버헤드를 야기 시킨다. 이에 대한 개선된 연산자인 구조적 세미조인은 효율적인 처리를 위하여 XML 노드간의 조인 결과를 조상노드 혹은 자손노드로 한정시키는 새로운 연산자이다. 본 논문에서는 구조적 세미조인 알고리즘을 소개하고, 구조적 세미조인을 이용한 경로처리 알고리즘을 제시한다. 실험을 통하여 개선된 방식의 구조적 세미조인 알고리즘이 XML 경로처리에 있어서 매우 효율적임을 보여준다.

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.

키워드

참고문헌

  1. 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.
  2. 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.
  3. 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.
  4. 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. https://doi.org/10.1145/1031570.1031576
  5. 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.
  6. 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.
  7. 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.
  8. 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.
  9. 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.
  10. 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.
  11. 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.
  12. 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.
  13. 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.
  14. 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.