Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2007.14-D.6.605

An Efficient Path Expression Join Algorithm Using XML Structure Context  

Kim, Hak-Soo (한양대학교 컴퓨터공학과)
Shin, Young-Jae (한양대학교 컴퓨터공학과)
Hwang, Jin-Ho (한양대학교 컴퓨터공학과)
Lee, Seung-Mi (한양대학교 컴퓨터공학과 BK21 AIS사업팀)
Son, Jin-Hyun (한양대학교 컴퓨터공학과)
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.
Keywords
XPath; Structural Join Algorithm; Path Expression;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Tim Bray, Jean Paoli, C. M. Sperberg-McQueen, Eve maler, 'Extensible Markup Language (XML) 1.0 (Second Edition), W3C Recommendation 6 October '2000.' See http://www.w3.org/ TR/REC-xml/
2 Chun Zhang, et al., 'On Supporting Containment Queries in Relational Database Management Systems', ACM SIGMOD, May 2001   DOI   ScienceOn
3 Shu- Yao Chien, Zografoula Vagena, Donghui Zhang, 'Efficient Structural Joins on Indexed XML Documents,' VLDB, 2002
4 Hanyu Li, Mong Li Lee, Wynne Hsu, Chao Chen, 'An Evaluation of XML Indexes for Structural Join,' SIGMOD Record, Vol.33, No.3, September 2004   DOI
5 Tova Milo, Dan Suciu, 'Index Structures for Path Expressions,' pp.277-295, ICDT 1999   DOI
6 J. Shanmugasundaram, E. J. Shekita, R. Barr, M. J. Carey, B. G. Lindsay, H. Pirahesh, and B. Reinwald, 'Efficiently publishing relational data as XML documents,' In Proceddings of VLDB, 2000
7 Al-Khalifa, S., Jagadish, H.V., Koudas, N., Patel, J.M., Srivastava, D., Yuqing Wu, 'Structural Joins: A Primitive for Efficient XML Query Pattern Matching,' pp 141-152, 2002, ICDE 2002   DOI
8 Howard Katz, 'XQuery From The Experts - a guide to the W3C XML Query Language,' Addison-Wesley, 2003
9 Mary Fernandez, Ashok Malhotra, et al., 'XQuery 1.0 and XPath 2.0 Data Model(XDM),' W3C Candidate Recommendation 3 November 2005. See http://www.w3.org/TR/xpath-datamodel/
10 Anders berglund, Scott Boag, et al., 'XML Path Language (XPath) 2.0, W3c Candidate Recommendation 3 November 2005. See http://www.w3.org/TR/xpath20/
11 Nicolas Bruno, Nick koudas, Divesh Srivastava, 'Holistic Twig Joins: Optimal XML Pattern Matching,' ACM SIGMOD, June 2002   DOI
12 Antonm Guttman, 'R-Trees: A Dynamic Index Structure For Spatial Searching,' ACM SIGMOD, 1984   DOI
13 Quanzhong Li, Bongki Moon, 'Indexing and Querying XML Data for Regular Path Expressions,' pp 361-370, VLDB 2001
14 Sudipto Guha, H.V. Jagadish, et al., 'Approximate XML Joins,' SIGMOD 2002
15 S. Ceri, P. Fraternali, S. Paraboschi, 'XML: Current Developments and Future Challenges for the Database Community,' EDBT 2000   DOI
16 G. Graefe, 'Query evaluation techniques for large databases,' ACM Computing Surveys, 25(2), 1993   DOI   ScienceOn
17 Denilson Barbosa, Alberto Mendelzon, etc., 'ToXgene - the ToX XML Data Generator,' IBM, See http://www.cs.toronto.edu /tox/toxgene/
18 J. McHugh and J. Widom, 'Query optimization for XML,' In Proceedings of VLDB, 1999
19 E. Shekita and M. Carey, 'A performance evaluation of pointer based joins,' Proceedings of SIGMOD, 1990