Multi-join Indexes for Business Object Search Performance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The computation of joins in search and classification engines is complex and resource-intensive, affecting the overall performance of business object searches in service-oriented architectures like SAP NetWeaver's Enterprise Services Architecture.
Innovation Solution
The method generates multijoin and extended join indexes based on a metamodel defining tables connected by joins, allowing for optimized search queries by determining join paths and using surrogate identifiers to improve query execution efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If joins are computed during search operations, then search accuracy is maintained, but response time and resource consumption increase significantly
Solution Approach 1:
The patent precomputes join results and stores them in join indexes before search operations occur. The join index contains pre-established relationships between basis tables, allowing the search engine to retrieve pre-computed join results instead of performing complex join computations during query execution. This preliminary action significantly reduces response time while maintaining search accuracy.
Solution Approach 2:
The patent precomputes join results and stores them in join indexes before search operations occur. The join index contains pre-established relationships between basis tables, allowing the search engine to retrieve pre-computed join results instead of performing complex join computations during query execution. This preliminary action significantly reduces response time while maintaining search accuracy.
2Reliability
If complex join computations are performed during search, then complete data relationships are evaluated, but memory consumption and processing resources increase
Solution Approach 1:
The patent precomputes join results and stores them in join indexes before search operations occur. The join index contains pre-established relationships between basis tables, allowing the search engine to retrieve pre-computed join results instead of performing complex join computations during query execution. This preliminary action significantly reduces response time while maintaining search accuracy.
3Quantity of substance
If standard join indexes are used, then memory consumption is reduced, but response time for complex queries increases
Solution Approach 1:
The patent introduces extended join indexes that add another dimension to the data structure by including not only direct join relationships but also transitive join paths. This multi-dimensional indexing approach allows the system to answer complex queries involving multiple joins more efficiently without proportionally increasing memory consumption, as the extended index consolidates multiple join paths into a single structured representation.
Solution Approach 2:
The patent precomputes join results and stores them in join indexes before search operations occur. The join index contains pre-established relationships between basis tables, allowing the search engine to retrieve pre-computed join results instead of performing complex join computations during query execution. This preliminary action significantly reduces response time while maintaining search accuracy.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method and search system for implementing fast access to business objects in a Service Oriented Architecture. The method and search system enables near real-time update of the data used for the results. The method is based on multi-join indexes with anchor surrogate identifiers combined with extended join indexes. The method executes much faster than previous approaches and also reduces response times for complex queries.