Meta-Search Redirection via Database Lookup
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing meta-search engine technologies face challenges in ensuring short response times for search queries processing large volumes of data, leading to long URLs that increase bandwidth and processing power requirements, and potential security issues due to visible search criteria, as well as inconsistencies in search results when re-processing search criteria.
Innovation Solution
A method involving a meta-search server that receives search queries, retrieves results from multiple service providing servers, assigns unique identifiers to search results, and generates a redirection link for selected results, allowing direct access to the service providing server for further processing, reducing the need for re-processing search queries and enhancing security by encrypting identifiers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If search results are re-processed by generating new URLs with search criteria, then the service providing server can retrieve results, but the URL length increases and bandwidth consumption increases
Solution Approach 1:
The patent extracts the essential identification information (search criteria and result identifiers) from the complex URL structure and stores it in a database. The URL is replaced with a compact reference that links to the stored search result data, eliminating the need for long URLs while maintaining the ability to retrieve and re-process search results accurately.
Solution Approach 2:
The patent introduces a database as an intermediary between the search result and the URL. Instead of embedding all search criteria directly in the URL, the system stores search results in a database with unique identifiers, and the URL becomes a simple reference to this stored data. This mediator (database) resolves the contradiction by enabling accurate retrieval without requiring long URLs.
2Ease of operation
If search criteria are included in the URL for redirection, then the service providing server can process the query, but security issues arise due to visible search criteria
Solution Approach 1:
The patent extracts sensitive search criteria from the URL and stores it securely in a database. The URL contains only non-sensitive reference identifiers, while the actual search parameters are kept in the protected database environment. This extraction eliminates security vulnerabilities while preserving the redirect functionality through database lookups.
Solution Approach 2:
The database acts as a secure intermediary that handles sensitive search criteria. Instead of exposing search parameters in the URL, the system uses the database as a mediator to store and retrieve search results based on secure internal references. This mediator protects sensitive information while maintaining ease of operation through automated database queries.
3Adaptability or versatility
If search queries are re-processed to retrieve results, then the service can be generalized, but computational resources and processing time increase
Solution Approach 1:
The patent applies preliminary action by storing search results in a database with unique identifiers before they are needed for retrieval. When a user requests a search result, the system performs a quick database lookup using the stored identifier rather than re-processing the entire search query. This preliminary storage and indexing enables fast retrieval while maintaining the ability to handle various search types through the standardized database interface.
Solution Approach 2:
The patent creates a copy of the search result data and stores it in a database with a unique identifier. Instead of re-processing the original search query, the system retrieves the pre-computed results from the database copy. This copying approach maintains service versatility for different search types while dramatically improving response time by avoiding redundant computation.
4Adaptability or versatility
If multiple search engines are queried through a meta-search engine, then search coverage is improved, but the complexity of result management increases
Solution Approach 1:
The patent merges results from multiple search engines into a unified database structure with standardized unique identifiers. Instead of managing separate result sets from different search engines, the system combines them into a single database with consistent indexing and retrieval mechanisms. This merging approach maintains broad search coverage while simplifying result management through centralized database operations.
Solution Approach 2:
The patent creates a universal database structure that can store and manage search results from multiple different search engines through a common interface. The standardized unique identifier system and unified retrieval mechanism allow the same database infrastructure to handle diverse search sources, reducing complexity while maintaining versatility and broad search coverage across multiple engines.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The subject disclosure relates to methods, servers, and computer program product for processing search queries in a distributed database system. For example, a method for processing search queries in the distributed database system is provided. The method includes receiving, at a meta-search server, a first search query from a client; retrieving, from a plurality of service providing servers, search results matching the first search query; storing the search results associated with corresponding unique identifiers in a search result database; and returning, by the meta-search server, the search results to the client. The method further comprises generating, by the meta search server in response to receiving a second search query from the client indicating at least one selected search result of the search results, a redirection link identifying the service providing server from which the at least one selected search result was retrieved and including the unique identifier corresponding to the at least one selected search result; and redirecting, by the meta-search server using the redirection link, the client to the service providing server identified in the redirection link to retrieve, from the search result database, the at least one stored search result using the unique identifier included in the redirection link for processing the second search query.