Paginated Database Search with Condensed Hierarchical Views
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing database systems face challenges in efficiently providing paginated search results from hierarchically arranged data, particularly in handling large datasets and visualizing statistics across multiple levels of a hierarchy, which complicates filtering, sorting, and monitoring attributes.
Innovation Solution
A computer-implemented system and method that filters records in a multi-table database based on constraints and monitoring attributes, generates a condensed view by removing unnecessary columns, and incorporates level indicators to facilitate paginated search results, enabling efficient data retrieval and display of monitoring attributes across hierarchical levels.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If all columns are retained in the database view for complete data access, then data completeness is improved, but data processing efficiency and storage efficiency deteriorate
Solution Approach 1:
The patent extracts and removes unnecessary columns from the database view, keeping only the minimal required columns (record identifying column and level indicator column) to maintain data completeness while improving processing efficiency. This selective extraction resolves the contradiction by taking out only what is needed.
Solution Approach 2:
The patent segments the data access process into two stages: first accessing the condensed view with minimal columns for efficient filtering and sorting, then accessing monitoring attributes separately for the final n records. This segmentation allows different parts of the data to be accessed at different granularities, resolving the efficiency-completeness contradiction.
2Measurement precision
If filtering and sorting operations are performed on the complete dataset for each pagination request, then result accuracy is improved, but processing time and system resource consumption deteriorate
Solution Approach 1:
The patent performs filtering and sorting operations once on the condensed view to create a pre-ordered, pre-filtered dataset. This preliminary action ensures result accuracy is maintained while dramatically reducing processing time for subsequent pagination requests, as the heavy computational work is done only once.
Solution Approach 2:
The patent applies filtering and sorting to the condensed view (a partial subset of the full data requirements) rather than the complete dataset with all monitoring attributes. This partial action is sufficient to establish the correct order and filter results, avoiding the excessive processing that would result from operating on the full dataset for each pagination request.
3Loss of information
If monitoring attributes are accessed for all records in the hierarchy, then comprehensive monitoring information is improved, but memory usage and processing overhead deteriorate
Solution Approach 1:
The patent extracts and accesses monitoring attributes only for the final n records that are displayed on the current page, rather than loading monitoring attributes for all records in the hierarchy. This selective extraction reduces memory usage while maintaining monitoring information completeness for the visible results.
Solution Approach 2:
The patent accesses monitoring attributes for only the necessary subset of records (the final n records to be displayed) rather than all records. This partial action is sufficient to provide comprehensive monitoring information for the current view while avoiding the excessive memory consumption of loading all monitoring data.
4Measurement precision
If the database structure maintains all hierarchical levels and attributes explicitly, then data query accuracy is improved, but device complexity and query processing time deteriorate
Solution Approach 1:
The patent extracts the essential hierarchical structure (record identifying column and level indicator column) from the complex multi-level database, creating a simplified condensed view that maintains query accuracy while reducing structural complexity. The detailed hierarchical attributes are accessed only when needed for monitoring.
Solution Approach 2:
The patent segments the database structure into two parts: a condensed view containing the essential hierarchical framework for accurate querying, and separate monitoring attribute storage for detailed information. This segmentation reduces overall complexity while maintaining query accuracy through the preserved hierarchical structure in the condensed view.
Data Source
AI summary
Computer-implemented systems and methods provide paginated search results from a multi-table database that stores hierarchically arranged data nodes. A query request is received that identifies one or more constraints and one or more monitoring attributes. Records of the multi-table database are filtered to create a view containing only records which meet the constraints. Monitoring attributes associated with a first n records of the view are accessed to generate an output view, where n is the number of records that may be displayed on a single page, and the output view is displayed on a user-viewable medium.