Searchable Index With Object Graph For Database Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Service providers face challenges in optimizing search and access to persistent storage due to the lack of rapid search and retrieval capabilities in existing database systems, particularly in relational databases with complex relationships.
Innovation Solution
A method and apparatus for generating a searchable index with an attached object graph, where data objects from a database are converted to searchable columns and object graphs, enabling efficient text searches and maintaining structural relationships.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If traditional relational databases are used for persistent storage, then basic retrieval and data management functions are provided, but search and access speed is slow
Solution Approach 1:
The patent divides the database into two separate components: a relational database for structured data storage and a search index for rapid text search. This segmentation allows each component to be optimized independently - the relational database maintains ACID properties and structured relationships, while the search index provides fast full-text search capability through inverted indexes and document term frequencies.
Solution Approach 2:
The patent introduces an intermediary search index layer between user queries and the relational database. This intermediary component receives search queries, performs fast text matching using inverted indexes, and returns relevant document identifiers that are then used to retrieve actual data from the relational database, thereby decoupling the search operation from the data retrieval operation.
2Ease of operation
If object relational mapping is used to convert data objects to searchable columns, then searchability is improved, but structural relationships may be lost
Solution Approach 1:
The patent embeds object graph information within the search index structure itself. Each indexed document entry contains nested fields that preserve the object's structural relationships, allowing the search index to serve dual purposes: enabling fast text search while maintaining the complete object structure and relationships for accurate retrieval and display.
Solution Approach 2:
The patent performs preliminary conversion of data objects to searchable columns and object graphs during the indexing process. This preliminary action creates a rich, structured representation that includes both search keywords and complete object relationships before actual queries are executed, ensuring that search results maintain full structural integrity.
3Productivity
If data is retrieved from persistent storage, then access is enabled, but inconsistencies in database queries occur
Solution Approach 1:
The patent implements feedback mechanisms that track changes in the relational database and automatically update the search index accordingly. When data is inserted, updated, or deleted in the relational database, the system receives feedback about these changes and synchronizes the search index to reflect the current state, ensuring consistency between the database and search results.
Solution Approach 2:
The patent replaces traditional mechanical database querying with a two-stage process: first using the search index to identify relevant documents through fast text matching, then using the relational database to retrieve and validate actual data with proper transaction control and consistency guarantees, combining the speed of index-based search with the reliability of relational database transactions.
Data Source
AI summary
An approach is provided for generating a searchable index including an associated object graph. Data objects of a database are converted into corresponding rows in a set of searchable columns. An object graph corresponding to each row of the searchable columns are determined. An index including the set of searchable columns and the corresponding object graphs are generated.