Distributed Storage Tree Indexing for Catalog Search Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In distributed content storage systems, the inefficiency in searching for and managing content catalog information due to the need to search through entire lists of digitally signed items for desired content data, leading to inefficiencies in adding, updating, or deleting attribute information, and the risk of tampering in content catalog information as the data amount grows.
Innovation Solution
A distributed storage system that organizes page information in a tree structure with tampering check information and serial numbers, allowing nodes to efficiently acquire and store page information within assigned ranges, using digital signatures to prevent tampering, and optimizing data search processes by distributing page information across nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If content catalog information is split and distributed over multiple node apparatuses, then the storage capacity is improved, but the search efficiency deteriorates because entire lists need to be searched
Solution Approach 1:
The content catalog information is segmented into multiple pieces and distributed across different node apparatuses in the network. Each node stores a specific portion of the catalog information, allowing the system to scale storage capacity by adding more nodes without requiring a single centralized storage point.
Solution Approach 2:
The patent introduces a hierarchical indexing structure with tree-organized index information that adds a dimensional layer to the distributed storage system. This indexing hierarchy enables efficient navigation and search across distributed segments by providing structured access paths, transforming the search problem from linear scanning to targeted retrieval through multiple organizational dimensions.
2Reliability
If digital signatures are added to prevent tampering, then the reliability is improved, but the complexity of data management increases
Solution Approach 1:
Digital signatures are pre-applied to content catalog information and index data before distribution to node apparatuses. This preliminary cryptographic processing ensures tampering prevention is built into the data structure itself, eliminating the need for complex runtime verification mechanisms and simplifying ongoing data management while maintaining reliability.
3Reliability
If entire lists of content catalog information are searched, then the reliability of finding desired content is improved, but the time consumption increases
Solution Approach 1:
The content catalog is segmented into distributed pieces across multiple nodes, each with its own localized index. This segmentation allows search operations to be performed on smaller, distributed subsets rather than requiring linear scanning of entire centralized lists, reducing search time while maintaining retrieval reliability through the distributed index structure.
Solution Approach 2:
A hierarchical index structure with multiple organizational dimensions is introduced to the distributed storage system. This indexing hierarchy provides structured access paths and enables efficient navigation to desired content through targeted queries, transforming exhaustive linear searches into efficient multi-dimensional lookups that significantly reduce search time while maintaining reliable content retrieval.
Data Source
AI summary
A node apparatus acquires root link information including a serial number of root page information, information for checking the root page information for tampering, and a digital signature for checking the root link information for tampering from a management apparatus or another node apparatus that stores the root link information through a network and determines a range of page information assigned to each node apparatus according to predetermined rules. The node apparatus determines whether page information that is a child of the root page information indicated by the acquired root link information is within the assigned range. If so, the node apparatus acquires the child page information and pieces of page information linked together from the child to leaf page information from the management apparatus or another node apparatus as page information assigned to the node apparatus and stores the acquired page information in a storage area.