Slice Data Processing for Continuous Display
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current client applications fail to effectively identify and display slice data, leading to users being unaware of its existence between newer and older data sets, resulting in incomplete data presentation.
Innovation Solution
A device and method that include a database unit for saving data and slice intervals, a display unit for showing valid data, and a slice data download unit to request and fill slice data gaps, ensuring only continuous and newest data is displayed by maintaining displaying marks and recording slice intervals.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If newly downloaded reading data is inserted directly in front of prior reading data without considering slice data, then data display is simplified, but slice data becomes undetectable and inaccessible to users
Solution Approach 1:
The system performs preliminary actions by recording slice intervals in the database before data insertion occurs. The database maintains slice interval information that identifies where gaps exist between older and newer reading data, enabling the system to subsequently retrieve and insert the missing slice data in the correct positions, thereby preventing information loss while maintaining operational simplicity
Solution Approach 2:
The system implements feedback mechanisms where the database continuously tracks and updates slice interval information based on data download and insertion operations. This feedback loop allows the system to detect when slice data is missing, retrieve it from the server, and insert it into the appropriate positions, ensuring complete data presentation while maintaining simple user interaction
2Reliability
If all reading data from previous downloads is requested again, then complete data continuity is ensured, but data transmission time and network traffic increase significantly
Solution Approach 1:
The system segments the data retrieval process into two distinct parts: (1) requesting only the newest reading data from the server, and (2) separately identifying and requesting slice data through recorded slice intervals. This segmentation allows the system to maintain data continuity by filling gaps only where necessary, rather than retrieving all previous data, thereby reducing transmission time and network traffic while ensuring complete data presentation
Solution Approach 2:
The system applies partial action by requesting only the necessary portion of data - specifically, the newest reading data plus the identified slice data in gaps - rather than requesting all reading data from previous downloads. This partial retrieval strategy maintains data continuity where needed (in slice intervals) while avoiding unnecessary data transmission, thus optimizing both reliability and time efficiency
3Loss of information
If slice intervals are recorded and slice data is requested separately, then complete data presentation is achieved, but database structure and processing complexity increase
Solution Approach 1:
The database is designed with multi-functionality, serving both as a storage mechanism for reading data and as a tracking system for slice intervals. By integrating slice interval recording into the existing database structure, the system achieves complete slice data presentation without requiring separate complex tracking systems, thereby balancing information completeness with manageable database complexity
Solution Approach 2:
The slice interval information acts as an intermediary mechanism between the downloaded reading data and the missing slice data. Rather than directly managing complex relationships between all data elements, the system uses slice intervals as intermediate markers to identify gaps, retrieve appropriate slice data, and maintain completeness, thereby simplifying the overall data management process while ensuring no information is lost
Data Source
AI summary
The present disclosure discloses a device and method for processing slice data. The method comprises: sending a download request for slice data adjacent to the newest continuous data to a server, determining whether or not a adjacent slice interval is filled with the slice data returned by the server; if yes, inserting the returned slice data into a database, setting the displaying mark thereof as valid, setting the displaying mark of downloaded data between the adjacent slice interval and the next slice interval to the adjacent slice interval as valid, and deleting the adjacent slice interval from the database; if not, inserting the returned slice data into the database, setting the displaying mark thereof as valid, and amending the border of the adjacent slice interval. The technical scheme of the present disclosure can obtain slice data from the server and fill the slice data in a corresponding slice interval according to a recorded slice interval set, and the data displayed to users is always the newest continuous data.