Information Management System Using Path Information for Efficient Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional methods for managing relations between information items in different tables require manual redesign of database structures for each change, leading to inefficient access operations and inability to use past-defined relations for future simulations or modifications, and do not allow for flexible retrieval interface changes.
Innovation Solution
An information management system that uses path information to establish correspondences between tables, allowing for automatic creation and management of master, relating pin, and access path tables based on an information model, enabling efficient retrieval and flexible management of relations across multiple periods.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If manual redesign of database structures is conducted for each change in relations between information items, then the database can accommodate new relations, but the work量和 time required increases significantly
Solution Approach 1:
The system performs preliminary actions by automatically generating database table definitions, relation definitions, and access path definitions from an information model before actual database operations. This automation eliminates the need for manual redesign when relations change, as the system can regenerate these definitions automatically based on updated information models.
Solution Approach 2:
The system creates copies of relation definitions and access path definitions that can be independently managed and modified. When relations between information items change, the system can copy and modify these definitions without affecting the original database structure, enabling rapid adaptation to changes.
2Reliability
If sequential access operations are performed through multiple hierarchic levels of relations, then target information can be retrieved, but the number of access operations increases and efficiency decreases
Solution Approach 1:
The system performs preliminary actions by pre-defining access paths between tables in the access path definition table. These access paths specify the most efficient routes for retrieving information across multiple hierarchic levels, allowing the retrieval processing unit to execute queries without performing sequential access operations through all intermediate levels.
Solution Approach 2:
The access path definition table acts as an intermediary between the information model and the actual database access operations. It contains pre-computed access paths that mediate the retrieval process, enabling the system to jump directly to target information without traversing all intermediate relation levels sequentially.
3Ease of operation
If database tables are designed with shared attributes for relations between classes, then retrieval operations can be performed, but the database design becomes complex and inflexible to changes
Solution Approach 1:
The system segments the database design into separate, manageable components: master table definitions, relation definitions, and access path definitions. Each component is stored in a separate table and can be independently modified. This segmentation reduces complexity by allowing changes to one aspect without affecting others, while still enabling retrieval operations through the coordinated use of these segmented components.
Solution Approach 2:
The system introduces dynamics by allowing the information model, relation definitions, and access path definitions to be modified independently and automatically regenerated. This dynamic approach enables the database structure to adapt to changing requirements without manual redesign, maintaining ease of operation while reducing structural complexity.
4Adaptability or versatility
If relations between information items are changed, then new relations can be established, but the retrieval interface of application programs must be changed depending on cases
Solution Approach 1:
The system creates a universal retrieval interface that works with any relation configuration through the use of the access path definition table. This table contains generic access path information that can accommodate different relation structures without requiring changes to the application program interface. The retrieval processing unit uses this universal interface to execute queries regardless of the specific relations defined in the information model.
Data Source
AI summary
To obtain information having a relation, it is required for an application program to execute retrieval processing in which the program first acquires key information supervising relations between tables to sequentially trace the relations to finally obtain the target information. Since it is required for the program to execute as many access operations as there are hierarchic level of relations, the access efficiency is lowered. By establishing a correspondence between first relating information representing relations between a first table and a second table and second relating information, path information representing hierarchic structure of data between a plurality of tables is stored in a storage. Various processings are executed by use of the path information.