Object-Oriented Schema Search Path Optimization

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing database management systems face inefficiencies in performing queries due to computationally intensive join operations, particularly in relational databases, which can be improved by converting the relational schema into an object-oriented schema to optimize search paths.

Innovation Solution

Converting a relational database schema into an object-oriented schema that explicitly defines relationships between columns, analyzing and storing optimal search paths, and using a query engine to execute queries efficiently, supporting various query types such as finding links, shortest paths, and all paths between rows.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional join operations are used in relational databases, then data retrieval can be performed, but the computational complexity and execution time increase significantly

Engineering Contradiction:

Improvequery execution efficiencyVSAvoidsearch path computation time

Core Design Contradiction:

ProductivityVSLoss of time

Solution Approach 1:

The system performs preliminary analysis of the object-oriented schema to pre-compute and store optimal search paths between object classes before queries are executed. This preliminary action eliminates the need for complex runtime path computation, directly resolving the contradiction by preparing search paths in advance.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent introduces an intermediary layer (the pre-computed search path data structure) between the query engine and the actual data retrieval process. This intermediary stores optimized navigation paths that mediate between the high-level query and the low-level data access, reducing computational complexity while maintaining retrieval capability.

Inventive Principle:

Principle #24Intermediary (Mediator)

2Reliability

If join tables are used to explicitly define relationships, then relationships between rows can be established, but the device complexity and storage requirements increase

Engineering Contradiction:

Improverelationship definition accuracyVSAvoidschema structure complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The patent creates a simplified copy of the relationship structure in the form of an object-oriented schema with explicit navigational properties. Instead of using complex join tables, the system copies the essential relationship information into a more manageable object model that maintains relationship accuracy while reducing structural complexity.

Inventive Principle:

Principle #26Copying

Solution Approach 2:

The patent replaces the mechanical join table system with an object-oriented navigation system. The traditional mechanical approach of joining tables through common columns is substituted with object-oriented references and pre-computed search paths, simplifying the schema structure while maintaining relationship integrity.

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

3Speed

If B-Tree indices are used to avoid scanning entire tables, then search speed improves, but the computational overhead for index maintenance increases

Engineering Contradiction:

Improvedata retrieval speedVSAvoidindex maintenance energy

Core Design Contradiction:

SpeedVSUse of energy by moving object

Solution Approach 1:

The system performs preliminary computation of search paths during schema analysis rather than maintaining indices dynamically. This preliminary action shifts the computational workload from ongoing index maintenance to a one-time schema processing phase, reducing continuous energy consumption while maintaining fast retrieval speeds.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent extracts the essential navigational information from the full schema and stores it in a compact search path data structure. This extraction eliminates the need for maintaining large B-Tree indices, reducing the energy overhead for index maintenance while preserving fast data retrieval capability.

Inventive Principle:

Principle #2Taking out (Extraction)

Data Source

PatentUS9063977B2Method and system for acceleration of pathway detection and ranking within an information technology database

Publication Date: 2015.06.23 OBJECTIVITY INC

AI summary

Methods, systems and computer-readable medium for replicating the data fields used by relational join operations in transient or persistent data structures with explicit support for named relationships that may have 1:1, 1:many, many:1 or many:many cardinality. An algorithm is applied to predetermine the optional search path for finding relationships between any two rows of any of one or more tables, including relationships defined between other tables. The schema of a target relational database, either derived or input, is converted into an object-oriented schema that explicitly defines relationships between columns in the tables of the relational database and represents the tables as object classes. The schema is analyzed and optimal search paths are derived and stored for subsequent use. A query engine accesses the predefined search paths in order to execute the specific types of query listed above and incrementally populates instances of the transient or persistent structures.