Fast in-database cross-matching of high-cadence, high-density source lists with an up-to-date sky model

03/07/2018
by   Bart Scheers, et al.
0

Coming high-cadence wide-field optical telescopes will image hundreds of thousands of sources per minute. Besides inspecting the near real-time data streams for transient and variability events, the accumulated data archive is a wealthy laboratory for making complementary scientific discoveries. The goal of this work is to optimise column-oriented database techniques to enable the construction of a full-source and light-curve database for large-scale surveys, that is accessible by the astronomical community. We adopted LOFAR's Transients Pipeline as the baseline and modified it to enable the processing of optical images that have much higher source densities. The pipeline adds new source lists to the archive database, while cross-matching them with the known cataloged sources in order to build a full light-curve archive. We investigated several techniques of indexing and partitioning the largest tables, allowing for faster positional source look-ups in the cross matching algorithms. We monitored all query run times in long-term pipeline runs where we processed a subset of IPHAS data that have image source density peaks over 170,000 per field of view (500,000 deg^-2). Our analysis demonstrates that horizontal table partitions of declination widths of one-degree control the query run times. Usage of an index strategy where the partitions are densily sorted according to source declination yields another improvement. Most queries run in sublinear time and a few (<20 linear time, because of dependencies on input source-list and result-set size. We observed that for this logical database partitioning schema the limiting cadence the pipeline achieved with processing IPHAS data is 25 seconds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/04/2017

Effective Image Differencing with ConvNets for Real-time Transient Hunting

Large sky surveys are increasingly relying on image subtraction pipeline...
research
03/03/2021

Integrating Column-Oriented Storage and Query Processing Techniques Into Graph Database Management Systems

We revisit column-oriented storage and query processing techniques in th...
research
06/25/2022

Inverted Semantic-Index for Image Retrieval

This paper addresses the construction of inverted index for large-scale ...
research
07/31/2020

Load Plus Communication Balancing in Contiguous Partitions for Distributed Sparse Matrices: Linear-Time Algorithms

We study partitioning to parallelize multiplication of one or more dense...
research
03/27/2019

Designing Succinct Secondary Indexing Mechanism by Exploiting Column Correlations (Extended Version)

Database administrators construct secondary indexes on data tables to ac...
research
12/18/2014

Minimizing the Number of Matching Queries for Object Retrieval

To increase the computational efficiency of interest-point based object ...
research
05/22/2019

Coarse Quad Layouts Through Robust Simplification of Cross Field Separatrix Partitions

Streamline-based quad meshing algorithms use smooth cross fields to part...

Please sign up or login with your details

Forgot password? Click here to reset