Keyword Dictionary Segmentation for Multi-District Search Speed

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In a scenario where factories or offices in multiple districts use a common information search system, terms specific to particular districts can lead to a large shared dictionary, hindering high-speed search performance.

Innovation Solution

The information search system employs a combination of a shared keyword dictionary and local keyword dictionaries, where relevant keywords are registered across districts, allowing for efficient retrieval by referencing both dictionaries based on the input search keywords.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If all terms including district-specific terms are registered in a shared dictionary, then the system can serve multiple districts, but search speed decreases due to increased dictionary size

Engineering Contradiction:
Improvesystem coverage across multiple districtsVSAvoidsearch speed
Core Design Contradiction:
Adaptability or versatilityVSSpeed

Solution Approach 1:

The patent divides the keyword dictionary into a shared dictionary (containing common terms across districts) and local dictionaries (containing district-specific terms). This segmentation allows the system to maintain comprehensive coverage while reducing the size of the shared dictionary, thereby improving search speed without sacrificing versatility.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a hierarchical structure with two levels: the shared dictionary at the upper level and local dictionaries at the lower level. This dimensional change enables the system to access district-specific terms through local dictionaries while maintaining efficient search performance in the shared dictionary, resolving the contradiction between coverage and speed.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Adaptability or versatility

If a large shared dictionary is used to support multiple districts, then the system can handle diverse search queries, but retrieval processing becomes slower

Engineering Contradiction:
Improvequery handling capabilityVSAvoidretrieval processing efficiency
Core Design Contradiction:
Adaptability or versatilityVSProductivity

Solution Approach 1:

The patent segments the dictionary structure into shared and local components, allowing the system to handle diverse queries through the shared dictionary while maintaining high retrieval efficiency by keeping the shared dictionary size manageable. Local dictionaries handle district-specific queries efficiently without impacting overall system performance.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces local dictionaries as intermediaries between user queries and the shared dictionary. When a query contains district-specific terms, the system first checks local dictionaries, reducing the need to search the entire shared dictionary, thereby improving retrieval processing efficiency while maintaining comprehensive query handling capability.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS12332927B2Information search system
Publication Date: 2025.06.17 JFE STEEL CORP
  • US12332927B2 patent drawing
  • US12332927B2 patent drawing
  • US12332927B2 patent drawing

AI summary

An information search system, including: a database (12); a query sentence acceptance unit (26) that accepts a query sentence; an inputted search keyword extractor (44) that extracts an inputted search keyword from the query sentence; a shared keyword dictionary (30) in which relevant keywords are registered in association with each other; a local keyword dictionary (102) in which district keywords used in particular districts are registered; a candidate search keyword reader (32) that reads out a keyword that is relevant to the inputted search keyword; and a retrieval executor (40) that executes retrieval processing from the database using the inputted search keyword, wherein, in a case in which the inputted search keyword is not registered in the local keyword dictionary, the candidate search keyword reader refers to the shared keyword dictionary, so as to read out a keyword that is relevant to the inputted search keyword.