Object Index Determination in Unordered Sequences
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for determining the index of an object in a sequence of objects are inefficient, especially when exact matches are not found, and when sequences are not ordered or constraints do not match, leading to high computational costs and data access inefficiencies.
Innovation Solution
A computer-implemented method that constructs a reversed query to find objects preceding or matching a given object, checks for exact matches, and if not found, determines the closest object by comparing positions P and P+1, and if empty, selects the first or last object in the sequence based on system configuration.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If a linear search is performed to find the index of an object in a sequence, then the method is simple to implement, but the computational cost and data access steps increase significantly when exact matches are not found or sequences are unordered
Solution Approach 1:
The patent inverts the search approach by constructing a reversed query Q' that returns objects in reverse order. By searching for the first object in the reversed sequence that matches or precedes the target object, the system efficiently determines the index position without performing a complete linear search through the entire sequence, thus resolving the contradiction between implementation simplicity and computational efficiency
2Loss of energy
If the system requests only fragments of query results at a time, then transmission and storage performance improve, but determining the index of objects not available at the current fragment index becomes time-consuming
Solution Approach 1:
The patent performs preliminary actions by constructing a specialized reversed query Q' that directly targets the position information needed. Instead of sequentially moving through fragments to find an object's index, the system prepares and executes a targeted query that retrieves the necessary position information in advance, reducing the time lost in index determination while maintaining fragment-based efficient transmission and storage
3Speed
If databases include nested records with previous/next references, then object navigation becomes efficient, but the references would have to be rebuilt with each ordering of the sequence, increasing device complexity
Solution Approach 1:
The patent introduces an intermediary approach by using the reversed query Q' as a mediator between the target object and its position in the sequence. Instead of maintaining direct nested references that require rebuilding, the system uses the reversed query mechanism to indirectly determine position information, achieving efficient navigation without the complexity of maintaining and rebuilding reference structures
Data Source
AI summary
A computer-implemented method for determining an index of an object in a sequence of objects. It is frequently needed to determine an index of an object in a sequence for example in order to request the next object in the sequence. Typically, databases do not include nested records that reference previous/next records. The method provides an improved process for determining an index of an object in a sequence of objects, which may also, in case of no exact match for requested object, provide an index of the object closest to the requested one.