Method for biding website search result rank

Abstract

The invention relates to a method for processing a computer data retrieval result and specifically discloses a method for biding a website search result rank. The method takes a day as a charging unit and aims to solve the problem of cheating caused by charging in terms of clicks; and simultaneously, the method only charges suppliers ranked in a predetermined range and charges no any fee for failure, so that the suppliers can realize self-control on the promotion costs thereof. The method for biding the website search result rank is capable of displaying the product information of the supplier who succeeds in biding in the position all day, thereby ensuring the promotion effect of the supplier; the method is to sort a plurality of binding results in such a manner of binding time in addition to a biding price, so that the supplier who offers a high price stays ahead, and the suppliers who offer the same price should obey the rule that the one who bids more early stays ahead; in this way, the rank of each biding can be obtained accurately and the rank decides the position of demonstration information displayed in a search result; and the promotion effects of the suppliers are further ensured.

Description

technical field [0001] The invention relates to a processing method for computer data retrieval results, in particular to a bidding method for ranking by website search results on a computer network. Background technique [0002] In the early years, a search engine information platform appeared on the Internet. The platform system is mainly how to quickly and accurately retrieve data under the massive amount of data, so as to guide users to obtain relevant information. In the face of a large number of retrieval results, the general retrieval results will be sorted and displayed according to the modification time of the data or in a random manner. No matter which method is used, there is no guarantee that certain weight data can be retrieved in a fixed and dominant position. show. [0003] In order to solve the above problems, a bidding ranking has emerged. At present, the bidding ranking method adopted by the search engine system is charged according to the number of clicks...

AI Technical Summary

Problems solved by technology

[0005] One is to use the number of clicks to calculate the cost, which has a big loophole. The system cannot guarantee that each click is a normal click, and there will be malicious clicks; although the existing system also has some preventive measures, but It is absolutely impossible to completely eliminate this situation, which will cause the loss of the interests of the information publishers, not only fail to achieve a real promotion effect, but also increase the cost of investment

[0006] The second is that the same price is in a random order, and if it ranks tenth, only one of the many publishers with the same price will be randomly displayed, so that the promotion interests of other publishers cannot be guaranteed.

Images