arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1506.07208cs.DBastro-ph.SR
收藏

用于增量测光巡天的交叉匹配引擎

Cross-matching Engine for Incremental Photometric Sky Survey

Ing. Jiří Nádvorník

摘要:

对于光变曲线的生成,现在需要预先计划的测光调查,其中所有的曝光坐标必须被给出并且在调查期间不改变。这篇论文表明这是不必要的,我们可以从天文数据中挖掘这些光变曲线,而这些数据从来没有用于这一目的。通过这种方法,我们可以回收世界上所有的光度测量,并为它们生成观察对象的光变曲线。本论文主要是解决目录生成过程中,这是需要创建光变曲线。在实践中,它专注于天文信息学中最重要的问题之一,即在大数据规模上对数据量进行聚类,而大多数传统技术都是交错的。我们考虑了各种各样的可能的解决方案,从性能,可扩展性,可分布性等,我们定义的时间和内存的复杂性,我们评估所有的测试解决方案的标准。此外,我们还制定了质量标准,在评估结果时也会考虑这些标准。我们使用关系数据库作为我们实现的起点,并将它们与可能用于解决我们问题的最新技术进行比较。这些是noSQL数组数据库,或者通过使用并行性将集群的繁重计算转移到超级计算机。

英文摘要:

For light curve generation, a pre-planned photometry survey is needed nowadays, where all of the exposure coordinates have to be given and don't change during the survey. This thesis shows it is not required and we can data-mine these light curves from astronomical data that was never meant for this purpose. With this approach, we can recycle all of the photometric surveys in the world and generate light curves of observed objects for them. This thesis is addressing mostly the catalog generation process, which is needed for creating the light curves. In practice, it focuses on one of the most important problems in astroinformatics which is clustering data volumes on Big Data scale where most of the traditional techniques stagger. We consider a wide variety of possible solutions from the view of performance, scalability, distributability, etc. We defined criteria for time and memory complexity which we evaluated for all of the tested solutions. Furthermore, we created quality standards which we also take into account when evaluating the results. We are using relational databases as a starting point of our implementation and compare them with the newest technologies potentially usable for solving our problem. These are noSQL Array databases or transferring the heavy computations of clustering towards supercomputers by using parallelism.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑