4.7 Article

Scaling pair count to next galaxy surveys

Journal

MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY
Volume 510, Issue 2, Pages 3085-3097

Publisher

OXFORD UNIV PRESS
DOI: 10.1093/mnras/stab3640

Keywords

methods: data analysis; methods:numerical; large-scale structure of Universe

Funding

  1. Office of Science of the U.S. Departurent of Energy [DE-ACO2-05CH11231]

Ask authors/readers for more resources

Counting pairs of galaxies or stars according to their distance is the core of real-space correlation analyses in astrophysics and cosmology. This article introduces an efficient algorithm using Apache Spark framework and a new non-hierarchical sphere pixelization method called SARSPix to optimize distance-related computations. Through LSST-like simulations, pair-distance histograms can be constructed in a few minutes, demonstrating the potential of this new technique in the field of astronomy.
Counting pairs of galaxies or stars according to their distance is at the core of real-space correlation analyses performed in astrophysics and cosmology. Upcoming galaxy surveys (LSST, Euclid) will measure properties of billions of galaxies challenging our ability to perform such counting in a minute-scale time relevant for the usage of simulations. The problem is only limited by efficient access to the data, hence belongs to the big data category. We use the popular Apache Spark framework to address it and design an efficient high-throughput algorithm to deal with hundreds of millions to billions of input data. To optimize it, we revisit the question of non-hierarchical sphere pixelization based on cube symmetries and develop a new one dubbed the `Similar Radius Sphere Pixelization' (SARSPix) with very close to square pixels. It provides the most adapted indexing over the sphere for all distance-related computations. Using LSST-like fast simulations, we compute autocorrelation functions on tomographic bins containing between a hundred million to one billion data points. In each case, we achieve the construction of a standard pair-distance histogram in about 2 min, using a simple algorithm that is shown to scale, over a moderate number of nodes (16-64). This illustrates the potential of this new techniques in the field of astronomy where data access is becoming the main bottleneck. They can be easily adapted to other use-cases as nearest-neighbours search, catalogue cross-match or cluster finding. The software is publicly available from https://github.com/astrolabsoftware/SparkCorr.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available