Event ID Storage via Prefix-Based N-Ary Tree Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Service provider networks face significant challenges in efficiently storing and retrieving large numbers of event IDs, which require substantial computing resources, leading to high processing power and latency issues when managing network-based services.
Innovation Solution
Implementing a data-storage schema that groups event IDs into file folders based on prefixes, using an N-ary tree structure, where each file folder stores IDs with a specific prefix portion, reducing the number of writes and reads required to store and retrieve event metadata.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If event IDs are stored in a traditional database structure, then data can be stored and retrieved, but processing power and memory resources are excessively consumed
Solution Approach 1:
The patent segments the storage system into multiple file folders organized in an N-ary tree structure, where each folder stores event IDs with specific prefix patterns. This segmentation allows the system to avoid scanning entire databases and only access relevant folders during retrieval, significantly reducing processing power and memory consumption while maintaining storage capacity.
2Reliability
If all event IDs are stored in a single database, then complete event history is maintained, but retrieval time increases due to large data volume
Solution Approach 1:
The database is segmented into multiple file folders organized in an N-ary tree structure, where each folder stores event IDs with specific prefix patterns. This segmentation maintains complete event history while enabling targeted retrieval by only accessing relevant folders based on the event ID prefix, significantly reducing retrieval latency.
Solution Approach 2:
Event IDs are pre-organized into specific file folders based on their prefix patterns before retrieval operations. This preliminary organization allows the system to quickly locate event IDs by matching prefixes without scanning the entire database, reducing retrieval time while maintaining data completeness.
3Ease of manufacture
If event IDs are stored without organization, then storage implementation is simple, but the number of reads and writes required increases significantly
Solution Approach 1:
The storage system is segmented into file folders organized in an N-ary tree structure based on event ID prefixes. This segmentation maintains implementation simplicity by using standard file system operations while dramatically improving storage operation efficiency by reducing the number of reads and writes needed to access specific event IDs.
Data Source
AI summary
This disclosure describes techniques implemented partly by a service provider network for distributed storage of event data in data storage according to a data-storage schema in order to reduce the amount of computing resources required to store and access the event data. The techniques may include generating event identifiers (IDs) for actions performed by users to manage cloud-based services. Rather than indexing event IDs by writing the event IDs to a database, the techniques described herein include storing event IDs in different file folders in storage according to a storage schema where the different file folders are assigned to store event IDs having different prefix portions. In this way, event IDs may be stored, or grouped, in different file folders according to prefix portions of the event IDs to reduce the amount of reads and writes required for the event IDs.