Ordered Flat File for Hierarchical Data Query Speed
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional relational databases are inefficient in processing and accessing hierarchical data, leading to slow query processing and the inability to provide real-time information, particularly in large hierarchical structures like multi-level marketing organizations.
Innovation Solution
Creating an ordered flat file from a hierarchically organized database to maintain the hierarchical organization, allowing for faster query processing by accessing and updating the file using memory mapping and an overflow area for real-time updates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If standard relational database access techniques are used to access hierarchical data, then data can be accessed and processed, but query processing becomes slow especially when the hierarchical structure is large
Solution Approach 1:
The patent segments hierarchical data access into two parts: a flat file containing the hierarchical structure and data, and a separate indexing mechanism. This segmentation allows the main data to be accessed sequentially without complex relational joins, significantly improving query speed while maintaining data integrity through the index.
Solution Approach 2:
The patent creates a flat file copy of the hierarchical data that maintains the parent-child relationships in a linear format. This copy enables direct sequential access to hierarchical data without requiring complex database queries, thus improving access speed while the original database structure remains intact for updates.
2Loss of time
If conventional databases are used to store hierarchical data, then data can be stored and accessed, but real-time information such as commissions cannot be provided
Solution Approach 1:
The patent performs preliminary actions by pre-calculating and storing hierarchical relationships and derived data (such as commission structures) in the flat file before queries are executed. This allows real-time retrieval of computed values without performing complex calculations during query processing, eliminating delays in providing real-time information.
Solution Approach 2:
The flat file acts as an intermediary between the hierarchical database and query processing. It pre-structures the data in a format optimized for sequential access and real-time queries, mediating between the stored hierarchical data and the need for rapid real-time information retrieval.
3Adaptability or versatility
If hierarchical data is stored in a relational database table, then standard database techniques can be used, but the number and type of real-time applications are limited
Solution Approach 1:
The patent creates a universal flat file format that can serve multiple application types simultaneously. The same flat file structure supports various hierarchical data types (organizational structures, product hierarchies, etc.) and multiple query patterns, making the system adaptable to diverse real-time applications while maintaining fast access speeds through its linear structure.
Data Source
AI summary
Access to hierarchical data stored in a database is facilitated by using an ordered flat file that maintains the hierarchical organization of the data. Queries against the hierarchical data are processed by accessing the ordered flat file rather than the underlying database. The speed of accessing the ordered flat file is increased by using memory mapping the ordered flat file. Changes to the data in the underlying database are reflected in real-time without regenerating the ordered flat file by employing an overflow area for storing changes to elements that cannot be made within the ordered flat file.