한국정보처리학회:학술대회논문집 (Proceedings of the Korea Information Processing Society Conference)
- 한국정보처리학회 2005년도 춘계학술발표대회
- /
- Pages.51-54
- /
- 2005
- /
- 2005-0011(pISSN)
- /
- 2671-7298(eISSN)
S-XML 데이터의 효율적인 X-Path 처리를 위한 색인 구조
An Index Structure for Efficient X-Path Processing on S-XML Data
- 장기 (인하대학교 킴퓨터 정보공학과) ;
- 장용일 (인하대학교 킴퓨터 정보공학과) ;
- 박순영 (인하대학교 킴퓨터 정보공학과) ;
- 오영환 (나사렛대학교 정보통신학과) ;
- 배해영 (인하대학교 킴퓨터 정보공학과)
- Zhang, Gi (Dept. of Computer Science & Information Engineering, Inha University) ;
- Jang, Yong-Il (Dept. of Computer Science & Information Engineering, Inha University) ;
- Park, Soon-Young (Dept. of Computer Science & Information Engineering, Inha University) ;
- Oh, Young-Hwan (School of Information Science, Korea Nazarene University) ;
- Bae, Hae-Young (Dept. of Computer Science & Information Engineering, Inha University)
- 발행 : 2005.05.13
초록
This paper proposes an index structure which is used to process X-Path on S-XML data. There are many previous index structures based on tree structure for X-Path processing. Because of general tree index's top-down query fashion, the unnecessary node traversal makes heavy access and decreases the query processing performance. And both of the two query types for X-Path called single-path query and branching query need to be supported in proposed index structure. This method uses a combination of path summary and the node indexing. First, it manages hashing on hierarchy elements which are presented in tag in S-XML. Second, array blocks named path summary array is created in each node of hashing to store the path information. The X-Path processing finds the tag element using hashing and checks array blocks in each node to determine the path of query's result. Based on this structure, it supports both single-path query and branching path query and improves the X-Path processing performance.
키워드