Ad Hoc Database Relation Storage Method
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing relational databases require cumbersome and error-prone hardcoding of relationships between tables, limiting flexibility and usability, especially in large databases where numerous relations exist.
Innovation Solution
A computer-implemented method for storing ad hoc relations between previously unrelated database objects assigned to different database structures, involving the definition of multiple database structures, filtering and accessing data across these structures, and storing information about selected paths and relations in an XML file.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If relationships between tables are hardcoded by the database designer, then database structure stability is improved, but adaptability and ease of operation deteriorate
Solution Approach 1:
The patent implements dynamic relationship definitions that allow relationships between database objects to be changed at runtime without requiring schema modifications. The system stores relationship definitions in a flexible format that can be modified by end users, enabling the database structure to adapt dynamically while maintaining operational stability through controlled access and validation mechanisms.
Solution Approach 2:
The patent pre-defines relationship templates and connection patterns that can be selected and applied without deep technical knowledge. By preparing relationship configurations in advance and storing them in an accessible format, the system enables users to establish relationships through simple selection rather than complex hardcoding, thus maintaining stability while improving adaptability.
2Adaptability or versatility
If database schema modifications are performed to add relationships, then relationship functionality is improved, but complexity and difficulty of implementation increase
Solution Approach 1:
The patent extracts the relationship definition mechanism from the traditional schema modification process. Instead of requiring changes to database schemas, the system separates relationship metadata into independent configuration structures that can be modified without affecting the core database schema. This extraction reduces implementation complexity while maintaining full relationship functionality.
Solution Approach 2:
The patent introduces an intermediary layer between the database objects and relationship definitions. This intermediary structure stores relationship configurations in a format that mediates between the rigid schema requirements and flexible relationship needs, allowing relationship functionality to be added without direct schema modifications and reducing overall system complexity.
3Adaptability or versatility
If Views are created to represent ad-hoc relationships, then flexibility is improved, but performance deteriorates
Solution Approach 1:
The patent creates lightweight copies of relationship definition mechanisms instead of using traditional Views. These copied relationship structures store only the essential connection information and filtering criteria without replicating full table data, providing ad-hoc flexibility while minimizing the performance overhead associated with View translations and data replication.
4Adaptability or versatility
If stored procedures are used to handle complex queries, then functionality is improved, but portability and maintenance difficulty worsen
Solution Approach 1:
The patent transforms complex query logic from hardcoded stored procedures into parameterized relationship configurations. By changing the representation from procedural code to declarative parameters and filters, the system maintains complex query functionality while dramatically improving portability across different database systems and reducing maintenance requirements through standardized configuration formats.
Data Source
AI summary
Computer implemented methods for storing ad hoc relations between previously unrelated database objects assigned to different database structures using an electronic computing device are presented, the methods including: causing the electronic computing device to define at least three database structures: structure A, structure B and structure C, where each of the at least three database structures each includes a number of objects, where there exists at least one relation between objects of structure A and objects of structure B, and where there exists at least one relation between objects of structure B and objects of structure C; filtering data of structure A; accessing structure B using a first selected relation between structure A and structure B; storing information about filtering of structure A and information on a first selected path between structure A and structure B; filtering results obtained from structure B.