Page-to-Identifier Query for Paginated Data Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems for managing paginated data require users to manually scroll through multiple pages to find a specific record, which is time-consuming and inefficient, and do not allow bi-directional requests for pages containing the selected record while viewing a details page.
Innovation Solution
A page-to-identifier query is implemented, allowing users to request and obtain the page containing a specific instance using a single query, with the server processing this query to identify and return the correct page, including the selected instance and optionally reordering the result set based on user-defined criteria.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Power
If pagination is used to limit the number of records returned to the client, then server performance is improved, but user efficiency deteriorates because users must manually scroll through multiple pages to find a specific record
Solution Approach 1:
The patent extracts the search function from the manual pagination process. Instead of requiring users to manually scroll through pages, the system provides a direct extraction mechanism where users can specify the identifier of the desired record, and the system extracts and returns only the specific page containing that record, bypassing the need to manually navigate through intermediate pages.
Solution Approach 2:
The patent introduces an intermediary mechanism - the page-to-identifier query interface - that mediates between the user's search need and the paginated data structure. This intermediary allows users to directly specify the identifier of the desired record, and the system uses this intermediary information to calculate and return the exact page containing the record, eliminating the need for manual scrolling through multiple pages.
2Ease of operation
If the entire result set is returned to the client, then user access to any record is simplified, but server performance deteriorates due to returning dozens, hundreds, or even thousands of records
Solution Approach 1:
The patent makes the data retrieval process dynamic rather than static. Instead of always returning the entire result set or requiring manual pagination, the system dynamically adjusts the returned data based on the user's specific needs. When a user provides an identifier, the system dynamically calculates which page contains that record and returns only that specific page, optimizing both performance and ease of access.
3Device complexity
If users manually scroll through each page one at a time, then the system structure remains simple, but the time required to locate a desired record increases significantly
Solution Approach 1:
The patent performs preliminary action by pre-calculating and storing the mapping between record identifiers and their corresponding page numbers. This preliminary organization of data allows the system to quickly determine which page contains a given identifier without requiring users to manually scroll through pages, significantly reducing the time to locate records while maintaining relatively simple system architecture.
Data Source
AI summary
Examples are generally directed towards managing paginated data. A server receives a page-to-identifier query from a client. The page-to-identifier query includes an identifier of a selected object instance. The server generates an ordered list of object instances corresponding to at least one ordering criteria paginated into a set of pages. The server identifies a page in the set of pages including the selected instance to form a results page. The results page includes the selected instance. The server returns the results page to the client.