Information Search Apparatus Using Segmented Data Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current database search methods are inefficient due to slow processing speeds, especially with the increasing number of search target items and relation items, as the existing data structures do not effectively utilize upper items to reduce the number of records to be searched.
Innovation Solution
A data structure that includes first, second, and third data tables, where the first table associates upper items with multiple relation items, the second table associates search target items with upper items, and the third table associates search target items and relation items not in the first and second tables, allowing the system to selectively search based on specified search conditions, thereby reducing the number of records to be searched.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If a conventional data structure with a single large data table is used to store all search target items and relation items, then the database can store a comprehensive set of data, but the search processing speed becomes slow due to the large number of records that must be searched
Solution Approach 1:
The patent divides the conventional single large data table into three separate data tables: a first data table storing upper items and their associated relation items, a second data table storing upper items and their associated search target items, and a third data table storing direct associations between relation items and search target items. This segmentation allows the search system to query only the necessary tables based on the search conditions, dramatically reducing the number of records that need to be searched and improving search processing speed
2Adaptability or versatility
If the database stores an enormous number of search target items and relation items to provide comprehensive search coverage, then the system can handle diverse search queries, but the processing power requirement increases and search speed decreases
Solution Approach 1:
By segmenting the database into three specialized tables, the system maintains comprehensive search coverage through the third data table (which stores all direct relation item to search target item associations) while enabling fast searches through the first and second data tables (which store upper item groupings). The segmented structure allows the system to adapt to different search scenarios by selecting the appropriate table or combination of tables, thereby maintaining versatility without sacrificing processing speed
Solution Approach 2:
The patent introduces a hierarchical dimension to the data structure by organizing relation items and search target items under upper items (categories). This dimensional change allows the system to handle both specific searches (using the third data table) and category-based searches (using the first and second data tables), thereby expanding search coverage while maintaining efficiency through selective table querying
Data Source
AI summary
Data searching apparatus to speed up searching time. This apparatus searches search target items associated with the specified relation items. When a group of search target items is associated with a same group of relation items, an upper item is defined to both of the groups of search target items and relation items. The relation between the upper item and relation items are recorded on first data, whereas the relation between the upper item and search target items are recorded on second data. The relations between the relation items and search items which are not associated with the upper items are recorded in third data. When part of or all of the specified relation items is contained in the first data, the first data, at least the second data is searched, and when no specified relation item is contained on the first data, only the third data is searched.