Advertisement

Efficient Join Algorithms for Integrating XML Data in Grid Environment

  • Hongzhi Wang
  • Jianzhong Li
  • Shuguang Xiong
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3795)

Abstract

For its self-description feature, XML can be used to represent information in grid environment. Querying XML data distributed in grid environment brings new challenges. In this paper, we focus on join algorithms in result merge step of query processing. In order to transmit results efficiently, we present strategies of data compacting, as well as 4 join operator models. Based on the compacted data structure, we design efficient algorithms of these join operators. Extensive experimental results shows that our data compact strategy is effective; our join algorithms outperform XJoin significantly and have good scalability.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of ACM 13(7), 422–426 (1970)zbMATHCrossRefGoogle Scholar
  2. 2.
    Schmidt, A., Waas, F., Kersten, M.L., Carey, M.J., Manolescu, I., Busse, R.: XMark: A benchmark for XML data management. In: Proceedings of 28th International Conference on Very Large Data Bases (VLDB 2002), pp. 974–985 (2002)Google Scholar
  3. 3.
    Urhan, T., Franklin, M.J.: Xjoin: A reactively-scheduled pipelined join operator. IEEE Data Eng. Bull. 23(2), 27–33 (2000)Google Scholar
  4. 4.
    Zhuge, H.: China’s e-science knowledge grid environment. IEEE Intelligent Systems 19(1), 13–17 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Hongzhi Wang
    • 1
  • Jianzhong Li
    • 1
  • Shuguang Xiong
    • 1
  1. 1.Harbin Institute of TechnologyHarbinChina

Personalised recommendations