Accelerating XML structural join by partitioning

N. Tang, J.X. X. Yu, K.F. F. Wong, K. Lü, Jianxin Li

    Research output: Chapter in Book/Conference paperConference paper

    3 Citations (Scopus)

    Abstract

    Structural join is the core part of XML queries and has a significant impact on the performance of XML queries, several classical structural join algorithms have been proposed such as Stack-tree join and XR-Tree join. In this paper, we consider to answer the problem of structural join by partitioning. We first extend the relationships between nodes to the relationships between partitions in the plane and get some observations. We then propose a new partition-based method P-Join for structural join. Based on P-Join, moreover, we present an enhanced partitioned-based spatial structural join algorithm PSSJ. © Springer-Verlag Berlin Heidelberg 2005.
    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science
    Pages280-289
    Number of pages10
    Volume3588
    Publication statusPublished - 2005
    Event16th International Conference on Database and Expert Systems Applications, DExa 2005 - Copenhagen, Denmark
    Duration: 22 Aug 200526 Aug 2005

    Conference

    Conference16th International Conference on Database and Expert Systems Applications, DExa 2005
    Period22/08/0526/08/05

      Fingerprint

    Cite this

    Tang, N., Yu, J. X. X., Wong, K. F. F., Lü, K., & Li, J. (2005). Accelerating XML structural join by partitioning. In Lecture Notes in Computer Science (Vol. 3588, pp. 280-289)