Timedly-Published Data Processing via Append-Delete File Indexing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional methods for processing timedly-published data are inefficient and prone to delays or data loss due to high concurrent requests, requiring cumbersome database inquiries and modifications.
Innovation Solution
The method involves writing append-files and delete-files using the publishing time of timedly-published data as an index, allowing direct processing of operation requests without database inquiries, thereby improving efficiency and reducing delays.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional database methods are used to store and process timedly-published data, then data can be stored and retrieved, but the processing efficiency is reduced and publishing may be delayed due to large handling amount and time-consuming operations
Solution Approach 1:
The patent segments the data storage and processing into separate components: append-files for adding data, delete-files for removing data, and publish-files for timed publication. This segmentation allows parallel processing of different operations without database locking, significantly improving processing efficiency and eliminating publishing delays.
Solution Approach 2:
The patent introduces an intermediary file system layer between the application layer and the storage layer. Instead of directly querying and modifying databases, operations are routed through append-files and delete-files, which act as intermediaries. This intermediary mechanism decouples the writing and reading operations, enabling high-concurrency processing without blocking.
2Ease of operation
If database inquiries and modifications are performed for each concurrent request, then data operations can be executed, but the handling amount becomes very large and time-consuming
Solution Approach 1:
The patent extracts the time-consuming database inquiry and modification operations from the request processing path. Instead of performing full database operations for each request, the system extracts only the essential write operations to append-files and delete-files, dramatically reducing handling complexity while maintaining data operation capability.
Solution Approach 2:
The patent creates simplified copies of data operations in the form of append-files and delete-files. These file-based representations serve as lightweight copies that capture the essential operations without the overhead of full database transactions. The publishing process then reads from these simplified copies rather than querying the original database.
3Reliability
If the server needs to inquire the database for each user request, then data can be accessed, but the amount of concurrent requests that can be handled is limited
Solution Approach 1:
The patent performs preliminary actions by writing all data operations to append-files and delete-files in advance, before the publishing time arrives. This preliminary preparation allows the actual publishing process to simply read and process pre-prepared files, enabling the system to handle high volumes of concurrent requests without database bottlenecks while maintaining data access reliability.
Data Source
AI summary
Methods and apparatus for processing timedly-published data are provided. After receiving an operation request for the timedly-published data, at least one of an append-file and a delete-file can be written according to the operation request. The append-file corresponds to to-be-appended timedly-published data or post-updated timedly-published data. The delete-file corresponds to to-be-deleted timedly-published data or pre-updated timedly-published data. Each of the append-file and the delete-file uses a publishing time of the timedly-published data as an index.