Deakin University
Browse

Accelerating XML structural join by partitioning

Version 2 2024-06-05, 02:20
Version 1 2018-12-20, 19:33
conference contribution
posted on 2024-06-05, 02:20 authored by N Tang, JX Yu, KF Wong, K Lü, Jianxin Li
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.

History

Volume

3588

Pagination

280-289

Location

Copenhagen, Denmark

Start date

2005-08-22

End date

2005-08-26

ISSN

0302-9743

Language

eng

Publication classification

E1.1 Full written paper - refereed

Copyright notice

2005, Springer-Verlag Berlin Heidelberg

Editor/Contributor(s)

Andersen KV, Debenham J, Wagner R

Title of proceedings

DEXA 2005 : Proceedings of the 16th International Conference on Database and Expert Systems Applications 2005

Event

Database and Expert Systems Applications. Conference (16th : 2005 : Copenhagen, Denmark)

Publisher

Springer

Place of publication

Berlin, Germany

Series

Database and Expert Systems Applications Conference

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC