Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11590354_70 | GCC |
Keywords | Field | DocType |
extensive experimental result,compacted data structure,operator model,querying xml data,present strategy,good scalability,new challenge,grid environment,efficient algorithm,data compact strategy,data structure | Hash join,Data structure,Recursive join,XML,Computer science,Algorithm,Sort-merge join,Operator (computer programming),Grid,Distributed computing,Scalability | Conference |
Volume | ISSN | ISBN |
3795 | 0302-9743 | 3-540-30510-6 |
Citations | PageRank | References |
1 | 0.36 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongzhi Wang | 1 | 421 | 73.72 |
| Jianzhong Li | 2 | 3196 | 304.46 |
| Shuguang Xiong | 3 | 99 | 6.46 |