Database Search Request Prioritization via Template Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current database search systems face challenges in efficiently handling large volumes of search requests, identifying and prioritizing legitimate requests over potentially spamming ones, and managing resource allocation due to the inability to dynamically distinguish between different types of search requests in real-time.
Innovation Solution
A method and system that prioritize search requests based on attributes such as IP address, logon ID, and search scope by matching them with predefined search templates, assigning execution priorities, and scheduling requests through a workload manager to manage resource allocation and identify spamming requests.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If all search requests are processed equally without prioritization, then the system maintains simplicity in request handling, but resource consumption increases and spamming requests can overwhelm the system
Solution Approach 1:
The patent segments search requests into different priority levels based on template matching. Requests are divided into high-priority (legitimate) and low-priority (potential spam) categories, allowing differentiated resource allocation. This segmentation enables the system to focus resources on important requests while limiting resources to potentially harmful ones.
Solution Approach 2:
The system changes the parameter of request processing by introducing priority levels and execution order based on template attributes. Instead of uniform processing, requests are assigned different execution priorities (e.g., normal, elevated, deferred) based on matched template characteristics, fundamentally altering how the system handles request queues.
2Productivity
If search requests are prioritized based on template matching, then resource allocation efficiency improves and spamming is prevented, but the system complexity increases due to template management and classification mechanisms
Solution Approach 1:
The system performs preliminary actions by pre-defining search templates with associated priority levels before actual search requests arrive. Templates are created in advance with specified attributes and priority assignments, so when requests come in, they can be quickly matched against existing templates without complex real-time analysis, reducing operational complexity.
Solution Approach 2:
The patent uses copying by creating template instances that represent common search patterns. Instead of analyzing each request individually, the system copies proven successful search templates and applies them to new requests, leveraging existing knowledge to simplify decision-making and reduce computational overhead.
3Reliability
If dynamic classification of search requests is implemented in real-time, then the ability to distinguish legitimate from spamming requests improves, but the processing time and computational overhead increase
Solution Approach 1:
The system extracts only the essential attributes needed for template matching from each search request, rather than analyzing the entire request content. By taking out only the critical identifying features and comparing them against template attributes, the system achieves accurate classification with minimal processing time.
Solution Approach 2:
The patent applies partial action by performing only the necessary template matching operations required for classification, without conducting exhaustive analysis of all request parameters. The system does just enough comparison to determine priority level, avoiding excessive processing that would increase latency.
Data Source
AI summary
A method, a computer system, and a computer program product that prioritizes search requests to a database directory by assigning the search requests to one or more templates. Attributes of the search requests, such as an IP address, the portion of the database to which the search is constrained, one or more return attributes, the scope of the search, and/or search filters used, are compared with values of those attributes of the templates. The template whose values of the attributes match the values of the attributes in the search request is selected. This template has a template identifier that is associated with a transaction name of a work unit enclave. The search request is then associated with the work unit enclave and the operating system of the computer system will execute the search request in accordance with the performance goals and priority of the service class into which the work unit enclave is assigned. Process steps include creating a search template if none exist, and configuring a database server to assign a transaction name to search requests based on attributes and their values of the search request and then associating that transaction name with a transaction name of the work unit enclave.