Device and method for extracting graph
The graph extraction device optimizes query processing in relational databases to efficiently analyze complex data relationships, addressing the limitations of relational analytics by generating subplans with minimal computational overhead.
CA3295274A1Pending Publication Date: 2026-09-21GRAPHAI CO LTD
0 Cites 0 Cited by
Patent Information
- Application Number
- CA3295274
- Authority / Receiving Office
- CA · CA
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2025-02-27
- Filing Date
- 2025-12-10
- Publication Date
- 2026-09-21
AI Technical Summary
Technical Problem
Relational analytics struggles to efficiently analyze complex relationships between deeply interconnected data, particularly in social network analysis and recommendation systems, leading to slowed data processing rates.
Method used
A graph extraction device and method that optimizes queries to extract and visualize complex patterns from relational databases by generating subplans with the lowest computational cost, using join sharing and materialized views to minimize processing time and resource usage.
Benefits of technology
Enables efficient extraction and visualization of complex data relationships without slowing down data processing, improving analysis efficiency and reducing computational costs.
✦ Generated by Eureka AI based on patent content.
Abstract
Provided are a device and method for extracting a graph. The device for extracting a graph performs a plurality of operations including receiving one or more first join queries for extracting a graph from a relational database (RDB), extracting at least one first common subquery included in common in the one or more first join queries, generating at least one first subplan on the basis of the at least one first common subquery, generating a plurality of second subplans by joining a plurality of non-common subqueries included in the at least one first subplan to at least one second common subquery corresponding to the at least one first common subquery, determining a second subplan with a lowest cost as an optimal plan by comparing costs required for executing the plurality of second subplans, and determining the optimal plan as a graph extraction query set.
Need to check novelty before this filing date? Find Prior Art