Query Optimization Based on the Simulated Annealing and Particle Swarm Optimization


Article Preview

In order to allow the user to quickly and accurately search the required information, a query optimization method based on a simulated annealing and particle swarm hybrid algorithm is proposed. The basic idea is: the query population into two flat sub populations, a sub population by using simulated annealing algorithm optimization, another sub populations by using particle swarm algorithm optimization, comparison of two adaptive values, to find the global optimal value. The experimental results show that the mixed algorithm, can further improve the precision and recall of query optimization.



Edited by:

Mohamed Othman




R. J. Song and Y. Wang, "Query Optimization Based on the Simulated Annealing and Particle Swarm Optimization", Applied Mechanics and Materials, Vols. 229-231, pp. 1870-1873, 2012

Online since:

November 2012




[1] RICARDO B Y, BERTHIER R N. Modern information retrieval [M]. New York: Pearson Education Limited, 1999: 36-49.

[2] Li li, Cow rush. The particle swarm optimization algorithm [M]. Beijing: science press. 2009 30-90.

[3] Su Xinning. Information Retrieval Theory And Technology. Science and Technology Literature Press, September 2004 edition, 33-35.

[4] Chen Xinghuan. The Application of GA and Relevance Feedback In Query Optimization [D]. Chongqing: Chongqing University (master's degree thesis), 2006, 27-31.

[5] Jiang Xiaowei. Particle swarm optimization algorithm in the application of query optimization [D]. Harbin: Harbin University of science and technology (master's degree thesis), 2010, 45-49.