An O(N log M) Algorithm for Catalogue Crossmatching

Details An O(N log M) Algorithm for Catalogue Crossmatching An O(N log M) Algorithm for Catalogue Crossmatching

Dec 2005

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2005aspc..347..346d&link_type=abstract

Astronomical Data Analysis Software and Systems XIV ASP Conference Series, Vol. 347, Proceedings of the Conference held 24-27 Oc

Astronomy and Astrophysics

Astronomy

5

Scientific paper

Catalogue cross-matching is an inherently costly operation. Our algorithm applies filter-refine and plane sweep techniques. Pre-processing consists of a sort by declination, and the active list is a queue indexed by a binary tree. The algorithm is O(N log M) in both I/O and processor costs, with only moderate memory requirements. Empirical assessment on catalogues of up to a billion records suggests that the algorithm performs at least an order of magnitude better than the techniques in current use.

Affiliated with

Also associated with

No associations

Rating

An O(N log M) Algorithm for Catalogue Crossmatching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An O(N log M) Algorithm for Catalogue Crossmatching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An O(N log M) Algorithm for Catalogue Crossmatching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1034707