The invention discloses a fast iterative ordering method for search engines. The fast iterative ordering method comprises an offline step and an online step, wherein the offline step comprises the following specific steps: training to obtain a plurality of candidate online ordering models, carrying out storing and proportional distribution on all the ordering models, and storing the ordering models and proportions into a search server cache database at fixed time for reading by the online step; the online step comprises the following specific steps: receiving user requests and distributing the ordering models according to user information, retrieving related files from an index, reading the ordering models in the search server cache database, calculating the priority and returning to users, and counting search behaviors of the users at present time. According to the fast iterative ordering method disclosed by the invention, by a set ordering model description mode, one ordering model can be described by using a character string, and then is sequentially stored into a relational database and a key-value database through a graphical interface and a timing task, so that the persistence of data storage can be guaranteed, and online service can quickly acquire the data.