A Novel Adaptive Cuckoo Search for Optimal Query Plan Generation

Algorithm 1

Pseudocode for Cuckoo search.

Generate an initial population of host nests;

while () or (stop criterion)

  Get a cuckoo randomly () and replace its solution by performing Levy flights;

  Evaluate its fitness

  Choose a nest among () randomly;

  if ()

    Replace by the new solution;

  end if

  A fraction () of the worse nests is abandoned and new ones are built;

  Keep the best solutions/nests;

  Rank the solutions/nests and find the current best;

  Pass the current best to the next generation;

end while