Virtualized Carousel Panel Data Rotation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing software applications struggle to efficiently display and navigate large datasets in a carousel format, often requiring bulk data download and inefficient memory usage, which can lead to performance issues and increased processing costs.
Innovation Solution
A computer system that accesses a list of data items and uses a carousel display panel to rotate and display the last data item, along with portions of the first and second-to-last items, while dynamically loading and unloading data from memory based on user input and customizable panel sizes, optimizing memory usage and user navigation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If bulk data download is used to display all data items, then complete data availability is achieved, but memory usage and processing costs increase
Solution Approach 1:
The patent segments the data display into a carousel panel that shows only a limited number of data items at a time (e.g., 3-5 items). This segmentation allows the system to load and display only the necessary portion of data rather than bulk downloading all data, thereby reducing memory usage while maintaining data availability for the current view.
Solution Approach 2:
The patent implements preloading of data items that are adjacent to the currently displayed items in the carousel. When a user navigates to a specific data item, the system proactively loads neighboring items into memory in advance, ensuring that subsequent navigation actions can be performed without additional data retrieval operations. This preliminary action maintains data availability while minimizing the quantity of data stored in memory at any given time.
2Speed
If all data items are loaded into memory, then fast access is achieved, but processing costs and memory consumption increase
Solution Approach 1:
The system performs preliminary loading of data items that are likely to be accessed next in the carousel sequence. By preloading adjacent data items into memory before they are actually needed, the system ensures fast access speed when users navigate through the carousel, while avoiding the cost of loading and processing all possible data items simultaneously.
Solution Approach 2:
The patent implements a strategy of loading slightly more data items than currently visible in the carousel panel (e.g., loading 3-5 items when only 3 are displayed). This partial excessive action ensures that fast access is maintained for current and near-future navigation operations, while keeping the total quantity of loaded data minimal to reduce processing costs and energy consumption.
3Productivity
If carousel panel size is increased to show more items, then user navigation efficiency is improved, but memory usage increases
Solution Approach 1:
The patent implements a carousel panel that displays a moderate number of data items (e.g., 3-5 items) rather than showing all available data. This partial display approach maintains user navigation efficiency by providing enough context for effective browsing, while simultaneously limiting memory consumption by loading only the necessary subset of data items into memory at any given time.
Data Source
AI summary
Embodiments are directed to displaying data items in a carousel display panel and to efficiently presenting virtualized data in a carousel display panel. In one example, a computer system accesses a list of data items that include at least a first data item and a last data item which are to be displayed in a carousel display panel. The computer system displays the selected portion of data items in the carousel display panel and receives a user input indicating that the last data item in the list is to be displayed in the carousel display panel. The computer system then rotates the data items displayed in the carousel display panel to the last data item. The last data item is thus displayed, along with at least a portion of a second-to-last data item and the first data item in the list.