File Extraction Index Segmentation for Search Speed

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

As the number of files to be searched increases, the volume of index information also increases, leading to a longer time required for the search process due to the need to refer to and process larger amounts of index information.

Innovation Solution

The method involves storing and updating first and second information in a storage unit, where the first information indicates if each file includes specific character data, and the second information indicates if any file includes that data, using additional presence information to efficiently extract files containing the specific character data upon a search request.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If the number of files to be searched increases, then the coverage of search capability is improved, but the volume of index information increases leading to longer search time

Engineering Contradiction:
Improvesearch coverageVSAvoidsearch time
Core Design Contradiction:
Adaptability or versatilityVSLoss of time

Solution Approach 1:

The patent divides the index information into two separate data structures: first information (individual file presence flags for each file) and second information (aggregate presence flags indicating whether any file contains the character data). This segmentation allows the system to maintain comprehensive search coverage across all files while enabling rapid search execution by only processing the compact second information structure, thus resolving the contradiction between search coverage and search time.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transitions from a single-dimension index (one large index structure containing all file information) to a two-dimension index structure where first information and second information are stored separately. The second information acts as a summary layer that enables quick search decisions without traversing the complete first information structure, effectively adding a dimensional layer of abstraction that reduces search time while maintaining full search capability.

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

2Quantity of substance

If the volume of index information increases, then more files can be indexed, but the time required to process and refer to index information increases

Engineering Contradiction:
Improveindex information volumeVSAvoidindex processing speed
Core Design Contradiction:
Quantity of substanceVSProductivity

Solution Approach 1:

The patent extracts the essential search capability from the complete index information by creating second information that contains only the critical presence/absence flags indicating whether character data exists in any file. This extracted structure enables rapid search processing by eliminating the need to examine the complete first information structure, thus improving index processing speed while maintaining the ability to handle large volumes of indexed files.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent performs preliminary processing to generate second information that pre-summarizes the presence of character data across all files. This preliminary action creates a ready-to-use search index that can be quickly queried without performing extensive processing during the actual search operation, thereby improving productivity during search operations while maintaining comprehensive indexing capability.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS9916314B2File extraction method, computer product, file extracting apparatus, and file extracting system
Publication Date: 2018.03.13 FUJITSU LTD
  • US9916314B2 patent drawing
  • US9916314B2 patent drawing
  • US9916314B2 patent drawing

AI summary

An AND operation is performed for an integrated appearance map of a compression code of character data “”, an integrated appearance map of a compression code of character data “”, and an integrated deletion map for a segment. The AND result is “1100” and it is found that the character data “” and “” are likely to be present in the segments (sg1(1)) and (sg1(2)). Since the segments are specified from the AND result, the AND operations are performed. As a result, the segments are specified and the AND operations are performed. As a result, a file number 3 is specified from the segment (sg0(1)) and a file number 19 is specified from the segment (sg0(5)). Therefore, it is found that both of the character data “” and “” are present in compression files (f3) and (f19).