Name
Abstract | ||
|---|---|---|
Multi-wavelength data cross-match among multiple catalogs is a basic and unavoidable step to make distributed digital archives accessible and interoperable. As current catalogs often contain millions or billions objects, it is a typical data-intensive computation problem. In this paper, a high-efficient parallel approach of astronomical cross-match is introduced. We issue our partitioning and parallelization approach, after that we address some problems introduced by task partition and give the solutions correspondingly, including a sky splitting function HEALPix we selected which play a key role on both the task partitioning and the database indexing, and a quick bit-operation algorithm we advanced to resolve the block-edge problem. Our experiments prove that the function has a marked performance superiority comparing with the previous functions and is fully applicable to large-scale cross-match. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-03095-6_57 | ICA3PP |
Keywords | Field | DocType |
paralleled large-scale astronomical cross-matching,multi-wavelength data cross-match,task partitioning,task partition,previous function,block-edge problem,astronomical cross-match,sky splitting function,parallelization approach,high-efficient parallel approach,large-scale cross-match,data intensive computing | Bitwise operation,Interoperability,Computer science,Parallel computing,HEALPix,Theoretical computer science,Digital Archives,Partition (number theory),Sextant (astronomical),Database index,Distributed computing,Computation | Conference |
Volume | ISSN | Citations |
5574 | 0302-9743 | 4 |
PageRank | References | Authors |
0.51 | 6 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qing Zhao | 1 | 1203 | 119.43 |
| Sun Jizhou | 2 | 253 | 47.07 |
| Ce Yu | 3 | 75 | 15.15 |
| Chenzhou Cui | 4 | 15 | 5.24 |
| Liqiang Lv | 5 | 4 | 0.51 |
| Jian Xiao | 6 | 24 | 9.12 |