Excel Solvers for the Traveling Salesman Problem.

Ordering queries within a workload and ordering joins in a query are important problems in databases [1]. We give algorithms for the query sequencing problem that scale (small space) and are efficient (low runtime) as compared to earlier work [4]. The errors are small in practice and we are able to further reduce them using geometric repair. We provide a computational comparison of TSP solvers and show extensive testing on benchmark datasets [25] observing its connection to these ordering problems.