Hak Soo Kim , Young Jae Shin , Jin Ho Hwang , Seung Mi Lee , Jin Hyun Son

The KIPS Transactions:PartD, Vol. 14, No. 6, pp. 605-614, Oct. 2007
10.3745/KIPSTD.2007.14.6.605,   PDF Download:

Abstract

As a standard query language to search XML data, XQuery and XPath were proposed by W3C. By widely using XQuery and XPath languages, recent researches focus on the development of query processing algorithm and data structure for efficiently processing XML query with the enormous XML database system. Recently, when processing XML path expressions, the concept of the structural join which may determine the structural relationship between XML elements, e.g., ancestor-descendant or parent-child, has been one of the dominant XPath processing mechanisms. However, structural joins which frequently occur in XPath query processing require high cost.In this paper, we propose a new structural join algorithm, called SISJ, based on our structured index, called SI, in order to process XPath queries efficiently. Experimental results show that our algorithm performs marginally better than previous ones. However, in the case of high recursive documents, it performed more than 30% by the pruning feature of the proposed method.

Statistics
Cite this article