Time Dependent Search Using Technical Objects
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current enterprise application search solutions are inefficient in locating and retrieving valid time-dependent data, often consuming significant system resources and failing to include data valid in the past or future, leading to incomplete search results.
Innovation Solution
The method involves using 'technical objects' that store references to 'base objects' with stretched validity information, allowing for quick retrieval of valid time-dependent data by associating references with past or future dates, thereby filling gaps and ensuring all relevant data is accessible regardless of the search time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If conventional search methods are used to locate time dependent data in a relational database, then the search can find data within the database, but the search consumes significant time and system resources
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing validity period information in technical objects before searches are executed. When data is added or modified in base objects, the system proactively updates validity periods in corresponding technical objects, so that during search operations, the engine can immediately filter and retrieve valid time-dependent data without performing time-consuming validity checks on all records. This advance preparation significantly reduces search time and improves data retrieval efficiency.
2Reliability
If conventional search methods verify time dependent data validity, then the system can ensure data accuracy, but the verification process consumes large amounts of time and system resources
Solution Approach 1:
The patent extracts the time-dependent validity verification logic from the main search process by implementing it as a separate preprocessing mechanism. The system creates technical objects that independently store validity period information for each base object. During searches, the validation function is separated into a simple comparison operation between the search date and pre-stored validity periods, rather than requiring complex queries and conditional checks within the search engine itself. This extraction reduces system resource consumption while maintaining data validity reliability.
3Loss of information
If conventional search methods are used, then current valid data can be found, but data valid in the past or future is not included in search results
Solution Approach 1:
The patent implements universality by designing technical objects with a standardized validity period structure that can accommodate any time range (past, present, or future). Each technical object stores a begin validity date and an end validity date, creating a universal time-span representation that works for all types of time-dependent data regardless of when the data becomes valid or expires. This multi-functional time representation allows the search system to uniformly handle historical data, current data, and future data through the same mechanism, ensuring complete search results across all time periods.
4Loss of information
If the system searches throughout the entire database for time dependent data, then all potential data can be located, but significant system resources are required
Solution Approach 1:
The patent applies segmentation by dividing the database into base objects and their corresponding technical objects. Each base object (containing actual data) has an associated technical object (containing validity period metadata). This segmentation allows the search system to first filter candidates using the lightweight technical objects based on validity periods, then only retrieve and process the actual data from base objects that pass the validity filter. This divided approach ensures complete data location while significantly reducing system resource consumption by avoiding unnecessary processing of invalid records.
Data Source
AI summary
A method and system for time dependent search is described. A search manager may receive a query for time dependent information relating to a base object and a time period. The search manager may search a search optimized storage system of technical objects for a technical object that matches the query. Each technical object may include a reference to time dependent information stored by a base object and a validity period. The validity period for each technical object is chosen by time stretching logic such that valid time dependent information is available for all time periods.