ADQL XMATCH

[Alex Szalay]

Then we should talk about how to simplify and minimize, but to implement something that is
Both conceptually and mathematically  incorrect would be a big mistake.

I am travelling in New Zealand for the next ten days, and today I happened to have a good
internet, but mostly I am off-line. So this is not an ideal time for me to participate in an 
intense discussion.

I am also cc'ing Laszlo and Tamas on the trail, in any case

--Alex


-----Original Message-----
From: dal-bounces at ivoa.net [mailto:dal-bounces at ivoa.net] On Behalf Of Walter Landry
Sent: Wednesday, February 10, 2016 3:37 AM
To: dal at ivoa.net
Subject: Re: ADQL XMATCH

Alex Szalay <szalay at jhu.edu> wrote:
> This is a paper we published 4 years ago about this. The service is 
> now in beta testing.  We just bought 4 dedicated servers.
> 
> http://arxiv.org/pdf/1206.5021v1.pdf

This is interesting work.  However, I would wager that this would be overkill for most of our users, who would be fine with a simple closest match.  For the rest, it would be insufficient, because they want to use error ellipses or filters on object type

  http://arxiv.org/abs/1503.01184v1

So I would be wary of standardizing anything too sophisticated.

Cheers,
Walter Landry