Search Result Matching via Pseudo-Browsing for Privacy
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Search engines often fail to return consistent results for queries that seek similar information due to differences in wording, and they also pose a risk to user privacy by gathering and processing personal information from search queries.
Innovation Solution
A system that analyzes and compares search result sets from different queries to identify synonymous queries, merging similar results and using a pseudo-browser application to protect user privacy by providing decoy information and simulating user interactions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If search engines use text-matching methodologies to return search results, then queries with different wording can return different results, but this fails to provide consistent results for synonymous queries
Solution Approach 1:
The system performs preliminary actions by collecting and storing result sets from multiple queries before they are needed for comparison. Result sets are pre-computed and stored in a database, allowing future queries to be answered by comparing against these pre-collected results rather than performing full text-matching analysis at query time.
Solution Approach 2:
The system creates copies of search result sets and stores them in a database for future comparison. Instead of re-analyzing original queries, the system works with copied result sets that can be efficiently compared using set theory operations to identify synonymous queries and provide consistent results.
2Adaptability or versatility
If search engines gather and process information from user search queries to construct preference profiles, then marketing and personalization can be improved, but user privacy is compromised
Solution Approach 1:
The system introduces an intermediary layer that processes queries and results without storing or analyzing personal user information. The focus is on the objective similarity of result sets rather than user preferences, acting as a mediator between the user's private query and the public search results, thereby protecting user privacy while still enabling consistent result delivery.
Solution Approach 2:
The system extracts only the essential elements needed for result comparison (the result sets themselves) while deliberately excluding personal user information from storage and analysis. By taking out only what is necessary for the core function of providing consistent results, the system avoids collecting sensitive user data that would compromise privacy.
Data Source
AI summary
A computer search system compares search results received for searches falling within a defined parameter envelope used for grouping search requests. The parameter envelope may be defined by various parameters, for example, time of search, origin or search request, language, or other non-keyword data associated with each search request, excluding keywords used to define the search. Each new search result (comprising a list of search hits) for incoming search requests is compared to stored search results for search requests within the same parameter envelope. Search results that are found to be similar based on a pre-defined similarity measure are provided as related search results responsive to the incoming search requests. A client-side pseudo-browsing application may control interactions with the search engine, collecting true browsing input from the client and providing pseudo-browsing information to the search engine or other information provider.