Semantic Database Query Augmentation via Type Table Filtering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current semantic database search engines face computational inefficiencies when processing queries with multiple triples, requiring multiple passes through large collections of facts, making the identification of matching triples time-consuming.
Innovation Solution
A search augmentation system that utilizes a type table to speed up query processing by preprocessing triples with type predicates, augmenting non-type query triples with type information, and using this information to filter results, thereby reducing the need for extensive database scans.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple passes through the entire collection of triples are made for each query triple, then all query triples can be matched, but the computational expense and time required increase significantly
Solution Approach 1:
The patent pre-processes the semantic database by extracting type information from triples and organizing it into a type table data structure. This preliminary action enables the search engine to quickly filter candidates during query processing without needing to scan the entire triple collection multiple times, thus resolving the contradiction between complete query matching and processing speed.
Solution Approach 2:
The patent introduces a type table as an intermediary data structure between the raw triple collection and the query processing mechanism. This intermediary organizes type information in a way that enables efficient filtering and candidate identification, reducing the need for multiple passes through the entire database while maintaining query result completeness.
2Measurement precision
If the entire collection of triples is scanned multiple times for each query triple, then accurate matching is achieved, but computational expense increases
Solution Approach 1:
The patent performs preliminary extraction and organization of type information from the triple collection into a type table. This pre-processing step enables accurate triple matching during query execution without requiring multiple scans of the entire collection, thus reducing computational expense while maintaining matching accuracy.
Solution Approach 2:
The patent extracts type information from the triple collection and separates it into a dedicated type table structure. This extraction allows the search engine to focus computational resources only on relevant candidates identified through the type table, rather than scanning the entire collection multiple times, thereby reducing overall computational expense while preserving accuracy.
3Adaptability or versatility
If multiple passes through the database are performed for each query triple, then comprehensive search is achieved, but processing time increases
Solution Approach 1:
The patent pre-processes the database by extracting and organizing type information into a type table before query processing. This preliminary action enables comprehensive query coverage through efficient filtering during execution, eliminating the need for multiple database passes and thus reducing processing time while maintaining broad query coverage.
Solution Approach 2:
The patent introduces a type table as an intermediary structure that enables comprehensive search coverage without requiring multiple passes through the database. The type table serves as a mediator that quickly identifies relevant candidates, reducing processing time while maintaining extensive query coverage across diverse triple collections.
Data Source
AI summary
A method and system for identifying results of a query that includes a type predicate is provided. A search system maintains a collection of facts that includes a triple for each fact and a type table that maps entities of the facts to their corresponding type. The search system uses the type table to speed up the process of identifying the search results when the query includes a non-type query triple and a type query triple. A type query triple is a triple that has a type predicate, rather than a non-type predicate. To execute a query that contains a non-type query triple and a type query triple, the search system identifies the triples of the collection that match the non-type query triple. The search system then uses the type table to determine which of the identified triples match the type query triple for inclusion in the search results.