  The issue of optimizing queries is a cost-sensitive process and with respect
to the number of associated tables in a query, its number of permutations grows
exponentially. On one hand, in comparison with other operators in relational
database, join operator is the most difficult and complicated one in terms of
optimization for reducing its runtime. Accordingly, various algorithms have so
far been proposed to solve this problem. On the other hand, the success of any
database management system (DBMS) means exploiting the query model. In the
current paper, the heuristic ant algorithm has been proposed to solve this
problem and improve the runtime of join operation. Experiments and observed
results reveal the efficiency of this algorithm compared to its similar
algorithms.
