Scoped Search Engine for Property Graph Databases
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data searching technologies face inefficiencies in traversing and querying large property graph databases, particularly in reducing the scope of searches to minimize power consumption and improve query performance.
Innovation Solution
A scoped search engine is developed, combining high-density memory devices with content addressable memory (CAM) technology, utilizing through-silicon vias (TSVs) for three-dimensional stacking, and incorporating a match analysis unit to combine search results and determine search scopes, thereby optimizing subsequent searches by limiting the number of records searched.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional data searching methods are used to traverse property graph databases, then complete data coverage is achieved, but power consumption increases and query performance deteriorates
Solution Approach 1:
The patent applies preliminary action by performing a first search to identify matching records before conducting a second search. The scope determination unit uses results from the first search to define a limited scope for the second search, avoiding the need to traverse the entire property graph database. This preliminary identification of relevant records reduces both power consumption and query time while maintaining complete data coverage for the specific query requirements.
2Reliability
If the entire property graph database is searched, then all possible data is retrieved, but search time increases
Solution Approach 1:
The patent segments the search process into two distinct phases: a first search that identifies initial matching records, and a second search that operates within a limited scope defined by the first search results. This segmentation allows the system to retrieve all necessary data for the query while avoiding unnecessary traversal of the entire property graph database, thereby reducing search time without compromising data retrieval completeness.
Solution Approach 2:
The first search serves as a preliminary action that identifies relevant records and defines the scope for subsequent searches. By performing this preliminary identification, the system ensures that all necessary data is captured in the limited scope search, maintaining reliability of data retrieval while significantly reducing the time required compared to searching the entire database.
3Loss of information
If multiple searches are performed without scope limitation, then comprehensive results are obtained, but the number of records processed increases power consumption
Solution Approach 1:
The first search acts as a preliminary action that identifies all records matching the initial search criteria. The scope determination unit then uses these results to define a limited scope for the second search, ensuring that all necessary information is captured while processing far fewer records than a comprehensive database search. This dramatically reduces energy consumption while maintaining search result completeness.
4Measurement precision
If iterative searching is performed across the full database, then accurate associations are found, but processing complexity increases
Solution Approach 1:
The patent segments the iterative searching process into two distinct phases with different scopes. The first search identifies initial matching records, and the second search operates within a limited scope defined by the first results. This segmentation maintains association accuracy by ensuring all relevant records are examined, while reducing processing complexity by avoiding unnecessary traversal of the entire property graph database.
Applied Scientific Principles
This section explains which scientific principles are used to turn an abstract innovation direction into a practical engineering solution.
Function Achieved in This Case
This approach enhances search efficiency by reducing power consumption and improving query performance by logically combining search results to narrow the search scope, allowing for faster and more targeted data retrieval in property graph databases.
Implementation Method 1
Each CAM cell changes the voltage on the associated match line if the storage cell stores a bit that does not match the bit represented on the attached search lines
Data Source
AI summary
A scoped search engine is disclosed. The scoped search engine includes a memory unit storing reference data records. The scoped search engine also includes a data comparison unit that searches the reference data records using different searches. The scoped search engine further includes a match analysis unit that combines result data from the different searches and determines a scope for a subsequent search based on the combined result data.