TWI497322B - The method of determining and using the method of web page evaluation - Google Patents

Description

Method and system for determining and using webpage evaluation value

The invention relates to information processing technology, and particularly relates to a method and system for determining and using webpage evaluation values by using a computer.

The search engine crawls the webpage from the Internet. When the user queries, it finds all the webpages that satisfy the user's keywords, and then sorts by relevance, so that the search results in front of the search are more in line with the user's needs. Since correlation is a very complex result calculated based on many parameters, there are technical solutions for calculating correlation using various algorithms and parameters, and generally, parameters used by various search engine vendors. And algorithms are also different.

For example, in 1997, Google proposed the Page rank parameter that improves the correlation algorithm and the algorithm for calculating this parameter. It is possible to understand the Page rank in this way. The landing page of important web pages will get important weights. The more pages that are important to the web page, the higher the page rank, the more important it is.

Existing search engines generally do not solve well when dealing with the sorting of content class query words. The focus is reflected in the following two points:

1. Using the external chain to calculate the Page rank to determine the important webpages basically does not work, resulting in the results ranked in front of the search results, is largely not the result that users most want to see.

2. Existing search engines typically use weight-receiving techniques to process web pages of the same or nearly identical content. For example, when a webpage is crawled, some webpages with duplicate content are not stored, or after receiving a user search request, some webpages whose content is duplicated are not displayed or the content is ranked behind the search result. If there is no suitable link data, the search engine may ignore or post the original page according to the Page rank algorithm, and the reprinted page is ranked first. Therefore, the existing search engine does not take into account the impact of different web pages with the same content on the ranking of results.

The invention provides a method and a system for determining and using a webpage evaluation value by using a computer, so as to improve the feedback accuracy of the query result.

The embodiment of the present invention provides a method for determining a webpage evaluation value by using a computer, comprising the steps of: obtaining a webpage having the same or nearly the same content from a search engine server system; and the search engine server system determines the webpage of the webpage. And generating a time and a first evaluation value; the search engine server system determines, according to the first evaluation value of each webpage, a second evaluation value of the webpage with the earliest generation time.

Preferably, the webpage having the same or nearly the same content includes a webpage with the same digit fingerprint.

Preferably, the obtaining the webpage having the same or nearly the same content comprises: obtaining the longest paragraph of the non-first paragraph and the non-last paragraph of each webpage or the longest sentence of the non-first sentence and the non-last sentence of the paragraph. And generating a digital fingerprint; determining, according to the digital fingerprint, whether the content of each webpage is the same, and obtaining a webpage having the same or nearly the same content.

Preferably, the determining the generation time of each webpage comprises one or a combination of the following manners: determining according to a time included in the webpage uniform resource locator URL; determining according to time in the content category webpage; Time determination; determined based on the time when the web page was first indexed.

Preferably, the second evaluation value is greater than the first evaluation value.

Preferably, the second evaluation value is a product of a sum of a first evaluation value of a webpage having the same or nearly the same content as the webpage with the earliest generation time and a first weighting coefficient plus the earliest generation time The product of the first evaluation value of the web page and the second weighting coefficient.

Preferably, the first weighting coefficient is the same as or different from the value of the second weighting coefficient.

Preferably, the first evaluation value is an evaluation value formed based on data including an outer chain.

The present invention also provides a method for sorting search query results according to webpage evaluation values, comprising the steps of: obtaining query results after querying from a search engine server system; and searching engine server system according to first evaluation values of each webpage and The second evaluation value of the web page that produces the earliest time sorts the query results.

Preferably, the method further includes: the search engine server displays the number of reprints of each webpage in the query result.

The present invention also provides a method for sorting webpage search query results by using a computer, comprising the steps of: acquiring webpages having the same or nearly the same content from a search engine server system; and the search engine server system determining the webpages The generation time of the search engine server system is sorted according to the order in which the respective web pages are generated.

Preferably, the method further includes: the search engine server system sorts according to the generation time of the webpages and the external link data.

The present invention provides a search engine server system, including: a crawler system for acquiring web pages having the same or nearly the same content; an indexing system for determining the generation time of each web page and the first evaluation value of each web page, and A second evaluation value of the web page with the earliest generation time is determined according to the first evaluation value of each web page.

Preferably, the indexing system is further configured to determine whether each webpage has the same or nearly the same content according to the digital fingerprint of the webpage.

Preferably, the indexing system comprises: a digital fingerprint generating unit, configured to obtain the longest sentence of the non-first sentence and the non-last sentence of the non-first segment and the non-last segment of each webpage, and the longest sentence of the non-first sentence and the non-last sentence, and And generating a digital fingerprint; the comparing unit is configured to determine whether the content of each webpage is the same according to the digital fingerprint; and the acquiring unit is configured to obtain, according to the digital fingerprint, whether the webpage content is the same, and obtain the webpage having the same or nearly the same content.

Preferably, the indexing system is further configured to determine a webpage generation time according to one or a combination of the following manners: a time when the webpage uniform resource locator URL is included; a time in the content category webpage; a time of crawling the webpage; The time of the income index.

Preferably, the indexing system is further configured to determine, according to the first evaluation value of each webpage, that the second evaluation value of the webpage with the earliest generation time is the same as the webpage with the earliest generation time Or the product of the sum of the first evaluation values of the web pages close to the same content and the first weighting coefficient plus the product of the first evaluation value and the second weighting coefficient of the web page of the earliest generation time.

Preferably, the indexing system is further configured to determine a first evaluation value of each webpage based on the evaluation value formed by the data including the other webpage pointing.

Preferably, the indexing system is further configured to sort the query results according to the first evaluation value and the second evaluation value of each webpage.

Preferably, the indexing system is further configured to display the number of reprints of each webpage in the query result.

The present invention also provides a search engine server system, comprising: a crawler system for acquiring web pages having the same or nearly the same content from a search engine server system; and a search engine server for searching the engine server system for determining The generation time of each web page is described, and the order is sorted according to the order in which the web pages are generated.

Preferably, the search engine server is further configured to sort according to the generation time of the webpages and the external link data.

The advantageous effects of the present invention are as follows: in the implementation of the present invention, webpages having the same or nearly the same content are first obtained; then, the generation time and evaluation value of each webpage are determined; and finally, the webpage with the earliest generation time is determined according to the evaluation value of each webpage. The assessed value.

In the scheme, by considering whether the webpage is original or not by the parameter of the generation time, the scheme for judging the actual evaluation value of the webpage based on the generation time is determined, thereby overcoming the calculation of the page rank to determine the important webpage by using the outer chain. In the case of the way, the result that is ranked in front of the search results does not represent the problem of its evaluation value.

Further, the relationship between the evaluation values between different web pages with the same content is fully utilized, and is used to improve the ranking of the search results, thereby improving the accuracy of the query result feedback.

The specific embodiments of the present invention will be described below with reference to the accompanying drawings.

The inventor noticed during the invention:

1. Content-based web pages tend to have few external links. Therefore, the use of external links to calculate Page ranks to determine important web pages basically does not work, resulting in results that are ranked in front of search results, and are largely not what users want most. The result.

2. For different web pages with the same content, the search engine treats them as a negative factor in the search results, either thrown away by the search engine or the page rank is lowered. But in fact, these different pages with the same content have a very important role in improving the ranking of search results.

In view of this, the present invention proposes a technical solution for adding a new and important sorting parameter to the ranking of the search engine and greatly improving the search result of the content query word. The satisfaction of the query results of the articles found in the web search is greatly improved. The following describes the implementation manner of determining the evaluation value of the webpage, and describes the implementation manner of applying the evaluation value of the webpage to returning the query result to improve the search accuracy.

In the implementation, by using Google's concept of evaluating the importance of a page, the evaluation value of the page is called Copy rank, which represents a parameter and generation for improving the relevance ranking of the search engine. The algorithm of this parameter is suitable for sorting the search results of the optimized content class query. It uses the number of reprints of articles on the Internet, calculates the copy rank of the original web page, and aggregates the reprinted web pages. When calculating the relevance, the search engine calculates a new relevance value by combining the parameters of the traditional calculation relevance such as page rank and keyword matching degree with the Copy rank. When the search engine displays the results, the number of reprints is also displayed to help the user quickly determine the best results on the Internet that match the query.

Figure 1 is a schematic diagram of the effect of Copy Rank in the search engine results. The search results, the more versions (reloads), the more likely the article is the user wants to see.

The determination of the Copy Rank mainly includes three factors, one is to judge whether the content of the webpage is basically the same; the second is to judge the real release time of the webpage; the third is to judge who is the original webpage, and the following description is made.

2 is a schematic flowchart of a method for determining a method for determining a webpage value. As shown in the figure, when determining the value of the evaluation, the method may include the following steps: Step 201: Obtain a webpage having the same or nearly the same content from the search engine server system; 202. The search engine server system determines a generation time of each webpage and a first evaluation value. Step 203: The search engine server system determines, according to the first evaluation value of each webpage of the same or nearly the same content, the first webpage with the earliest generation time Second evaluation value.

In implementation, in step 201, a web page having the same or nearly the same content includes a web page having the same digit fingerprint.

The obtaining the webpage with the same or nearly the same content may include: obtaining, from the search engine server, the longest paragraph or paragraph of the non-first and non-last segments of each webpage, the longest non-first sentence and the non-last sentence Sentences, and generate MD5; according to the digital fingerprint to determine whether the content of each web page is the same, then obtain web pages with the same or nearly the same content.

MD5 is an abbreviation of message-digest algorithm 5, which is widely used in encryption and decryption technology. It can be said to be the "digital fingerprint" of files. Any file, whether it is an executable program, an image file, a temporary file or any other type of file, and no matter how large it is, has only one unique MD5 information value, and if the file has been modified, it The MD5 value will also change. Therefore, in the implementation, the MD5 can be used to determine whether the content of each webpage has the same or nearly the same content, that is, whether the file is "tampered" by comparing the MD5 value of the same file. The role of MD5 is: After downloading the file, if you want to know whether the downloaded file and the original file of the website are the same, you can make an MD5 check for the downloaded file. If the MD5 value obtained is the same as that published on the website, you can confirm that the downloaded file is complete. If it is different, the file you downloaded is incomplete: either an error occurred during the download process or the file has been modified. Generally, the regular website will provide the file md5 check code.

To determine whether the content of the webpage is the same, the specific method may be to find the middle longest paragraph of the non-first paragraph and the non-last paragraph in all the article-type webpages, and generate MD5 as the webpage fingerprint as the basis for judging the same. For an article with only two paragraphs, the longest sentence of the non-first sentence and the non-last sentence is taken, and MD5 is generated as the webpage fingerprint as the basis for judging the same. If the webpage fingerprints of the two webpages are the same, then the entire content of the two webpages is the same.

In the specific implementation, searching for the longest paragraph in the middle of the non-first and non-last paragraphs, and taking the longest sentence of the non-first sentence and the non-last sentence of the paragraph to generate MD5 as the webpage fingerprint is because the inventor noticed during the invention: usually The first and last paragraphs, the first sentence and the last sentence are frequently changed and do not represent the actual content of the article. Therefore, non-first and non-last paragraphs, non-first sentences and non-last sentences are used to generate MD5. .

In the implementation, it can be judged by MD5 whether the two files are the same. It is easy for those skilled in the art to know that when the webpages having the same or nearly the same content are acquired in step 201, it is not limited to determining that the content is consistent through MD5. In other ways, other technical means that can compare the content of the two web pages can be used. The ultimate goal is that when there are different web pages with the same content, they will not be thrown away directly as a negative factor that interferes with the search results. It is used to improve the ranking of search results.

In step 202, determining the time of generation of the webpage may include: determining the webpage generation time according to the time in the webpage-based webpage according to the time included in the webpage uniform resource locator URL.

In the implementation, the actual release time of the webpage can be obtained by means of computer program extraction. Since the web pages of most websites are dynamically generated, the Last-modified field returned by the web server has no meaning, so the time can be extracted from the body of the web page. The extraction time can be as follows: First, determine whether the URL contains time. For example, the URL (Uniform Resource Locator) in the following example contains time: http://news.sina.com.cn /w/2009-01-15/184017052431.shtml; Then it is possible to extract 2009-01-15 through the program. In the implementation, the specific extraction means may include: A, enumerating the commonly used time format, and establishing a time format dimension table for storing the commonly used time format; B, segmenting the URL according to the separator; C, the segmentation Each part is queried in the time format dimension table. If it matches the time format in the dimension table, it means that the time contains the time, and the time can be extracted.

If there is no time in the URL, it is taken from the body of the article. There are many kinds of time formats in the body of the article. In the implementation, as long as the computer program is considered according to the actual situation, you can find the time as soon as possible. As in the example below, the text in the article contains time:

January 15, 2009, 18:40 China Net

December 27, 2009 23:35

It is easy to extract 23:35 on December 27, 2009 through the program.

In the implementation, in the specific implementation means, the code can be obtained by analyzing the code of various time and date formats in the webpage, and using any program method such as regular expression matching. If the program cannot determine the generation time, the current crawl time is taken as the generation time. Regardless of how the calculation generation time is implemented in the implementation, the purpose is to use the acquisition generation time to identify the original version of each reprinted web page.

In the implementation, the time can be judged when the webpage is crawled and the index of the webpage is established, and the generation time is stored in a field of the webpage index (FIELD).

In the implementation, when there is a situation in which the time of generation cannot be extracted from the article or the URL, the time of crawling the webpage may be used as the generation time, or the time of the earliest income index may be assumed as the article generation time.

After determining the webpage with the same content and the time of its generation by the above manner, it can be determined who is the original webpage, that is, in all the same webpages, the webpage with the earliest real release time is the original webpage.

The evaluation values in step 202 will be described below.

First, the Page Rank is explained to better understand the Copy Rank defined in the present invention. Page Rank is the evaluation value of Google's evaluation of the importance of a web page, which is Page Rank, not "Site Rank". )", not an evaluation of the entire site. If the Page Rank of a website's homepage is 5, it just means that the Page Rank of the page on the front page is 5, instead of saying that the entire website is 5. Google's Page Rank is not for the website, only for the page, one page.

The Page Rank value of a page comes mainly from the pages represented by all the links pointing to this page. The so-called "all links" consists of two parts: the external links outside the website and the internal links of other pages within the website. In other words, the Page Rank value of any page is generated by the interaction of the external link and the internal link. It is not just the unilateral role of an external link or only an internal link. Suppose a homepage of a website has two external pages with a Page Rank of 5, and there are more internal links pointing to the home page, so that the page rank of the home page is 5.

By the same token, in the implementation of the present invention, when the evaluation value of the webpage with the earliest generation time is determined according to the evaluation value of each webpage of the same or nearly the same content in step 203, the second evaluation value can be determined to be the earliest generation time. The product of the sum of the first evaluation values of the web pages having the same or nearly the same content and the first weighting coefficient plus the product of the first evaluation value and the second weighting coefficient of the web page of the earliest generation time.

That is to say, Copy Rank makes the original web page get the weight of all reprinted web pages, that is, Copy Rank can be calculated as follows:

Copy Page of the original page = Page Rank*w1 of each reprinted page + Page Rank*w2 of the original page; where W1 and W2 are weighting coefficients, the values of W1 and W2 can be set according to the needs in the implementation, and W1 and W2 The values can be the same or different.

It should be noted that, in the embodiment of the present invention, the evaluation value is used to describe the Page Rank. However, the evaluation value formed according to the data including other webpage pointers can be used for implementation.

In addition, in the implementation, the Copy Rank can be generated after the webpage is crawled, and the CopyRank of all the webpages can be updated regularly.

In the implementation, when determining the original webpage, a website blacklist and/or whitelist may be established based on historical data or experience. The webpage belonging to the whitelisted website is assumed to be an original webpage, and the webpage belonging to the blacklisted webpage is assumed to be non-original. Web page.

Figure 3 is a schematic diagram of the relationship between the reprinted webpage and the original webpage Copy Rank. As shown in the figure, the weight of the evaluation value of the external webpage to all the reprinted webpages is given to the original webpage, which is equivalent to the evaluation value of the outer links of these webpages from the outside. Both gave original pages.

4 is a schematic flowchart of a method for performing a method for sorting query results according to a webpage evaluation value. As shown in the figure, in the implementation process of using a webpage evaluation value to return a query result to improve search accuracy, the following steps may be included: Step 401: Obtaining the query result after the query from the search engine server system; step 402, the search engine server system obtains the webpage having the same or nearly the same content in the query result; and step 403, the search engine server system determines the generation time of each webpage And the first evaluation value; step 404, the search engine server system determines, according to the first evaluation value of each webpage, a second evaluation value of the webpage with the earliest generation time; step 405, according to the first evaluation value and the second evaluation value of each webpage Sort the query results.

In the implementation of step 405, the search engine server system may sort the queried web pages according to the evaluation value, for example, sorted by the evaluation value and then returned and displayed to the queried user.

Further, the search engine server system can also display the number of reprints of each web page in the query result.

Based on the same inventive concept, the search engine server system is further provided in the embodiment of the present invention. Since the principle of the system solving problem is similar to the method for determining the evaluation value of the webpage and the method for returning the query result according to the evaluation value of the webpage, the implementation of the system may be See the implementation of the method, and the repetition will not be repeated.

5 is a schematic structural diagram of a search engine server system. As shown in the figure, the search engine server system may include: a crawler system 501 for acquiring web pages having the same or nearly the same content; and an indexing system 502 for determining each The generation time of the webpage and the first evaluation value of each webpage, and determining the second evaluation value of the webpage with the earliest generation time according to the first evaluation value of each webpage.

In an implementation, the indexing system may be further configured to determine whether each webpage has the same or nearly the same content according to the MD5 of the webpage.

The webpage obtaining module may include: an MD5 generating unit, configured to obtain a longest sentence of a non-first segment and a non-final segment of each webpage, or a longest sentence of a non-first sentence and a non-last sentence, and generate an MD5; And a comparing unit, configured to determine, according to the MD5, whether the content of each webpage is the same; the acquiring unit, configured to obtain, according to the MD5, whether the content of each webpage is the same, and obtain a webpage having the same or nearly the same content.

In an implementation, the indexing system can be further configured to determine the webpage generation time based on the time contained in the webpage URL and/or based on the time in the content category webpage.

In an implementation, the indexing system may be further configured to: when determining, according to the first evaluation value of each webpage, the second evaluation value of the webpage with the earliest generation time, determining that the second evaluation value is the same as the webpage with the earliest generation time or The sum of the first evaluation values of the web pages close to the same content and the first weighting coefficient The product of the first evaluation value of the web page with the earliest generation time and the second weighting coefficient.

In an implementation, the indexing system may further be configured to determine a first evaluation value of each webpage according to the evaluation value formed by the data including the outer chain.

The indexing system can also be configured to sort the query results according to the first evaluation value and the second evaluation value according to each web page.

In the implementation, the indexing system may further be used to display the number of reprints of each webpage in the query result.

6 is a schematic diagram of an operating environment structure of a search engine server system. As shown in the figure, the network 600 includes an indexing system 601 and a webpage 602 for sorting query results according to webpage evaluation values (representing various entities that generate webpages, specific The webpage can be represented by a server or the like. In the embodiment, the webpage is used to refer to such an entity for the convenience of description. At the same time, there may be many such entities, and only one is shown in the figure, and the client 603 (only used in the figure) A schematic), crawler system 604, query system 605.

It can also be seen from the figure that the indexing system 601 and the crawler system 604 also constitute a search engine server system. It should be noted that the connection manner of each functional entity in the figure is through a network connection, and a direct connection represented by a straight line, however, The figure is only a schematic diagram. In actual implementation, the network architecture can be implemented according to actual needs. For example, the crawler system and the index system are connected through the Internet, instead of the local area network connection, as long as the data can be realized between the entities. The invention can be implemented in an interactive manner.

In implementation, the web page 602 provides various web page content, and the crawler system 604 can collect various web page information on the network and store the web page information on one or more servers. The indexing system 601 in the present invention builds an index based on the collected webpage information to quickly process the query request. The indexing system 601 can also determine the first evaluation value and the second evaluation value of the webpage, and perform sorting of the webpage according to the first evaluation value and the second evaluation value. The sorting may be performed immediately after the crawler system collects the webpage information, or may be performed after receiving the query request from the user terminal, which is not limited by the present invention.

When the user 603 queries through the network to the query system 605, the query system 605 can return the information required by the user terminal 603 according to the sorting result of the sorting device 601, so that the query results obtained by the user are accurately sorted and can be true. The relationship between the query results is reflected.

It can be seen from the above embodiment that the present invention uses the number of times the content is reprinted and the Copy Rank value calculated based on the reprint, and the Copy rank is a parameter that can improve the ranking of the search engine relevance, and is suitable for optimizing the content class. Sort the search results of the query. The number of reprints of articles on the Internet can be used to calculate the copy rank of the original webpage, and the reprinted webpages are aggregated. Therefore, when the search engine calculates the relevance, it can synthesize the data such as the page rank based on the data including the outer chain. The value of the traditional calculation correlation, such as the evaluation value and the keyword matching degree, together with the Copy rank, calculates a new correlation value. When the search engine displays the result, the number of reprints is also displayed to help the user to judge the Internet as quickly as possible. Query the best results of the word, thus improving the accuracy of the results returned by the search engine. As is known to those skilled in the art, the search engine includes a webpage search engine, a picture search engine, a software search engine, and the like. The technical solution of the present invention can improve the accuracy of the search engine results, including the impact on the sorting order of the search results (making the number of reprints more High results are ranked first), including the impact on the search results interface (displays the number of reprints on the results page, prioritizes the original content on the results page).

In the embodiment of the present invention, a new important sorting parameter is added to the ranking of the search engine, and the search result effect of the content query word is greatly improved, so that the user can find the query result of the article in the webpage search with a large satisfaction degree. improve.

For the convenience of description, the various parts of the above described devices are separately described by functions into various modules or units. Of course, the functions of the modules or units can be implemented in the same or multiple software or hardware in the practice of the present invention.

FIG. 7 is a schematic flowchart of a method for sorting webpage search query results by using a computer. As shown in the figure, when sorting, the method may include the following steps: Step 701: Obtaining the same or nearly the same content from the search engine server system. Step 702: The search engine server system determines the generation time of each webpage; and step 703, the search engine server system sorts according to the order in which the webpages are generated.

Further, the method may further include: the search engine server system sorts according to the generation time of the webpages and the external link data.

8 is a schematic structural diagram of a search engine server system, as shown, including: a crawler system 801 for acquiring web pages having the same or nearly the same content from a search engine server system; a search engine server 802 for searching The engine server system determines the generation time of each webpage, and sorts according to the order in which the webpages are generated.

The search engine server 802 can be further configured to sort according to the generation time of the web pages and the external link data.

Those skilled in the art will appreciate that embodiments of the present invention can be provided as a method, system, or computer program product. Thus, the present invention can take the form of a fully hardware embodiment, a fully software embodiment, or an embodiment combining soft and hardware aspects. Moreover, the present invention can take the form of a computer program product embodied on one or more computer usable storage media (including but not limited to disk memory, CD-ROM, optical memory, etc.) including computer usable code.

The present invention has been described with reference to flowchart illustrations and/or block diagrams of a method, apparatus (system), and computer program product according to embodiments of the invention. It will be understood that each flow and/or block of the flowcharts and/or <RTIgt; These computer program instructions can be provided to a processor of a general purpose computer, a special purpose computer, an embedded processor or other programmable data processing device to produce a machine for generating instructions for execution by a processor of a computer or other programmable data processing device. A device that implements the functions specified in one or more flows of a flowchart or a plurality of flows and/or block diagrams.

The computer program instructions can also be stored in a computer readable memory that can boot a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory include the manufacture of the command device. The product, the instruction device implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.

These computer program instructions can also be loaded onto a computer or other programmable data processing device to perform a series of operational steps on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device. The instructions provide steps for implementing the functions specified in one or more flows of the flowchart or in a block or blocks of the flowchart.

Although the preferred embodiment of the invention has been described, it will be apparent to those skilled in Therefore, the scope of the appended claims is intended to be construed as a

It will be apparent that those skilled in the art can make various modifications and variations to the invention without departing from the spirit and scope of the invention. Thus, it is intended that the present invention cover the modifications and the modifications thereof

501‧‧‧Reptile system

502‧‧‧ Index System

601‧‧‧ indexing system

602‧‧‧Webpage

603‧‧‧User side

604‧‧‧Reptile system

605‧‧‧Query System

801‧‧‧Reptile system

802‧‧‧Search Engine Server

FIG. 1 is a schematic diagram of an effect of an Copy Rank in a search engine result according to an embodiment of the present invention; FIG.

2 is a schematic flowchart of a method for determining a method for determining a webpage value according to an embodiment of the present invention; FIG. 3 is a schematic diagram of a relationship between a reprinted webpage and an original webpage Copy Rank according to an embodiment of the present invention; and FIG. 4 is a query according to a webpage evaluation value according to an embodiment of the present invention; FIG. 5 is a schematic structural diagram of a search engine server system according to an embodiment of the present invention; FIG. 6 is a schematic diagram of an operating environment structure of a search engine server system according to an embodiment of the present invention; A schematic diagram of a method for implementing a method for sorting webpage search query results by using a computer; FIG. 8 is a schematic structural diagram of a search engine server system according to an embodiment of the present invention.

Claims (16)

A method for determining a webpage evaluation value by using a computer, comprising: acquiring a webpage having the same or nearly the same content from a search engine server system; the search engine server system determining a generation time of the webpage And a first evaluation value; the search engine server system determines, according to the first evaluation value of each webpage, a second evaluation value of the webpage with the earliest generation time, wherein the second evaluation value is the same as the webpage with the earliest generation time Or the product of the sum of the first evaluation values of the web pages close to the same content and the first weighting coefficient plus the product of the first evaluation value and the second weighting coefficient of the web page of the earliest generation time. The method of claim 1, wherein the webpage having the same or nearly the same content comprises a webpage having the same digit fingerprint. The method of claim 2, wherein the obtaining the webpage having the same or nearly the same content comprises: obtaining the longest paragraph or paragraph of the non-first segment and the non-last segment of each webpage is not the first The longest sentence of the sentence and the last sentence, and produces a digital fingerprint; obtain a web page with the same or nearly the same content according to whether the digital fingerprint is the same or not. The method of claim 1, wherein the determining the time of generation of the webpages comprises one or a combination of the following: Determined according to the time included in the webpage uniform resource locator URL; determined according to the time in the content category webpage; determined according to the time of crawling the webpage; determined according to the time when the webpage is first indexed. The method of claim 1, wherein the second evaluation value is greater than the first evaluation value. The method of claim 1, wherein the first weighting coefficient is the same as or different from the value of the second weighting coefficient. The method of any one of claims 1 to 6, wherein the first evaluation value is an evaluation value formed based on data including an outer chain. A method for sorting search query results according to the webpage evaluation value according to any one of claims 1 to 7, characterized in that the method comprises the following steps: obtaining the query result after the query from the search engine server system; The search engine server system sorts the query results according to the first evaluation value of each webpage and the second evaluation value of the webpage with the earliest generation time. The method of claim 8, further comprising: the search engine server system displaying the number of reprints of each web page in the query result. A search engine server system, comprising: a crawler system for acquiring web pages having the same or nearly the same content; an indexing system for determining the generation time of each web page and the number of each web page An evaluation value, and determining, according to the first evaluation value of each webpage, a second evaluation value of the webpage with the earliest generation time, wherein the indexing system is further configured to determine, according to the first evaluation value of each webpage, the second webpage of the earliest generation time When evaluating the value, determining that the second evaluation value is the product of the sum of the first evaluation values of the webpage having the same or nearly the same content as the webpage with the earliest generation time and the first weighting coefficient plus the webpage of the earliest generation time The product of the first evaluation value and the second weighting coefficient. The search engine server system of claim 10, wherein the indexing system is further configured to determine whether each webpage has the same or nearly the same content according to the digital fingerprint of the webpage. The search engine server system of claim 10, wherein the indexing system comprises: a digital fingerprint generating unit, configured to obtain a paragraph or paragraph having the longest middle content of each of the non-first and non-last segments of each webpage. The longest sentence that is not the first sentence and the last sentence, and generates a digital fingerprint; the comparing unit is configured to determine whether the content of each webpage is the same according to the digital fingerprint; and the obtaining unit is configured to determine whether the content of each webpage is the same according to whether the digital fingerprint is the same or not, Get web pages with the same or nearly the same content. The search engine server system of claim 10, wherein the indexing system is further configured to determine a webpage generation time according to one or a combination of the following manners: a time when the webpage uniform resource locator URL is included; The time in the content class page; the time the page was crawled; the time when the page was first indexed. The search engine server system according to any one of claims 10 to 13, wherein the indexing system is further configured to determine a first evaluation of each webpage based on an evaluation value formed by including other webpage pointing data. value. The search engine server system of claim 10, wherein the indexing system is further configured to sort the query results according to the first evaluation value and the second evaluation value of each webpage. The search engine server system of claim 15, wherein the indexing system is further configured to display the number of reprints of each webpage in the query result.