Matrix Text Storage with Run-Length Encoding for Search Speed
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current digital data storage technologies are inadequate in terms of size and speed, as they fail to meet the continuous demand for faster and more compact storage solutions, despite advancements in compression algorithms and device miniaturization.
Innovation Solution
A text storage and search system that organizes words in a virtual table with each word in a different row and each letter in a different column, utilizing run-length encoding for compression and optimizing interval lengths to facilitate expedited searching.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If conventional data storage formats are used, then storage capacity is adequate, but storage speed and search efficiency are insufficient
Solution Approach 1:
The patent transforms traditional linear or hierarchical data storage into a two-dimensional matrix structure where words are arranged in rows and columns. This dimensional transformation enables parallel processing of multiple characters simultaneously, significantly improving search speed while maintaining manageable complexity through systematic row-column organization.
Solution Approach 2:
The patent segments the data storage structure into distinct rows (each representing a word) and columns (each representing a character position). This segmentation allows independent processing of different character positions and enables efficient interval-based searching by dividing the search space into manageable segments corresponding to specific column intervals.
2Quantity of substance
If data is stored in compact format, then storage size is reduced, but search efficiency deteriorates
Solution Approach 1:
The patent performs preliminary organization of data into a matrix structure with optimized interval arrangements before searching begins. By pre-arranging words and characters in rows and columns with calculated intervals, the system prepares the data in advance to enable rapid interval-based skipping during searches, reducing actual search time while maintaining compact storage.
Solution Approach 2:
The patent changes the structural parameters of data storage from conventional formats to a matrix format with specific row and column assignments. This parameter transformation allows the system to achieve both compact storage through efficient space utilization and fast search through interval-based navigation, as the matrix structure enables direct calculation of character positions.
3Productivity
If traditional search algorithms are used, then implementation is simple, but search speed is slow
Solution Approach 1:
The patent introduces an interval structure as an intermediary mechanism between the matrix data structure and the search process. These intervals act as mediators that enable efficient skipping and navigation through the data, allowing the search algorithm to jump over non-matching segments directly. This intermediary layer significantly accelerates search speed while keeping the core algorithm relatively simple through interval-based navigation.
Data Source
AI summary
A computer readable storage medium tangibly embodying machine-readable digital data arranged to facilitate expedited searching. The data includes a plurality of words residing in a table having rows and columns, each word residing in a different row and each letter of the word occupying a different column in that row. Each continuous run of same letters in a column forms an interval. The words are positioned relative to each other to maximize lengths of the intervals, and/or optimize efficiency of compression of the columns by run length encoding.