Web Crawler Scheduling via Popularity Decay Prediction

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current web crawling technologies are unable to efficiently prioritize newly created web resources based on their popularity and decay rate, leading to suboptimal crawling schedules that do not account for the varying importance of web pages.

Innovation Solution

A method and system that utilize a machine learning algorithm to predict the popularity and decay rate of newly created web pages, determining a crawling benefit parameter that prioritizes pages with higher predicted popularity and decay rates, thereby re-ranking web pages in the crawling queue.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If a crawling schedule is followed to visit web resources, then the crawler can systematically index web pages, but the crawler cannot prioritize newly created web resources based on their popularity and decay rate

Engineering Contradiction:
Improvecrawling efficiencyVSAvoidpopularity prediction accuracy
Core Design Contradiction:
ProductivityVSMeasurement precision

Solution Approach 1:

The system performs preliminary prediction of popularity and decay rate for newly created web resources before they are added to the crawling queue. By estimating these parameters in advance using machine learning models, the crawler can prioritize resources that are likely to be most important, rather than waiting for actual popularity data to accumulate over time.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system uses feedback from actual web resource usage patterns to refine the machine learning models that predict popularity and decay rate. By continuously learning from real-world data about which pages are visited most frequently and how their popularity changes over time, the prediction accuracy improves, enabling better prioritization decisions.

Inventive Principle:
Principle #23Feedback

2Reliability

If the crawler visits all web resources equally, then the crawler can ensure comprehensive coverage, but the crawler wastes resources on less important pages

Engineering Contradiction:
Improvesearch result qualityVSAvoidcomputational resource waste
Core Design Contradiction:
ReliabilityVSLoss of energy

Solution Approach 1:

The system applies different crawling strategies to different web resources based on their predicted importance. Rather than treating all pages equally, the crawler adjusts its behavior locally for each resource, prioritizing pages with high predicted popularity and low decay rates while reducing attention to less important pages. This localized differentiation improves both search quality and resource efficiency.

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The system changes the crawling parameters (such as visit frequency and priority) based on predicted popularity and decay rate parameters. By dynamically adjusting these parameters according to the predicted characteristics of each web resource, the system optimizes the balance between comprehensive coverage and efficient resource utilization.

Inventive Principle:
Principle #35Parameter changes

3Stability of the object's composition

If the crawler re-crawls frequently updated pages, then the crawler maintains up-to-date index, but the crawler increases crawling frequency for low-value updates

Engineering Contradiction:
Improveindex freshnessVSAvoidcrawling schedule optimization
Core Design Contradiction:
Stability of the object's compositionVSProductivity

Solution Approach 1:

The system predicts decay rate for web pages in advance, allowing the crawler to plan re-crawling schedules based on predicted changes rather than actual observed changes. Pages with high predicted decay rates are scheduled for more frequent re-crawling, while pages with low decay rates are crawled less frequently, optimizing the balance between index freshness and crawling efficiency.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10572550B2Method of and system for crawling a web resource
Publication Date: 2020.02.25 Y E HUB ARMENIA LLC
  • US10572550B2 patent drawing
  • US10572550B2 patent drawing

AI summary

A method for determining a crawling schedule is disclosed, the method being executable at a crawling server coupled to a first web resource server and a second web resource server. The method comprises: acquiring a first new web page associated with the first web resource server; acquiring a second new web page associated with the second web resource server; determining a first crawling benefit parameter for the first new web page, the first crawling benefit parameter being based on a predicted popularity parameter and a predicted popularity decay parameter thereof; determining a second crawling benefit parameter for the second new web page, the second crawling benefit parameter being based on a predicted popularity parameter and a predicted popularity decay parameter thereof; based on the first crawling benefit parameter and the second crawling benefit parameter, determining a crawling order for the first new web page and the second new web page.