Document Block Segmentation and Graph Merging for Memory Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current document management systems inefficiently store and link documents of the same set, leading to increased memory usage and lack of connectivity between similar documents, such as successive versions of instruction manuals, which share common sections.
Innovation Solution
A computer-implemented method that divides documents into blocks, establishes relationships between blocks, and creates a directed graph to represent and merge these relationships across sets, reducing memory usage by identifying and merging similar blocks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If documents are recorded independently in separate directories according to classification, then document organization is simplified and ease of operation is improved, but memory space usage increases and loss of information occurs due to no links between documents of the same set
Solution Approach 1:
The patent divides documents into blocks (segments) and creates directed graphs where nodes represent blocks and edges represent relationships between blocks. This segmentation allows identical or similar blocks across different documents to be identified and merged, reducing memory space while maintaining document structure and relationships.
Solution Approach 2:
The patent merges directed graphs of documents from the same set by identifying and combining common blocks. When blocks from different documents are found to be identical or similar (through relationship establishment), they are merged into a single block, reducing overall memory usage while preserving the ability to reconstruct complete documents.
2Device complexity
If documents are recorded independently without links, then device complexity is reduced and ease of manufacture is improved, but loss of information occurs as links between documents of the same set are lost
Solution Approach 1:
By segmenting documents into blocks and representing them as nodes in directed graphs, the patent creates a structured representation that explicitly captures relationships between blocks. This segmentation enables the system to track and preserve links between documents through graph edges, preventing information loss while maintaining manageable complexity.
Solution Approach 2:
The directed graph serves as an intermediary structure that mediates between the simple storage of independent documents and the need to preserve relationships. The graph's nodes and edges provide a formal mechanism to represent and maintain links between documents of the same set without requiring complex file system structures.
3Reliability
If successive versions of instruction manuals are stored separately, then document integrity is maintained and reliability is improved, but memory space usage increases as versions of the same instruction manual are stored
Solution Approach 1:
The patent segments instruction manuals into blocks and creates directed graphs for each version. By representing documents as graphs of blocks rather than complete copies, the system can store multiple versions more efficiently while maintaining the integrity of each version's structure and content through the graph representation.
Solution Approach 2:
The patent merges directed graphs of different versions of the same instruction manual by identifying common blocks across versions. Blocks that are identical or similar across versions are merged into a single block, reducing memory usage while preserving the ability to reconstruct complete versions and maintain document integrity through the graph structure.
Data Source
AI summary
It is provided a computer-implemented method for recording one or more documents. Each document comprises at least one word. The method comprises providing one or more documents forming a first set of documents. The method comprises dividing each document of the first set into one or more blocks. The method comprises creating a directed graph representing relationships established between the blocks of documents of the first set. The method comprises providing at least one block from a previous division of each document of a second set of documents. The method comprises merging the directed graph created for the first set with another directed graph previously created for the second set and taking account of at least one established relationship. The method improves the recording of the sets of documents.