Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Structural Join and Staircase Join Algorithms of Sibling Relationship

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The processing of XML queries can result in evaluation of various structural relationships. Efficient algorithms for evaluating ancestor-descendant and parent-child relationships have been proposed. Whereas the problems of evaluating preceding-sibling-following-sibling and preceding-following relationships are still open. In this paper, we studied the structural join and staircase join for sibling relationship. First, the idea of how to filter out and minimize unnecessary reads of elements using parent’s structural information is introduced, which can be used to accelerate structural joins of parent-child and preceding-sibling-following-sibling relationships. Second, two efficient structural join algorithms of sibling relationship are proposed. These algorithms lead to optimal join performance: nodes that do not participate in the join can be judged beforehand and then skipped using B+-tree index. Besides, each element list joined is scanned sequentially once at most. Furthermore, output of join results is sorted in document order. We also discussed the staircase join algorithm for sibling axes. Studies show that, staircase join for sibling axes is close to the structural join for sibling axes and shares the same characteristic of high efficiency. Our experimental results not only demonstrate the effectiveness of our optimizing techniques for sibling axes, but also validate the efficiency of our algorithms. As far as we know, this is the first work addressing this problem specially.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. World Wide Web Consortium. XQuery 1.0: An XML query language. W3C Candidate Recommendation. http://www. w3.org/TR/2006/CR-xquery-20060608/.

  2. World-Wide Web Consortium. XML path language (XPath) version 1.0. W3C Recommendation. http://www.w3. org/TR/1999/REC-xpath-19991116.

  3. Zhang C, Naughton J, DeWitt D et al. On supporting containment queries in relational database management systems. In Proc. 2001 ACM Int. Conf. Management of Data (SIGMOD), Santa Barbara, USA, May 21–24, 2001, pp.426–437.

  4. Li Q, Moon B. Indexing and querying XML data for regular path expressions. In Proc. 27th VLDB Conf., Roma, Italy, September 11–14, 2001, pp.361–370.

  5. Liu Y, Wan C, Xu S. Efficiently implementing RPE query in an RDBMS. Mini-Micro Systems, 2003, 24(10): 1764–1771. (In Chinese)

    Google Scholar 

  6. Al-Khalifa S, Jagadish H V, Koudas N et al. Structural joins: A primitive for efficient XML query pattern matching. In Proc. 18th Int. Conf. Data Engineering, San Jose, California, USA, February 26–March 1, 2002, pp.141–152.

  7. Chien S, Vagena Z, Zhang D et al. Efficient structural joins on indexed XML documents. In Proc. 28th VLDB Conf., Hong Kong, China, August 20–23, 2002, pp.263–274.

  8. Lam F, Shui W M, Fisher D K et al. Skipping strategies for efficient structural joins. In Proc. 9th Int. Conf. Database Systems for Advanced Applications (DASFAA). Jeju Island, Korea, March 17–19, 2004, pp.196–207.

  9. Wang G, Sun B, Lv J et al. RPE query processing and optimization techniques for XML databases. J. Comput. Sci. Technol. 2004, 19(2): 224–237.

    Article  Google Scholar 

  10. Catania B, Ooi B C, Wang W et al. Lazy XML updates: Laziness as a virtue of update and structural join efficiency. In Proc. 2005 ACM Int. Conf. Management of Data (SIGMOD), Baltimore, Maryland, June 14–16, 2005, pp.515–526.

  11. Wan C, Liu Y, Xu S et al. Indexing XML data based on region coding for efficient processing of structural joins. Chinese J. of Comput., 2005, 28(1): 113–127. (In Chinese)

    Google Scholar 

  12. Grust T. Accelerating XPath location steps. In Proc. 2002 ACM Int. Conf. Management of Data (SIGMOD), Madison, Wisconsin, June 03–06, 2002, pp.109–120.

  13. Grust T, Keulen M V, Teubner J. Staircase join: Teach a relational DBMS to watch its (axis) steps. In Proc. 29th VLDB Conf., Berlin, Germany, September 9–12, 2003, pp.524–525.

  14. Dietz P F. Maintaining order in a linked list. In Proc. Annual ACM Symp. Theory of Computing, San Francisco, California, May 5–7, 1982, pp.122–127.

  15. Che D R. Accomplishing deterministic XML query optimization. J. Comput. Sci. Technol. 2005, 20(3): 357–366.

    Article  MathSciNet  Google Scholar 

  16. Bruno N, Koudas N, Srivastava D. Holistic twig joins: Optimal XML pattern matching. In Proc. 2002 ACM Int. Conf. Management of Data (SIGMOD), Madison, Wisconsin, June 3–6, 2002, pp.310–321.

  17. Jiang H, Wang W and Lu H et al. Holistic twig joins on indexed XML documents. In Proc. 29th VLDB Conf., Berlin, Germany, September 9–12, 2003, pp.273–284.

  18. Chen T, Lu J and Ling T W. On boosting holism in XML twig pattern matching. In Proc. 2005 ACM Int. Conf. Management of Data (SIGMOD), Baltimore, Maryland, USA, June 14–16, 2005, pp.455–466.

  19. Lu J, Ling T W, Chan C Y et al. From region encoding to extended Dewey: On efficient processing of XML twig pattern matching. In Proc. 31st VLDB Conf., Trondheim, Norway, August 30–September 2, 2005, pp.193–204.

  20. TreeBank. Available at http://www.cs.washington.edu/ research/xmldatasets/data/treebank.

Download references

Author information

Authors and Affiliations

  1. School of Information Technology, Jiangxi University of Finance and Economics, Nanchang, 330013, China

    Chang-Xuan Wan & Xi-Ping Liu

  2. Jiangxi Key Laboratory of Data and Knowledge Engineering, Nanchang, 330013, China

    Chang-Xuan Wan & Xi-Ping Liu

Authors
  1. Chang-Xuan Wan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xi-Ping Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chang-Xuan Wan.

Additional information

This work is partially supported by the Natural Science Foundation of Jiangxi Province under Grant No. 0411009.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wan, CX., Liu, XP. Structural Join and Staircase Join Algorithms of Sibling Relationship. J Comput Sci Technol 22, 171–181 (2007). https://doi.org/10.1007/s11390-007-9023-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-007-9023-9

Keywords

Search

Navigation