Message-Based Word Search System Using Broadcast Hashing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing search methods for finding information on the internet are inefficient, either requiring sequential searches through entire databases or relying on hash indexes that need to be updated whenever new words are added, leading to slow search times.
Innovation Solution
A system and method where each word from registered sentence data is assigned to a data module, and the input search word is broadcast to all modules, with search results provided from each module, utilizing 64-bit hash codes to quickly identify matching words.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If sequential search method is used to search words in database, then search can be performed on existing database, but search time becomes very long
Solution Approach 1:
The patent segments the database into multiple data modules, with each module storing specific words extracted from sentence data. When a search is performed, the system divides the search task across multiple data modules rather than sequentially searching the entire database, significantly reducing search time while maintaining complete search coverage.
Solution Approach 2:
The patent performs preliminary extraction and organization of words from sentence data into data modules before the actual search operation. Words are extracted and stored in dedicated data modules in advance, so when a search is needed, the system only needs to query pre-organized modules rather than processing raw sentence data during the search operation.
2Speed
If hash index method is used to array words and find desired word, then search range is narrowed, but hash table must be newly arrayed whenever new word is added
Solution Approach 1:
The patent implements a dynamic system where data modules can be easily added, modified, or removed without requiring reorganization of the entire database structure. When new words are added, they are simply inserted into appropriate data modules without affecting other modules, allowing the system to adapt dynamically to changing data while maintaining fast search performance.
Solution Approach 2:
By dividing the database into independent data modules, the patent eliminates the need for global hash table restructuring. Each data module can be independently managed and updated, so adding new words only requires modifications to specific modules rather than rearraying the entire hash structure.
3Productivity
If data module is assigned to each word extracted from registered sentence data and search word is broadcast to all data modules, then word search can be performed rapidly, but system complexity increases
Solution Approach 1:
The patent creates a universal data module structure that can handle multiple operations (storage, search, update) in a standardized way. Each data module follows the same format and can be independently queried, allowing the system to maintain simplicity at the module level while achieving high productivity through parallel processing across multiple modules.
Data Source
AI summary
There are disclosed a system and method for providing a word search service based on message according to the present invention. The system for providing a word search service based on message according to the present invention includes a database which is equipped with a plurality of data modules and registers sentence data and word extracted from the sentence data in each data module equipped to manage the sentence data and the word; and a service server which, if receiving a search word from a user terminal, broadcasts the received search word to all data modules and is provided with a search result from each of all data modules in response to broadcasting and thereafter provides the provided search result to the user terminal.