Investigators: Florin Rusu, John Wu
The catalog matching step is the bottleneck in the real-time workflows of Palomar Transient Factory. The task generalizes to a class of array similarity join using database terminology.
By formalizing the array similarity join, we deiscovered new venues of optimization, and produced a balanced heuristic for vertex cover (BHVC) for query planning.
A much more efficient query processing algorithm
Significantly reducing the time needed for catalog machine in PTF