TY - GEN
T1 - Data Placement and Query Processing Based on RPE Parallelisms
AU - Yu, Yaxin
AU - Wang, Guoren
AU - Yu, Ge
AU - Wu, Gang
AU - Hu, Junan
AU - Tang, Nan
PY - 2003
Y1 - 2003
N2 - The basic idea behind parallel database systems is to perform operations in parallel to reduce the response time and improve the system throughput. Data placement is a key factor on the performance of parallel database systems. This paper proposes two data partition strategies to decluster XML documents with very large size, Path Schema based Path Instance Balancing (PSPIB) strategy, in which all path instances with the same path schema in a data tree are declustered evenly over all sites, and Node Schema based Node Round-Robin (NSNRR) strategy, in which all node objects with the same node schema in a data tree are declustered over all sites in a round-robin way. Accordingly, two query processing algorithms are proposed based on the two partition methods, Parallel Path Merge (PPM) algorithm and Parallel Pipelining Path Join (PPPJ) algorithm. The performance analysis and evaluation on the two data placement strategies and corresponding query processing algorithms are given in this paper.
AB - The basic idea behind parallel database systems is to perform operations in parallel to reduce the response time and improve the system throughput. Data placement is a key factor on the performance of parallel database systems. This paper proposes two data partition strategies to decluster XML documents with very large size, Path Schema based Path Instance Balancing (PSPIB) strategy, in which all path instances with the same path schema in a data tree are declustered evenly over all sites, and Node Schema based Node Round-Robin (NSNRR) strategy, in which all node objects with the same node schema in a data tree are declustered over all sites in a round-robin way. Accordingly, two query processing algorithms are proposed based on the two partition methods, Parallel Path Merge (PPM) algorithm and Parallel Pipelining Path Join (PPPJ) algorithm. The performance analysis and evaluation on the two data placement strategies and corresponding query processing algorithms are given in this paper.
UR - https://www.scopus.com/pages/publications/0345529057
U2 - 10.1109/CMPSAC.2003.1245335
DO - 10.1109/CMPSAC.2003.1245335
M3 - Conference contribution
AN - SCOPUS:0345529057
SN - 0769520200
T3 - Proceedings - IEEE Computer Society's International Computer Software and Applications Conference
SP - 151
EP - 156
BT - Proceedings of the 27th Annual International Computer Software and Applications Conference, COMPSAC 2003
PB - IEEE Computer Society
T2 - 27th Annual International Computer Software and Applications Conference, COMPSAC 2003
Y2 - 3 November 2003 through 6 November 2003
ER -