World Wide Telescope
Sponsored Links
This presentation is the property of its rightful owner.
1 / 20

Jim Gray Microsoft Research Alex Szalay Johns Hopkins University PowerPoint PPT Presentation

  • Uploaded on
  • Presentation posted in: General

World Wide Telescope mining the Sky using Web Services Information At Your Fingertips for astronomers. Jim Gray Microsoft Research Alex Szalay Johns Hopkins University.

Download Presentation

Jim Gray Microsoft Research Alex Szalay Johns Hopkins University

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

Jim gray microsoft research alex szalay johns hopkins university

World Wide Telescopemining the Skyusing Web ServicesInformation At Your Fingertips for astronomers

Jim Gray Microsoft Research

Alex Szalay Johns Hopkins University

Jim gray microsoft research alex szalay johns hopkins university

How to build the World Wide Telescope?Web Services & Grid Enable Virtual Observatory

  • The Internet will be the world’s best telescope:

    • It has data on every part of the sky

    • In every measured spectral band: optical, x-ray, radio..

    • As deep as the best instruments (2 years ago).

    • It is up when you are up.The “seeing” is always great (no working at night, no clouds no moons no..).

    • It’s a smart telescope: links objects and data to literature on them.

  • W3C & IETF standards Provide

    • Naming

    • Authorization / Security / Privacy

    • Distributed Objects

      • Discovery, Definition, Invocation, Object Model

    • Higher level services: workflow, transactions, DB,..

  • A great test bed for .NET ideas

Steps to world wide telescope

Steps to World Wide Telescope

  • Define a set of Astronomy Objects and methods.

    • Based on UDDI, WSDL, XSL, SOAP, dataSet

  • Use them locally to debug ideas

    • Schema, Units,…

    • Dataset problems

    • Typical use scenarios.

  • Federate different archives

    • Each archive is a web service

    • Global query tool accesses them

  • Working on this with

    • Sloan Digital Sky Survey and CalTech/Palomar.Especially Alex Szalay et. al. at JHU

Why astronomy data


DSS Optical

IRAS 25m

2MASS 2m

GB 6cm

WENSS 92cm

NVSS 20cm

IRAS 100m

Why Astronomy Data?

  • It has no commercial value

    • No privacy concerns

    • Can freely share results with others

    • Great for experimenting with algorithms

  • It is real and well documented

    • High-dimensional data (with confidence intervals)

    • Spatial data

    • Temporal data

  • Many different instruments from Many different places and Many different times

  • Federation is a goal

  • The questions are interesting

    • How did the universe form?

  • There is a lot of it (petabytes)

Step1 putting sdss online scenario design

Step1 Putting SDSS online Scenario Design

  • Astronomers proposed 20 questions

    • Typical of things they want to do

    • Each would require a week of programming in tcl / C++/ FTP

  • Goal, make it easy to answer questions

  • DB and tools design motivated by this goal

    • Implemented utility procedures

    • JHU Built GUI for Linux clients

Q11: Find all elliptical galaxies with spectra that have an anomalous emission line.

Q12: Create a grided count of galaxies with u-g>1 and r<21.5 over 60<declination<70, and 200<right ascension<210, on a grid of 2’, and create a map of masks over the same grid.

Q13: Create a count of galaxies for each of the HTM triangles which satisfy a certain color cut, like 0.7u-0.5g-0.2i<1.25 && r<21.75, output it in a form adequate for visualization.

Q14: Find stars with multiple measurements and have magnitude variations >0.1. Scan for stars that have a secondary object (observed at a different time) and compare their magnitudes.

Q15: Provide a list of moving objects consistent with an asteroid.

Q16: Find all objects similar to the colors of a quasar at 5.5<redshift<6.5.

Q17: Find binary stars where at least one of them has the colors of a white dwarf.

Q18: Find all objects within 30 arcseconds of one another that have very similar colors: that is where the color ratios u-g, g-r, r-I are less than 0.05m.

Q19: Find quasars with a broad absorption line in their spectra and at least one galaxy within 10 arcseconds. Return both the quasars and the galaxies.

Q20: For each galaxy in the BCG data set (brightest color galaxy), in 160<right ascension<170, -25<declination<35 count of galaxies within 30"of it that have a photoz within 0.05 of that galaxy.

Q1: Find all galaxies without unsaturated pixels within 1' of a given point of ra=75.327, dec=21.023

Q2: Find all galaxies with blue surface brightness between and 23 and 25 mag per square arcseconds, and -10<super galactic latitude (sgb) <10, and declination less than zero.

Q3: Find all galaxies brighter than magnitude 22, where the local extinction is >0.75.

Q4: Find galaxies with an isophotal surface brightness (SB) larger than 24 in the red band, with an ellipticity>0.5, and with the major axis of the ellipse having a declination of between 30” and 60”arc seconds.

Q5: Find all galaxies with a deVaucouleours profile (r¼ falloff of intensity on disk) and the photometric colors consistent with an elliptical galaxy. The deVaucouleours profile

Q6: Find galaxies that are blended with a star, output the deblended galaxy magnitudes.

Q7: Provide a list of star-like objects that are 1% rare.

Q8: Find all objects with unclassified spectra.

Q9: Find quasars with a line width >2000 km/s and 2.5<redshift<2.7.

Q10: Find galaxies with spectra that have an equivalent width in Ha >40Å (Ha is the main hydrogen spectral line.)

Two kinds of sdss data in an sql db objects and images all in db

Two kinds of SDSS data in an SQL DB(objects and images all in DB)

  • 15M Photo Objects ~ 400 attributes

50K Spectra with ~30 lines/


Spatial data access sql extension szalay kunszt brunner http www sdss jhu edu htm

Spatial Data Access – SQL extension(Szalay, Kunszt, Brunner)

  • Added Hierarchical Triangular Mesh (HTM) table-valued function for spatial joins.

  • Every object has a 20-deep Mesh ID.

  • Given a spatial definition:Routine returns up to ~10 covering triangles.

  • Spatial query is then up to ~10 range queries.

  • Very fast: 10,000 triangles / second / cpu.

  • Based onSQL Server Extended Stored Procedure


Q15 fast moving objects

Q15: Fast Moving Objects

  • Find near earth asteroids:

  • Finds 3 objects in 11 minutes

    • (or 52 seconds with an index)

  • Ugly, but consider the alternatives (c programs an files and…)

  • SELECT r.objID as rId, g.objId as gId,

  • dbo.fGetUrlEq(g.ra, g.dec) as url

  • FROM PhotoObj r, PhotoObj g

  • WHERE = and r.camcol=g.camcol andabs(g.field-r.field)<2 -- nearby

  • -- the red selection criteria

  • and ((power(r.q_r,2) + power(r.u_r,2)) > 0.111111 )

  • and r.fiberMag_r between 6 and 22 and r.fiberMag_r < r.fiberMag_g and r.fiberMag_r < r.fiberMag_i

  • and r.parentID=0 and r.fiberMag_r < r.fiberMag_u and r.fiberMag_r < r.fiberMag_z

  • and r.isoA_r/r.isoB_r > 1.5 and r.isoA_r>2.0

  • -- the green selection criteria

  • and ((power(g.q_g,2) + power(g.u_g,2)) > 0.111111 )

  • and g.fiberMag_g between 6 and 22 and g.fiberMag_g < g.fiberMag_r and g.fiberMag_g < g.fiberMag_i

  • and g.fiberMag_g < g.fiberMag_u and g.fiberMag_g < g.fiberMag_z

  • and g.parentID=0 and g.isoA_g/g.isoB_g > 1.5 and g.isoA_g > 2.0

  • -- the matchup of the pair

  • and sqrt(power(,2)+ power(,2)+power(,2))*(10800/PI())< 4.0

  • andabs(r.fiberMag_r-g.fiberMag_g)< 2.0

Jim gray microsoft research alex szalay johns hopkins university



Performance on current sdss data

Performance (on current SDSS data)

  • Run times: on 15k$ COMPAQ Server (2 cpu, 1 GB , 8 disk)

  • Some take 10 minutes

  • Some take 1 minute

  • Median ~ 22 sec.

  • Ghz processors are fast!

    • (10 mips/IO, 200 ins/byte)

    • 2.5 m rec/s/cpu

~1,000 IO/cpu sec ~ 64 MB IO/cpu sec

Sequential scan speed is important

Sequential Scan Speed is Important

  • In high-dimension data, best way is to search.

  • Sequential scan covering index is 10x faster

    • Seconds vs minutes

  • SQL scans at 2M records/s/cpu (!)

Cosmo 64 bit sql server windows computing the cosmological constant

Cosmo: 64-bit SQL Server & WindowsComputing the Cosmological Constant

  • Compares simulated & observed galaxy distribution

  • Measure distance between each pair of galaxiesA lot of work  (108x 108 = 1016 steps)Good algorithms make this ~Nlog2N

  • Needs LARGE main memory

  • Using Itanium donated by Compaq

  • 64-bitWindows & SQL server

  • (Alex Szalay, Adrian Pope@ JHU).






Where we are today

Where We Are Today

  • One Astronomy Archive Web Service works

  • Federating 3 Web Services (JHU, Cal Tech, Space Telescope)

  • WWT is a great .Net application

    • Federating heterogeneous data sources.

    • Cooperating organizations

    • An Information At Your Fingertips challenge.

  • SDSS DB is a data mining challenge:get your personal copy at

  • Papers about this at:


    • (see paragraph 1)

  • DB available for experiments

Sloan digital sky survey http www sdss org

Sloan Digital Sky Survey

  • For the last 12 years astronomers have been building a telescope (with funding from Sloan Foundation, NSF, and a dozen universities). 90M$.

  • Y2000: engineer, calibrate, commission: now public data.

    • 5% of the survey, 600 sq degrees, 15 M objects 60GB, ½ TB raw.

    • This data includes most of the known high z quasars.

    • It has a lot of science left in it but….

  • New the data is arriving:

    • 250GB/nite (20 nights per year) = 5TB/y.

    • 100 M stars, 100 M galaxies, 1 M spectra.


What we learned from the 20 queries

What we learned from the 20 Queries

  • All have fairly short SQL programs -- a substantial advance over (tcl, C++)

  • Many are sequential one-pass and two-pass over data

  • Covering indices make scans run fast

  • Table valued functions are wonderful but limitations are painful.

  • Counting, Binning, Histograms VERY common

  • Spatial indices helpful,

  • Materialized view (Neighbors) helpful.

An easy one q7 find rare star like objects

An easy oneQ7: Find rare star-like objects.

  • Found 14,681 buckets, first 140 buckets have 99% time 62 seconds

  • CPU bound 226 k records/second (2 cpu) 250 KB/s.

Selectcast((u-g) as int) as ug,

cast((g-r) as int) as gr,

cast((r-i) as int) as ri,

cast((i-z) as int) as iz,

count(*) as Population

from stars

group bycast((u-g) as int), cast((g-r) as int),

cast((r-i) as int), cast((i-z) as int)

order by count(*)

An easy one q15 find asteroids

An Easy OneQ15: Find asteroids

  • Sounds hard but there are 5 pictures of the object at 5 different times (color filters) and so can “see” velocity.

  • Image pipeline computes velocity.

  • Computing it from the 5 color x,y would also be fast

  • Finds 1,303 objects in 3 minutes, 140MBps.(could go 2x faster with more disks)

selectobjId, dbo.fGetUrlEq(ra,dec) as url --return object ID & url

sqrt(power(rowv,2)+power(colv,2)) as velocity

fromphotoObj -- check each object.

where (power(rowv,2) + power(colv, 2)) -- square of velocity

between 50 and 1000 -- huge values =error

  • Login