Block-Level Indexing for Reducing Document Search Storage Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing document indexing technologies face inefficiencies due to redundant indexing of identical content sections across multiple documents, leading to increased computational resources and storage requirements, while maintaining the ability to perform search queries on a document level.
Innovation Solution
A method and system that structures documents into blocks with unique block IDs, allowing for efficient indexing and search queries by correlating search terms with block IDs and documents, thereby reducing redundant indexing and optimizing search processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If duplicated portions of content are indexed multiple times in full text indexing, then search completeness is improved, but index size and storage requirements increase
Solution Approach 1:
The patent segments documents into reusable blocks with unique identifiers. Instead of indexing entire documents separately, the system divides content into discrete blocks that can be independently indexed and referenced by multiple documents, reducing redundant storage while maintaining search capability.
Solution Approach 2:
The patent uses block identifiers to reference identical content blocks across multiple documents without physically copying the full content. Each document stores references to blocks rather than duplicating the actual content, enabling search completeness while minimizing index size.
2Measurement precision
If identical sections are indexed multiple times across documents, then search accuracy is improved, but computational resources are wasted
Solution Approach 1:
The patent performs preliminary indexing of unique blocks separately from document assembly. Identical blocks are indexed once in advance and assigned unique identifiers, so that when documents are searched, the system can efficiently retrieve pre-indexed block information without re-analyzing identical content, reducing computational waste.
Solution Approach 2:
The patent introduces block identifiers as an intermediary layer between documents and the index. Instead of directly indexing document content, the system uses block IDs as mediators that link documents to their constituent blocks, enabling accurate search results while avoiding redundant computational analysis of identical sections.
3Quantity of substance
If a block-level index is implemented, then storage efficiency is improved, but system complexity increases
Solution Approach 1:
The patent creates a universal block-level indexing system that serves multiple functions: reducing storage requirements, enabling efficient search operations, and providing a reusable framework for document management. The same block identifier mechanism handles both storage optimization and search efficiency, reducing overall system complexity despite the initial structural change.
Data Source
AI summary
A method and a computer-readable medium for method for searching a plurality of documents. Each document is structured into a set of blocks and each block is associated with a block ID. The method includes receiving a search query including a search term having at least one search term attribute; identifying at least one block ID based on a correlation between the at least one search term attribute and the set of blocks; and identifying at least one document based on a correlation between the set of blocks and the documents. Methods for generating a data structure for searching documents are also described.