Dynamic Document Rank Score Update via Partial Recalculation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Web search systems face challenges in promptly updating document scores to reflect changes, additions, and deletions on the dynamic World Wide Web, leading to suboptimal user satisfaction due to the need for frequent and comprehensive recalculations of content-based and link-based scores.
Innovation Solution
A partial update method and apparatus that recalculates document rank scores only for changed, added, or deleted content, using a processor to determine term relationship scores and contribution scores based on common keywords, allowing for dynamic updates to reflect changes in the web environment.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the web search system performs comprehensive recalculations of document scores at regular intervals, then the document scores are updated systematically, but the system cannot promptly reflect changes in the dynamic web environment
Solution Approach 1:
The system pre-calculates and stores term relationship scores for all documents in the web environment before search queries are submitted. When a document changes, the system has already prepared the foundational score data, enabling rapid updates by only recalculating affected documents rather than performing comprehensive recalculations, thus reducing time delay while maintaining accuracy
Solution Approach 2:
The document score calculation is divided into independent term relationship score calculations for individual documents. Each document's term relationship score can be calculated and updated independently, allowing the system to selectively update only those documents that have changed rather than recalculating all documents, thereby promptly reflecting web changes without sacrificing overall score accuracy
2Reliability
If the web search system recalculates document scores frequently to reflect web changes, then user satisfaction improves, but system resource consumption increases
Solution Approach 1:
The system performs partial recalculations only for documents that have actually changed, rather than recalculating all documents frequently. By identifying and updating only the affected subset of documents (those with content changes, additions, or deletions), the system maintains high search result quality while significantly reducing computational resource consumption compared to full system recalculations
Solution Approach 2:
The system automatically detects document changes in the web environment and triggers selective recalculations only for affected documents. This self-service mechanism ensures search result quality is maintained by promptly reflecting changes, while avoiding unnecessary computational resource consumption on documents that have not changed
3Reliability
If the web search system updates all document scores whenever any document changes, then search results remain highly relevant, but the complexity of the update mechanism increases
Solution Approach 1:
The update system is segmented to identify and process only affected documents based on change detection. When a document changes, the system calculates which specific term relationship scores need updating and processes only those, rather than updating all document scores. This maintains search result relevance while reducing update mechanism complexity by avoiding unnecessary updates to unaffected documents
4Reliability
If the web search system performs full recalculations at regular intervals, then comprehensive document scores are maintained, but the response time to reflect web changes is slow
Solution Approach 1:
The system pre-calculates term relationship scores for all documents and stores them as foundational data. When changes occur in the web environment, the system can rapidly update only the affected document scores using this pre-prepared data, rather than performing comprehensive recalculations from scratch. This maintains document score comprehensiveness while dramatically improving update speed
Solution Approach 2:
Instead of performing full recalculations, the system performs partial recalculations only for documents that have changed. By identifying the minimal subset of documents requiring updates and processing only those, the system maintains comprehensive and accurate document scores while achieving fast update speeds that reflect web changes in near real-time
Data Source
AI summary
Exemplary embodiments of the present invention relate to a method and apparatus for calculating a document rank score of documents in the dynamic World Wide Web (web) environment where documents are continuously added and deleted. The method and apparatus use partial updates to recalculate a document rank score of documents in view of a change, and dynamic updates that reflect a change occurring during calculation of the document rank score.