Presentation is loading. Please wait.

Presentation is loading. Please wait.

Spatial Indexing of large astronomical databases László Dobos, István Csabai, Márton Trencséni ELTE, Hungary.

Similar presentations


Presentation on theme: "Spatial Indexing of large astronomical databases László Dobos, István Csabai, Márton Trencséni ELTE, Hungary."— Presentation transcript:

1 Spatial Indexing of large astronomical databases László Dobos, István Csabai, Márton Trencséni ELTE, Hungary

2 Typical datasets ~200M data points multidimensional parameter space real space, magnitudes, colors, redshift etc. over several hundred GBs

3 Typical tasks Object types are classified by a set of linear inequlities in magnitude space (n dimensional polihedra) Compute a histogram of the whole parameter space Find similar objects Find clusters Compare the distribution of two very large datasets

4 Database servers Ideal for storing a large amount of data even when data structure is not so complex Optimized access of data over file systems Clever caching methods MSSQL 2005 can be programmed efficiently

5 Problems In DB servers evaluating data points against inequalities is done on a per row basis Traditionally points close in the magnitude space may be far on the disk(s) when the expected resultset is small, it is not optimal to run a tablescan

6 Main idea divide the parameter space into small cells two main methods: hierarchical: kd-tree, modified kd-tree etc adaptive: Voronoi tessalation section cells with search polihedra instead of check every point check on a per point basis only when needed

7 Voronoi-Dealunay tessalation

8

9 kd-Trees

10

11

12 Steps for creating the tessalation 1. For adaptive (like Voronoi): choose starting points (randomly?) 2. Calculate the cells, store in the database 3. Lookup the cell of each data point 4. Create a DB index on the cell ID orders dataset on the disk 5. Run queries

13 Technical details done in MSSQL using the new SQL CLR features allows running programs within the process of the database server: very fast! linear programming, Voronoi etc. libraries are ported to.net/c#

14 Preliminary results

15 Scientific ideas SDSS photometry – 5D – 300M points finding all objects with similar colors source classification star – quasar separation blue – red galaxy locus etc. Karhunen-Loeve (PCA) coeffs of Bruzual- Charlot models – 5-15D – 100K-100M p Quick match with observed spectra

16 Scientific ideas cont. Magnitudes of spectral synthesis models – 5-10D – 100K-100M points match with observations photo-z physical props. from photometry check consitency of various models (BC-GRASIL) Multiresolution visualization of large number of points


Download ppt "Spatial Indexing of large astronomical databases László Dobos, István Csabai, Márton Trencséni ELTE, Hungary."

Similar presentations


Ads by Google