多表联合查询方法、装置、设备及存储介质

By parsing the query statement to generate a directed acyclic graph, the query order of the data tables is automatically determined, which solves the cumbersome and error risk of multi-table joint queries in the existing technology and realizes efficient and accurate data query.

CN117609303BActive Publication Date: 2026-07-17ANT BLOCKCHAIN TECHNOLOGY (SHANGHAI) CO LTD

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
ANT BLOCKCHAIN TECHNOLOGY (SHANGHAI) CO LTD
Filing Date
2023-11-28
Publication Date
2026-07-17

AI Technical Summary

Technical Problem

In scenarios where data source queries are limited, existing technologies require developers to manually design logical execution plans for multi-table join queries, which is tedious, error-prone, and makes it difficult to effectively avoid duplicate queries and data redundancy.

Method used

By parsing the query statement, a directed acyclic graph is generated, which automatically determines the query order of the data tables and automatically generates a logical execution plan, ensuring that the queries are executed in the correct order and avoiding dependency issues between data tables.

Benefits of technology

It improves the efficiency and accuracy of multi-table join queries, reduces the workload of developers and human error, and ensures the completeness and accuracy of query results.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117609303B_ABST
    Figure CN117609303B_ABST
Patent Text Reader

Abstract

本说明书一个或多个实施例提供一种多表联合查询方法、装置、设备及存储介质。方法包括:获取用于进行多表联合查询的查询语句并进行解析;根据解析得到的为多个数据表中的至少一个数据表指定的查询条件和多个数据表中的各个数据表对应的查询方法,从多个数据表中确定与其他数据表不存在查询依赖关系的可查询数据表;将多个数据表作为节点,并按照解析得到的多个数据表之间的联合查询类型构建多个节点之间的有向边,以生成有向无环图;根据可查询数据表,确定有向无环图中的节点对应的数据表的查询顺序;按照有向无环图中的节点对应的数据表的查询顺序生成查询语句的逻辑执行计划,并利用逻辑执行计划进行数据查询。有利于提高查询准确性和效率。
Need to check novelty before this filing date? Find Prior Art