摘要
We introduce an algorithm to solve the block-edge problem taking advantage of the two different sky splitting functions： HTM and HEALPix. We make the cross-match with the two functions, and then we obtain the union set of the two different sets. We use the ThreadPool technique to speed up the cross-match. In this way improved accuracy can be obtained on the cross-match. Our experiments show that this algorithm has a remarkable performance superiority compared with the previous ones and can be applied to the cross-match between large-scale catalogs. We give some ideas about solving the many-for-one situation occurred in the cross-match.
We introduce an algorithm to solve the block-edge problem taking advantage of the two diferent sky splitting functions:HTM and HEALPix.We make the cross-match with the two functions,and then we obtain the union set of the two diferent sets.We use the ThreadPool technique to speed up the cross-match.In this way improved accuracy can be obtained on the cross-match.Our experiments show that this algorithm has a remarkable performance superiority compared with the previous ones and can be applied to the cross-match between large-scale catalogs.We give some ideas about solving the many-for-one situation occurred in the cross-match.
基金
supported by the National Natural Science Foundation of China(Grant Nos.10973021,11078013 and 11233004)
