Browse > Article
http://dx.doi.org/10.3745/KIPSTB.2008.15-B.4.355

A Multi-level Inverted Index Technique for Structural Document Search  

Kim, Jong-Ik (전북대학교 전자정보공학부)
Publication Information
The KIPS Transactions:PartB / v.15B, no.4, 2008 , pp. 355-364 More about this Journal
Abstract
In general, we can use an inverted index for retrieving element lists from structured documents. An inverted index can retrieve a list of elements that have the same tag name. In this approach, however, the cost of query processing is linear to the length of a path query because all the structural relationships (parent-child and ancestor-descendant) should be resolved by structural join operations. In this paper, we propose an inverted index technique and a novel structural join technique for accelerating XML path query evaluation. Our inverted index can retrieve element lists for path segments in a parent-child relationship. Our structural join technique can handle lists of element pairs while the existing techniques handle lists of elements. We show through experiments that these two proposed techniques are integrated to accelerate evaluation of XML path queries.
Keywords
XML; structural join; multi-level inverted index;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H. Jiang, H. Lu, W. Wang and B.C. Ooi, “XR-Tree: Indexing XML Data for Efficient Structural Joins,” In Proceedings of IEEE International Conference on Data Engineering, pp.253-264, 2003
2 Y. Wu, J.M. Patel and H.V. Jagadish, “Structural Join Order Selection for XML Query Optimization,” In proceedings of IEEE International Conference on Data Engineering, pp. 443-454, 2003
3 C.-W. Chung, J.-K. Min and K. Shim, “APEX: an Adaptive Path Index for XML Data,” In proceedings of ACM SIGMOD International Conference on the Management of Data, pp. 321-132, 2002
4 Xmark, “The XML Benchmark Project.” http://monetdb.cwi.nl/xml/
5 T. Milo and D. Suciu, “Index Structures for Path Expressions,” In proceedings of the International Conference on Database Theory, pp.277-295, 1999   DOI   ScienceOn
6 J. Kim and H.-J. Kim, “Efficient Processing of Regular Path Joins using PID,” Information and Software Technology, Vol.45, No.5, pp.241-251, 2003   DOI   ScienceOn
7 N. Bruno, N. Koudas and D. Srivastava, “Holistic Twig Joins: Optimal XML Pattern Matching,” In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pp.310-321, 2002
8 Q. Li and B. Moon, “Indexing and Querying XML Data for Regular Path Expressions,” In Proceedings of the Conference on Very Large Data Bases, pp.361-370, 2001
9 C. Zhang, J. Naughton, D. DeWitt, Q. Luo and G. Lohman, “On Supporting Containment Queries in Relational Database Management Systems,” In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pp. 425-430, 2001   DOI
10 S. Al-Khalifa, H.V. Jagadish, N. Koudas, J.M. Patel, D. Srivastava and Y. Wu., “Structural Joins: A Primitive for Efficient XML Query Pattern Matching,” In Proceedings of IEEE International Conference on Data Engineering, pp. 141-152, 2002
11 Y. Wu, J.M. Patel and H.V. Jagadish, “Estimating Answer Sizes for XML Queries,” In Proceedings of the International Conference on Extending Database Technology, pp.590-608, 2002
12 S.-Y. Chien, Z. Vagena, D. Zhang, V.J. Tsotras and C. Zaniolo, “Efficient Structural Joins on Indexed XML Documents,” In Proceedings of the Conference on Very Large Data Bases, pp.263-274, 2002
13 H. Jiang, W. Wang, H. Lu and J.X. Yu, “Holistic Twig Joins on Indexed XML Documents,” In Proceedings of the Conference on Very Large Data Bases, pp.273-284, 2003
14 J. Kim, “Advanced Structural Joins using Element Distribution," Information Sciences, Vol.176, No.22, pp.1063-1068, 2006   DOI   ScienceOn
15 J. Clark and S. DeRose, “XML Path Language (XPath),” Technical report, W3C Recommendation, 1999
16 T. Bray, J. Paoli and C.M. Sperberg-McQueen, “Extensible Markup Language (XML) 1.0,” Technical Report, W3C Recommendation, 1998
17 D. Chamberlin, D. Florescu, J. Robie, J. Simeon and M. Stefanescu, “XQuery: A Query Language for XML,” Technical report, W3C Working Draft, Feb. 2001