Multi-level Data Pagination Using Skip Tokens
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In graph or tree structures, large query results can lead to impractical returns, causing duplicate results when not all data is returned at once, making it difficult to track which data was returned and which was not, especially in multi-dimensional scenarios.
Innovation Solution
Implementing a cursor or skip token system to paginate data and serve as a starting point for subsequent queries, allowing for efficient tracking and retrieval of results across multiple relationship levels.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all query results are returned at once, then complete data is provided, but it becomes impractical to handle large amounts of data and subsequent queries may return duplicates
Solution Approach 1:
The patent divides large query results into manageable pages using pagination. Instead of returning all results at once, the system returns a specified number of results per page (e.g., 25 or 50 results) and provides navigation mechanisms (page numbers, next/previous buttons) for users to access additional pages. This segmentation makes large datasets practical to handle while maintaining data completeness through systematic access to all pages.
Solution Approach 2:
The patent implements preliminary actions by providing pagination metadata (total results, current page, pages available) before the user needs to navigate through results. The system pre-calculates and provides the structure for navigating through all results, enabling users to plan their data access strategy in advance rather than discovering limitations during data retrieval.
2Ease of operation
If pagination is implemented without tracking mechanisms, then data is divided into manageable chunks, but it becomes difficult to track which data was returned and which was not
Solution Approach 1:
The patent implements feedback mechanisms by providing pagination metadata with each query result set. This includes information about the current page number, total number of pages, total results available, and whether there are previous or next pages. This feedback enables users to track their position in the result set and understand what data has been retrieved and what remains available.
Solution Approach 2:
The patent uses pagination cursors and state information as intermediaries between the query system and the user. These intermediaries carry information about the current position in the result set, the structure of remaining data, and navigation options. The intermediary maintains the connection between pagination actions and the underlying data, enabling reliable tracking without requiring the user to manually manage complex state.
3Reliability
If multiple relationships are queried in a graph structure, then comprehensive data is retrieved, but the complexity of tracking and paginating results increases significantly
Solution Approach 1:
The patent merges multiple relationship queries into a single unified pagination operation. Instead of executing separate queries for each relationship and managing multiple independent pagination states, the system combines the results from multiple relationships into a single result set with a unified pagination structure. This reduces complexity by consolidating tracking mechanisms while maintaining comprehensive data retrieval across all specified relationships.
Data Source
AI summary
Examples of the present disclosure describe systems and methods for returning resources from an isolated collection in response to a query. In some instances, the results of the query may return a large number of resources. As such, the returned results may be paginated so that a select number of results are returned. When a subsequent query is executed on the isolated collection, one or more cursors or skip tokens are used to ensure a subsequent pagination of results may be returned.