Dynamic Search Term Prioritization for Resource-Constrained Indexing

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Traditional data search systems face strain and inefficiency due to increased system resource demands as data volumes grow, leading to delays and inaccurate results, especially with multi-clause searches, which can result in adverse consequences for decision-making and user confidence.

Innovation Solution

A search management system that prioritizes search terms from least to most resource-intensive, searching each term only within the results of previous searches, using a search cost database to optimize resource usage and dynamically improve search efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional search systems search through vast amounts of data with multiple search terms, then comprehensive search coverage is achieved, but system resource consumption increases significantly

Engineering Contradiction:

Improvesearch accuracyVSAvoidsystem resource consumption

Core Design Contradiction:

ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent segments the search process into multiple sequential stages, where each search term is processed in a predetermined order. The search space is divided and reduced progressively - starting with the entire database, then filtering results with each subsequent search term. This segmentation allows comprehensive multi-term search coverage while reducing resource consumption at each stage by working with progressively smaller result sets.

Inventive Principle:

Principle #1Segmentation

2Productivity

If search systems increase hardware resources to meet growing demand, then search capacity increases, but system complexity and cost increase

Engineering Contradiction:

Improvesearch capacityVSAvoidhardware complexity

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent implements dynamic search space adjustment where the effective search space changes progressively during query execution. The system dynamically reduces the search space from the entire database to progressively smaller subsets based on previous search results. This dynamic adaptation allows the system to handle complex multi-term searches with existing hardware resources rather than requiring proportional hardware increases.

Inventive Principle:

Principle #15Dynamics

3Reliability

If search systems process multiple search terms simultaneously, then complete search results are provided, but search time increases due to resource strain

Engineering Contradiction:

Improvesearch completenessVSAvoidsearch delay

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

The patent applies preliminary action by pre-determining the optimal search term processing order based on expected result set sizes. Search terms that are expected to return fewer results are processed first, creating a smaller initial result set that subsequent terms then filter. This preliminary ordering strategy reduces overall search time while maintaining complete multi-term search coverage.

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS10853367B1Dynamic prioritization of attributes to determine search space size of each term, then index on those sizes as attributes

Publication Date: 2020.12.01 INTUIT INC

AI summary

A method and system provides efficient data searches. The method and system include receiving search request data that requests a search to be made and identifying multiple search terms or clauses in the search request data. The method and system includes determining an expected cost in resources for searching each search term. The method and system then searches for each search term in order from least resource intensive to most resource intensive, with each search after the first search being performed only among the results of the previously searched term(s).