Generic Database Search Models Separating Structural and Search Containers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current enterprise search solutions face challenges such as outdated search results, increased system load, and high memory consumption due to replication-based approaches, while replication-free methods require complex management of structural and search-specific information, making them difficult to create, maintain, and update effectively.
Innovation Solution
The implementation of generic database search models that separate structural information from search specifics, using structural containers for object representation and search enabling containers to define search scope and results format, allowing for easier creation, maintenance, and modification of search models.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If replication-based approaches are used for enterprise search, then search results can be obtained, but system load increases and memory consumption increases
Solution Approach 1:
The patent extracts only the essential search model information from the replicated database structure, storing search models separately from the actual data. This allows search functionality to be maintained without replicating entire database tables, thereby reducing memory consumption while preserving search capability.
Solution Approach 2:
The patent segments the search system into distinct components: search models (stored in database tables) and search execution logic. This separation allows the system to maintain search functionality without requiring full data replication, reducing overall system memory requirements.
2Reliability
If replication-based approaches are used for enterprise search, then search results can be obtained, but system load increases
Solution Approach 1:
The patent extracts search model definitions from the replicated database structure and stores them as separate entities in database tables. This extraction eliminates the need to replicate entire database tables for search purposes, thereby reducing system load while maintaining search result availability.
3Quantity of substance
If replication-free search methods are used, then memory consumption is reduced, but structural and search-specific information management becomes complex
Solution Approach 1:
The patent creates a universal search model structure that can represent different database objects (tables, views, queries) using a common framework. This universal approach simplifies management by providing consistent methods for defining and maintaining search models across diverse data sources, reducing complexity despite the replication-free approach.
Solution Approach 2:
The patent introduces search models as intermediary entities that bridge the gap between the database structure and search functionality. These search models serve as a standardized interface layer, simplifying the management of structural and search-specific information by providing a uniform way to define search criteria across different data sources.
4Stability of the object's composition
If hierarchical database search models are used, then structural relationships are captured, but creation and maintenance becomes difficult
Solution Approach 1:
The patent segments the search model definition into distinct, manageable components stored in separate database tables (e.g., search model header, search model details, search model relationships). This segmentation allows creators to work with smaller, more manageable units while the system automatically assembles the complete structural representation, maintaining relationship accuracy while improving creation ease.
Data Source
AI summary
A computer system includes one or more database search models configured to search data contained in a plurality of database tables. The one or more database search models can include a plurality of structural containers and one or more search enabling containers. The plurality of structural containers can represent objects having a structural relationship and contain property data of the objects. The property data of the objects can be obtained from the plurality of database tables. The plurality of structural containers can be shared by the one or more database search models. The one or more search enabling containers can correspond to the one or more database search models and specify a scope for searching data and a format for presenting search results.


