How to represent coverage: temporal, spectral, positional Clive Page AstroGrid Project University of Leicester 2003 March 19.

Slides:



Advertisements
Similar presentations
Trying to Use Databases for Science Jim Gray Microsoft Research
Advertisements

Registries Work Package 2 Requirements, Science Cases, Use Cases, Test Cases Charter: Focus on science case scenarios, and use cases related specifically.
A.Micol IVOA Registry REGISTRY WG Mar 2003 A Science Case (and 1000 Questions) for the IVOA Registry.
Metadata in the TAP context (1) The Problem: learn about which tables, tablesets,... are available from a TAP server for each of the tables / tablesets,
Introduction to Database Systems1 Records and Files Storage Technology: Topic 3.
Outline Introduction Related work on packet classification Grouper Performance Empirical Evaluation Conclusions.
19-20 March 2003 IVOA Registry Workgroup LeSc Astrogrid Registry: Early Designs Elizabeth Auden Astrogrid Registry Workgroup Leader IVOA Registry Workgroup.
Query Evaluation. An SQL query and its RA equiv. Employees (sin INT, ename VARCHAR(20), rating INT, age REAL) Maintenances (sin INT, planeId INT, day.
Binary Representation Introduction to Computer Science and Programming I Chris Schmidt.
Multiple-key indexes Index on one attribute provides pointer to an index on the other. If V is a value of the first attribute, then the index we reach.
File System Implementation: beyond the user’s view A possible file system layout on a disk.
Imaging Science Fundamentals
PROCESS IN DATA SYSTEMS PLANNING DATA INPUT DATA STORAGE DATA ANALYSIS DATA OUTPUT ACTIVITIES USER NEEDS.
1.1 CAS CS 460/660 Introduction to Database Systems File Organization Slides from UC Berkeley.
Data provenance in astronomy Bob Mann Wide-Field Astronomy Unit University of Edinburgh
Before I stated the database I had to save it into My Documents> ICT> You can do it> D201EPORTFOLIO> Evidence For the field group food item, I set the.
2003 April 151 Data Centres: Connecting to the Real World Clive Page.
TSAR: A Two Tier Sensor Storage Architecture Using Interval Skip Graphs Peter Desnoyers, Deepak Ganesan, and Prashant Shenoy Department of Computer Science.
P olarized R adiation I maging and S pectroscopy M ission Probing cosmic structures and radiation with the ultimate polarimetric spectro-imaging of the.
How to speed up search of ILMT light curves using the HTM (Hierarchical Triangular Mesh) method in relational databases ARC Liège, 11 February 2010 ILMT.
 A databases is a collection of data organized to make it easy to search and easy to retrieve in a useful, usable form.
Signature files. Signature Files Important alternative to inverted indexes. Given a document, the signature is calculated as follows. - First, each word.
Characterisation Data Model applied to simulated data Mireille Louys, CDS and LSIIT Strasbourg.
Higher Computing Computer Systems S. McCrossan 1 Higher Grade Computing Studies 1. Data Representation Data Representation – Why do we use binary? simplicity,
Innovations in the Multimission Archive at STScI (MAST) M. Corbin, M. Donahue, C. Imhoff, T. Kimball, K. Levay, P. Padovani, M. Postman, M. Smith, R. Thompson.
Mapping between SOS standard specifications and INSPIRE legislation. Relationship between SOS and D2.9 Matthes Rieke, Dr. Albert Remke (m.rieke,
Molecular Gas and Dust in SMGs in COSMOS Left panel is the COSMOS field with overlays of single-dish mm surveys. Right panel is a 0.3 sq degree map at.
File Processing - Indexing MVNC1 Indexing Jim Skon.
NHSC Workshop August 2013 NASA Herschel Science Center - page 1 PACS David R. Ardila User Support coordinator / NHSC Archive Scientist The Herschel Science.
Database Management Systems, R. Ramakrishnan and J. Gehrke1 File Organizations and Indexing Chapter 8 “How index-learning turns no student pale Yet holds.
1 Database Management Systems: part of the solution or part of the problem? Clive Page 2004 April 28.
2003 Apr 81 Indexing the Sky Clive Page Apr 82.
Search Engines. Search Strategies Define the search topic(s) and break it down into its component parts What terms, words or phrases do you use to describe.
AstroGrid Solar/STP planning meeting Agenda: Helioscope Preparing for Solar-B Time-series viewing application IVOA and time series A PPARC funded project.
Representation of Images You need to know: (k) explain the representation of an image as a series of pixels represented in binary (l) explain the need.
Sec 14.7 Bitmap Indexes Shabana Kazi. Introduction A bitmap index is a special kind of index that stores the bulk of its data as bit arrays (commonly.
2005/12/021 Fast Image Retrieval Using Low Frequency DCT Coefficients Dept. of Computer Engineering Tatung University Presenter: Yo-Ping Huang ( 黃有評 )
 Enhancing User Experience  Why it is important?  Discussing user experience one-by-one.
1 Information Retrieval LECTURE 1 : Introduction.
INTRODUCTION TO GIS  Used to describe computer facilities which are used to handle data referenced to the spatial domain.  Has the ability to inter-
AstroGrid Usability & Docs, JBO, 6 th Dec 2005 Jonathan Tedds Leicester University AstroGrid Usability & Documentation Usability –Documentation –Infrastructure.
5/18/2006Tom McGlynn NASA/HEASARC1 HEASARC Experiences with UCDs Tom McGlynn and Michael Preciado, NASA/GSFC I NTERNATIONAL V IRTUAL O BSERVATORY A LLIANCE.
A Classification-based Approach to Question Answering in Discussion Boards Liangjie Hong, Brian D. Davison Lehigh University (SIGIR ’ 09) Speaker: Cho,
Lecture 10 Page 1 CS 111 Summer 2013 File Systems Control Structures A file is a named collection of information Primary roles of file system: – To store.
Discussed in Kyoto Schema changes for the next version (Gerard Lemson)  will be included in VOTable1.2 Schema changes for the next version (Gerard Lemson)
The European Hubble Space Telescope Legacy Archive Wolfram Freudling.
12 Oct 2003VO Tutorial, ADASS Strasbourg, Data Access Layer (DAL) Tutorial Doug Tody, National Radio Astronomy Observatory T HE US N ATIONAL V IRTUAL.
Obscore DM v 1.1 Mireille Louys, Doug Tody, Patrick Dowler, Daniel Durand, Laurent Michel, François Bonnarel, Alberto Micol and the IVOA DataModel working.
CPSC 404, Laks V.S. Lakshmanan1 Overview of Query Evaluation Chapter 12 Ramakrishnan & Gehrke (Sections )
Metadata for the Registry Anita Richards JBO/AVO/AstroGrid Registry extracts and stores minimum information to select catalogues which might be relevant.
CCD Image Processing: Issues & Solutions. CCDs: noise sources dark current –signal from unexposed CCD read noise –uncertainty in counting electrons in.
VO Data Access Layer IVOA Cambridge, UK 12 May 2003 Doug Tody, NRAO.
First Tuna Data Workshop (TDW-1) October 2006, Noumea, New Caledonia Oceanic Fisheries Programme (OFP) Secretariat of the Pacific Community (SPC)
WMO GRIB Edition 3 Enrico Fucile Inter-Program Expert Team on Data Representation Maintenance and Monitoring IPET-DRMM Geneva, 30 May – 3 June 2016.
Storage and File Organization
3.3 Fundamentals of data representation
Using a Radio Telescope
INTRODUCTION TO GEOGRAPHICAL INFORMATION SYSTEM
PDAP Query Language International Planetary Data Alliance
الإشعاع الكهرومغناطيسي ووسائل الاستشعار عن بعد
Lecture 12 Lecture 12: Indexing.
Introduction to Database Systems
Resolution.
Introduction to Information Retrieval
Efficient Catalog Matching with Dropout Detection
OBSERVER DATA MANAGEMENT PRINCIPLES AND BEST PRACTICE (Agenda Item 4)
X-ray high resolution spectra in the VO: the case of XMM-Newton RGS
Presentation transcript:

How to represent coverage: temporal, spectral, positional Clive Page AstroGrid Project University of Leicester 2003 March 19.

Registry properties Registry does not contain definitive information on coverage of any dataset. False positives are not of great concern: at worst they waste some search time. False negatives, however, may fail to locate data needed by the user. Registry never answers “yes” or “no”, only “maybe” or “no”.

Typical query Find all datasets which may contain information about objects: –Located in –observed in –between and –... All three of these imply range searches.

(1) Coarse-grained Registry One entry per resource or data collection, –E.g. one for whole HST-WFPC2 data archive. –Perhaps only 100 to 1000 entries in total. Should answer questions like: –Is there any HST-WFPC2 field covering –If answer is “maybe” then have to scan the HST archive for more information

(2) Fine-grained Registry One entry per observation per instrument. –Perhaps 10^5 to 10^6 entries in whole registry Should answer questions like: –Which HST-WFPC2 fields (if any) cover –May store spatial, spectral, and temporal metadata about each observation. –Can directly retrieve required dataset Much more selective, useful scientifically.

Time Simplest representation: for each data resource store the start and end dates of observation (e.g. from FITS DATE- OBS, DATE-END keywords). User’s query may contain range of dates of interest: Registry can easily find all resources for which the ranges overlap. A more complex representation might be needed if: –Single resource has sparse coverage of time axis, e.g. many single observations over a long period of time –User has a long list of dates of interest, e.g. wants to find observations of some periodic phenomenon.

Wavelength range Could represent by an enumerated list of attributes, e.g. –Radio, optical, x-ray, etc. But –Bands not very well defined, e.g. where does soft X-ray turn into XUV? –Probably need to subdivide: e.g. near UV, far UV, but where do you stop? –Even with many terms, it does not provide much selectivity for queries.

Wavelength representation Proposed solution as for time: for each resource store and wavelengths/frequencies observed, specify values for queries. High selectivity: can even find e.g. neutral hydrogen surveys by specifying suitable ranges. Units need to be agreed: Hertz, metres, electron volts? Inter-conversion is easy.

Wavebands – use bitmap? Patricio Ortiz has suggested using a bitmap for wavelength. Observable spectrum covers ~15 decades. –2 bits/decade: 30 bit word bit-mask - 20 bits/decade: 300 bits or 38 bytes. To find matching resources do bit-wise AND of the user’s bitmask with that of each resource.

Sky Coverage We should try to handle instrumental archives, with individual pointings, and find which ones match the user’s query. Examples: –HST ~20,000 pointings, each covering 10 sq.arcmin. –XMM-Newton: ~1000 pointings, each 0.2 sq degs. Two-dimensional problem, not as simple.

Sky coverage representations Store (RAmin, RAmax, DECmin, DECmax): –Suitable for finding which HST field covered this position. –Not suitable for answering a question as to whether any HST field ever covered this position. Bitmap: –1º resolution  >41,253 pixels, a bitmap of 5k bytes. –OK to represent coverage of all observed fields of a given instrument, inefficient if used for individual fields. List of pixels: –using HTM or HEALPix to convert (RA,DEC)  integer. –OK for single fields, inefficient for a whole collection of data.