Tagged Relationship Search for Enterprise Objects
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current search facilities for enterprise objects in data management systems require users to provide extensive information, leading to inefficiencies and resource wastage, especially when searching for related objects across different contexts.
Innovation Solution
A computing system that associates tags with relationships among enterprise objects, allowing for efficient searching by maintaining setup data specifying relationships and storing tag data to facilitate retrieval based on search criteria, using algorithms like Dijkstra's or logic programming to determine the manner of relation between objects.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional search facilities require users to provide extensive information to search for enterprise objects, then the search results may be more accurate, but the time and resources needed to locate desired objects increase significantly
Solution Approach 1:
The system performs preliminary action by pre-establishing relationships between enterprise objects and storing them in a database. When a search is needed, the system queries this pre-established relationship data rather than requiring users to provide extensive search criteria, thereby reducing search time while maintaining accuracy through the pre-organized data structure
Solution Approach 2:
The patent introduces an intermediary mechanism using a database as a mediator between search queries and enterprise objects. The database stores relationship information between objects, acting as an intermediate layer that translates simple search requests into accurate results without requiring users to provide extensive information directly
2Measurement precision
If traditional search facilities require extensive user information input, then search specificity may improve, but device complexity and operational difficulty increase
Solution Approach 1:
The system implements self-service by automatically utilizing pre-established relationships in the database to generate search results. The system serves itself by querying the relationship database and returning relevant objects without requiring users to manually specify extensive search criteria, thereby simplifying operation while maintaining search specificity through the automated relationship matching
3Measurement precision
If extensive relationship information is stored for all enterprise objects, then search accuracy improves, but the quantity of data and storage requirements increase
Solution Approach 1:
The patent applies local quality by storing relationship information selectively rather than universally. The database stores relationships only where they exist and are relevant, allowing the system to retrieve accurate search results through targeted queries rather than processing all possible relationships, thus reducing overall data quantity while maintaining search accuracy for relevant objects
Data Source
AI summary
A computing system provided according to an aspect of the present invention stores tags associated with relationships specified among objects. The tags can then potentially be used to search for objects of interest. In an embodiment, a search request is received indicating a first object, a second object and a search tag. A response is provided containing a sequence of objects and a sequence of relationships connecting the first object with the second object, with each relationship having an associated tag matching the search tag.