CN113609282A - Drawing method of automatic drawing engine - Google Patents

Drawing method of automatic drawing engine Download PDF

Info

Publication number
CN113609282A
CN113609282A CN202110908225.7A CN202110908225A CN113609282A CN 113609282 A CN113609282 A CN 113609282A CN 202110908225 A CN202110908225 A CN 202110908225A CN 113609282 A CN113609282 A CN 113609282A
Authority
CN
China
Prior art keywords
node
data
information
nodes
graph
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110908225.7A
Other languages
Chinese (zh)
Inventor
蒋培
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Digital China Financial Software Co ltd
Original Assignee
Digital China Financial Software Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Digital China Financial Software Co ltd filed Critical Digital China Financial Software Co ltd
Priority to CN202110908225.7A priority Critical patent/CN113609282A/en
Publication of CN113609282A publication Critical patent/CN113609282A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/36Creation of semantic tools, e.g. ontology or thesauri
    • G06F16/367Ontology
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/33Querying
    • G06F16/338Presentation of query results

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Animal Behavior & Ethology (AREA)
  • User Interface Of Digital Computer (AREA)

Abstract

本发明提供的一种自动绘图引擎的绘图方法,所述绘图方法包括:采用金融知识图谱获取基础数据,所述基础数据包括实体节点的基本信息、关系边的基本信息和实体节点与边的汇总数据;采用自定义样式和自定义布局算法完成图谱数据的展示;调用图谱服务的api获取所述图谱数据中的节点数据信息;对所述节点数据信息进行分析计算处理,获得节点坐标。结合了知识图谱的概念,图谱数据作为数据源,动态计算各个数据项的坐标信息,快速形成图谱讯息展示所需要的要素。能实现多层次的数据信息展示,能够按照层级以及数据链路展示,不同类型的数据使用的图标,整体信息展示对比度明显。提升了用户的体验。

Figure 202110908225

The present invention provides a drawing method for an automatic drawing engine. The drawing method includes: using a financial knowledge graph to obtain basic data, where the basic data includes basic information of entity nodes, basic information of relationship edges, and a summary of entity nodes and edges The display of the graph data is completed by using a custom style and a custom layout algorithm; the api of the graph service is called to obtain the node data information in the graph data; the node data information is analyzed and calculated to obtain the node coordinates. Combined with the concept of knowledge graph, graph data is used as a data source to dynamically calculate the coordinate information of each data item, and quickly form the elements required for graph information display. It can realize multi-level data information display, can be displayed according to levels and data links, icons used for different types of data, and the overall information display contrast is obvious. Improve user experience.

Figure 202110908225

Description

Drawing method of automatic drawing engine
Technical Field
The invention relates to the field of finance, in particular to a drawing method of an automatic drawing engine.
Background
The IT architecture automatic drawing engine provides intelligent IT architecture display for the interior of a bank, forms a uniform IT architecture view by combining the thought and concept of a financial knowledge map, realizes the relationship link display of application and application, application and functional modules and application and interfaces, provides a query function according to application information and application types and a dynamic screening function of relationships among nodes, and also supports the layered drilling of node information.
The existing internal application system information of each bank is basically stored in a document structure, and tabular data is mostly adopted for collection and arrangement. The relationship between application systems in multiple dimensions cannot be intuitively shown.
In the prior art, the realization or information collection can only collect and display the incidence relation of one level, and the multi-level relation display cannot be realized. The information display form is mostly displayed in a data table form, and the global view and the multi-dimensional detail display are lacked.
Disclosure of Invention
In view of the above, the present invention has been made to provide a drawing method of an automatic drawing engine that overcomes or at least partially solves the above problems.
According to an aspect of the present invention, there is provided a drawing method of an automatic drawing engine, the drawing method including:
acquiring basic data by adopting a financial knowledge graph, wherein the basic data comprises basic information of entity nodes, basic information of relation edges and summarized data of the entity nodes and the edges; the method comprises the following steps of finishing display of map data by adopting a custom style and a custom layout algorithm;
calling an api of a graph service to acquire node data information in the graph data;
analyzing, calculating and processing the node data information to obtain node coordinates;
and drawing a graph page according to the node coordinates.
Optionally, the node data information specifically includes: node (n) is n node information, edge (m) is m edge information, and map (node, num (edge)) is the number of edges associated with a node, num (edge).
Optionally, the financial knowledge graph is used to obtain basic data, where the basic data includes basic information of entity nodes, basic information of relationship edges, and summarized data of the entity nodes and the edges; the method for finishing the display of the map data by adopting the custom style and the custom layout algorithm specifically comprises the following steps:
local refreshing is adopted, each time the canvas is refreshed, the canvas of the last time is cached with the expanded node information, cache data are obtained, and the cache data are refreshed on the canvas;
the node information adopts a design of a self-defined icon and a gradient background color, and configures a semantic icon according to the node attribute;
the design of a right mouse button is adopted, so that a user can add and delete the data and hide the rendered data according to the condition of the edge;
according to different node types, the information of the nodes is dynamically presented, and the unified viewing management of various node type information is realized;
the switch controls the search, including the functions of single node queries, queries between two nodes, node type consanguineous queries, and other contextualized queries.
Optionally, the drawing the graph page according to the node coordinates specifically includes:
judging whether a query condition exists, if so, taking the central node as a main node of the query condition, and taking the main node as a canvas center; otherwise, taking the node with the maximum number of the relational edges as a canvas center node;
selecting the number of relation edges of the nodes, and dividing the number of the layers of the nodes by a modulo 12;
dividing node information according to the number of layers and calculating node coordinates;
sequentially traversing information from more to less according to the number of edge relations, and calculating node coordinates;
judging whether non-leaf nodes are not calculated, if so, returning to the step of selecting the number of relation edges of the nodes, and modulo 12 dividing the number of layers of the nodes; otherwise, traversing all nodes is finished.
The invention provides a drawing method of an automatic drawing engine, which comprises the following steps: acquiring basic data by adopting a financial knowledge graph, wherein the basic data comprises basic information of entity nodes, basic information of relation edges and summarized data of the entity nodes and the edges; the method comprises the following steps of finishing display of map data by adopting a custom style and a custom layout algorithm; calling an api of a graph service to acquire node data information in the graph data; and analyzing, calculating and processing the node data information to obtain node coordinates. The concept of the knowledge graph is combined, graph data are used as data sources, the coordinate information of each data item is dynamically calculated, and elements required by graph message display are quickly formed. The multi-level data information display can be realized, the display can be carried out according to the levels and the data links, the icons used by different types of data are displayed, and the contrast of the whole information display is obvious. The user experience is improved.
The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a flowchart of a method for drawing a graph page according to the node coordinates according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The terms "comprises" and "comprising," and any variations thereof, in the present description and claims and drawings are intended to cover a non-exclusive inclusion, such as a list of steps or elements.
The technical solution of the present invention is further described in detail with reference to the accompanying drawings and embodiments.
As shown in fig. 1, a drawing method of an automatic drawing engine, the drawing method comprising:
acquiring basic data by adopting a financial knowledge graph, wherein the basic data comprises basic information of entity nodes, basic information of relation edges and summarized data of the entity nodes and the edges; the method comprises the following steps of finishing display of map data by adopting a custom style and a custom layout algorithm; the node data information specifically includes: node (n) is n node information, edge (m) is m edge information, and map (node, num (edge)) is the number of edges associated with a node, num (edge).
Local refreshing is adopted, each time the canvas is refreshed, the canvas of the last time is cached with the expanded node information, cache data are obtained, and the cache data are refreshed on the canvas;
the node information adopts a design of a self-defined icon and a gradient background color, and configures a semantic icon according to the node attribute;
the design of a right mouse button is adopted, so that a user can add and delete the data and hide the rendered data according to the condition of the edge;
according to different node types, the information of the nodes is dynamically presented, and the unified viewing management of various node type information is realized;
the switch controls the search, including the functions of single node queries, queries between two nodes, node type consanguineous queries, and other contextualized queries.
Calling an api of a graph service to acquire node data information in the graph data;
analyzing, calculating and processing the node data information to obtain node coordinates;
drawing a graph page according to the node coordinates, judging whether a query condition exists, if so, taking a central node as a main node of the query condition, and taking the main node as a canvas center; otherwise, taking the node with the maximum number of the relational edges as a canvas center node;
selecting the number of relation edges of the nodes, and dividing the number of the layers of the nodes by a modulo 12;
dividing node information according to the number of layers and calculating node coordinates;
sequentially traversing information from more to less according to the number of edge relations, and calculating node coordinates;
judging whether non-leaf nodes are not calculated, if so, returning to the step of selecting the number of relation edges of the nodes, and modulo 12 dividing the number of layers of the nodes; otherwise, traversing all nodes is finished.
Has the advantages that:
1, Page function and Style
And dynamically increasing nodes in the canvas, and realizing local refreshing of the newly added nodes in the interface by caching the node coordinates of the current canvas through codes.
The user interaction experience is enriched, and the design of 'right mouse button' which accords with the public is adopted, so that the user can add, delete, hide and present rendering data according to the conditions of the sides.
A user operates a mouse to check a plurality of information of the nodes, and the information of the nodes is dynamically presented according to different node types, namely, the unified checking management of the information of various node types is realized.
And on the left side of the interface, the display and the hiding of the search area are controlled through a switch. Provides the functions of single node query, query between two nodes, node type consanguineous query and other scenario query, and the user can select the corresponding query according to the requirement
2, node presentation effects
The icons of the multi-style nodes and the gradient unique display modes clearly and friendly distinguish the nodes represented by the different types of entities.
And 3, independently realizing a coordinate algorithm.
And taking a modulus k according to the relation quantity of the nodes and the edges, and judging the drawing levels, namely k lower nodes of the first level, k/2 lower nodes which are 2 times of R (the selected node is the center R and is the radius). k/2 lower points of 1 times R. And every more than K nodes are divided into a hierarchy, and the number of the nodes is twice the radius R of the previous node. If the number of the actual relation sides is less than K, the circle is equally divided according to the number K of the actual relation sides.
The above embodiments are provided to further explain the objects, technical solutions and advantages of the present invention in detail, it should be understood that the above embodiments are merely exemplary embodiments of the present invention and are not intended to limit the scope of the present invention, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.

Claims (4)

1.一种自动绘图引擎的绘图方法,其特征在于,所述绘图方法包括:1. a drawing method of automatic drawing engine, is characterized in that, described drawing method comprises: 采用金融知识图谱获取基础数据,所述基础数据包括实体节点的基本信息、关系边的基本信息和实体节点与边的汇总数据;采用自定义样式和自定义布局算法完成图谱数据的展示;The basic data is obtained by using the financial knowledge graph, and the basic data includes the basic information of entity nodes, the basic information of relationship edges, and the summary data of entity nodes and edges; the display of graph data is completed by using a custom style and a custom layout algorithm; 调用图谱服务的api获取所述图谱数据中的节点数据信息;Call the api of the graph service to obtain the node data information in the graph data; 对所述节点数据信息进行分析计算处理,获得节点坐标;Perform analysis and calculation processing on the node data information to obtain node coordinates; 根据所述节点坐标绘制图形页面。Drawing a graphics page according to the node coordinates. 2.根据权利要求1所述的一种自动绘图引擎的绘图方法,其特征在于,所述节点数据信息具体包括:node(n)为n个node节点信息,,edge(m)为m条边信息,map(node,num(edge))为与node节点相关的边数量为num(edge)。2. The drawing method of an automatic drawing engine according to claim 1, wherein the node data information specifically comprises: node(n) is information of n nodes, and edge(m) is m edges Information, map(node,num(edge)) is the number of edges associated with the node node is num(edge). 3.根据权利要求1所述的一种自动绘图引擎的绘图方法,其特征在于,所述采用金融知识图谱获取基础数据,所述基础数据包括实体节点的基本信息、关系边的基本信息和实体节点与边的汇总数据;采用自定义样式和自定义布局算法完成图谱数据的展示具体包括:3. The drawing method of an automatic drawing engine according to claim 1, wherein the basic data is obtained by using a financial knowledge graph, and the basic data includes basic information of entity nodes, basic information of relationship edges and entities Summary data of nodes and edges; the display of graph data using custom styles and custom layout algorithms includes: 采用局部刷新,每次画布刷新,将上一次画布以展开的节点信息,进行缓存,获得缓存数据,将所述缓存数据刷新至画布上;Partial refresh is adopted, and each time the canvas is refreshed, the last canvas is cached with the expanded node information, the cached data is obtained, and the cached data is refreshed on the canvas; 所述节点信息采用自定义的icon加渐变背景色的设计,根据节点属性,配置语义化的icon;The node information adopts the design of a self-defined icon and a gradient background color, and configures a semantic icon according to the node attribute; 采用“鼠标右键”的设计,供用户去在增加删除,隐藏根据边的条件去呈现渲染数据;The design of "right mouse button" is adopted for users to add and delete, and hide the rendering data according to the conditions of the edge; 根据不同的节点类型,节点的信息动态呈现,实现了多种节点类型信息的统一查看管理;According to different node types, the information of the nodes is dynamically presented, which realizes the unified viewing and management of the information of various node types; 开关控制搜索,包括单个节点的查询、两个节点间的查询、节点类型的血缘查询以及其他场景化查询的功能。The switch controls the search, including the query of a single node, the query between two nodes, the blood relationship query of node types, and other scene-based query functions. 4.根据权利要求1所述的一种自动绘图引擎的绘图方法,其特征在于,所述根据所述节点坐标绘制图形页面具体包括:4. The drawing method of an automatic drawing engine according to claim 1, wherein the drawing a graphic page according to the node coordinates specifically comprises: 判断是否有查询条件,如果是,将中心节点作为查询条件的主节点,所述主节点作为画布中心;否则,以关系边数量最多的节点作为画布中心节点;Judging whether there is a query condition, if so, the central node is used as the main node of the query condition, and the main node is used as the canvas center; otherwise, the node with the largest number of relationship edges is used as the canvas central node; 选择节点的关系边数量取模12划分节点的层数;Select the number of relationship edges of the node to be modulo 12 to divide the number of layers of the node; 根据层数划分节点信息,并计算节点坐标;Divide the node information according to the number of layers, and calculate the node coordinates; 依次按照边关系数量从多到少遍历信息,计算节点坐标;Traverse the information in turn according to the number of edge relationships from more to less, and calculate the node coordinates; 判断是否还有非叶子节点未计算,如果是,返回到步骤选择节点的关系边数量取模12划分节点的层数;否则,遍历所有节点结束。Determine whether there are any non-leaf nodes that have not been calculated. If so, return to the step to select the number of relational edges of the node and take the modulo 12 to divide the number of layers of the node; otherwise, traverse all the nodes and end.
CN202110908225.7A 2021-08-09 2021-08-09 Drawing method of automatic drawing engine Pending CN113609282A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110908225.7A CN113609282A (en) 2021-08-09 2021-08-09 Drawing method of automatic drawing engine

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110908225.7A CN113609282A (en) 2021-08-09 2021-08-09 Drawing method of automatic drawing engine

Publications (1)

Publication Number Publication Date
CN113609282A true CN113609282A (en) 2021-11-05

Family

ID=78339973

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110908225.7A Pending CN113609282A (en) 2021-08-09 2021-08-09 Drawing method of automatic drawing engine

Country Status (1)

Country Link
CN (1) CN113609282A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115079916A (en) * 2022-06-15 2022-09-20 广州市玄武无线科技股份有限公司 Visual integrated editing canvas drawing method, system, terminal equipment and medium
CN117076682A (en) * 2023-07-24 2023-11-17 企查查科技股份有限公司 Knowledge graph generation method and generation equipment

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019057190A1 (en) * 2017-09-25 2019-03-28 腾讯科技(深圳)有限公司 Method and apparatus for displaying knowledge graph, terminal device, and readable storage medium
CN111259297A (en) * 2020-01-14 2020-06-09 清华大学 Interaction visualization method, platform and system for knowledge graph
CN112035708A (en) * 2020-07-13 2020-12-04 第四范式(北京)技术有限公司 Knowledge graph display method and device, computer device and readable storage medium
CN112052343A (en) * 2020-09-11 2020-12-08 北京中亦安图科技股份有限公司 Knowledge graph display method and device, electronic equipment and storage medium
CN112507036A (en) * 2020-11-30 2021-03-16 武汉烽火众智数字技术有限责任公司 Knowledge graph visualization analysis method
CN112597317A (en) * 2021-01-11 2021-04-02 西藏民族大学 Knowledge graph visualization method and system

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019057190A1 (en) * 2017-09-25 2019-03-28 腾讯科技(深圳)有限公司 Method and apparatus for displaying knowledge graph, terminal device, and readable storage medium
CN111259297A (en) * 2020-01-14 2020-06-09 清华大学 Interaction visualization method, platform and system for knowledge graph
CN112035708A (en) * 2020-07-13 2020-12-04 第四范式(北京)技术有限公司 Knowledge graph display method and device, computer device and readable storage medium
CN112052343A (en) * 2020-09-11 2020-12-08 北京中亦安图科技股份有限公司 Knowledge graph display method and device, electronic equipment and storage medium
CN112507036A (en) * 2020-11-30 2021-03-16 武汉烽火众智数字技术有限责任公司 Knowledge graph visualization analysis method
CN112597317A (en) * 2021-01-11 2021-04-02 西藏民族大学 Knowledge graph visualization method and system

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115079916A (en) * 2022-06-15 2022-09-20 广州市玄武无线科技股份有限公司 Visual integrated editing canvas drawing method, system, terminal equipment and medium
CN117076682A (en) * 2023-07-24 2023-11-17 企查查科技股份有限公司 Knowledge graph generation method and generation equipment

Similar Documents

Publication Publication Date Title
EP3188043B1 (en) Indirect filtering in blended data operations
US8970595B2 (en) Display and interaction with multidimensional data
US10140325B2 (en) Data source identification mapping in blended data operations
US10713236B2 (en) Systems and methods for analysis of data stored in a large dataset
Wise et al. Regionalisation tools for the exploratory spatial analysis of health data
US10579678B2 (en) Dynamic hierarchy generation based on graph data
US20110264650A1 (en) Methods and Systems for Filtering Data for Interactive Display of Database Data
US10268737B2 (en) System and method for performing blended data operations
US9547646B2 (en) User-created members positioning for OLAP databases
US20150278315A1 (en) Data fitting selected visualization type
US20060190432A1 (en) System and method for graphically distinguishing levels of a multidimensional database
EP3340078B1 (en) Interactive user interface for dynamically updating data and data analysis and query processing
US8707200B2 (en) Object browser with proximity sorting
Korpi et al. Clutter reduction methods for point symbols in map mashups
CN113609282A (en) Drawing method of automatic drawing engine
US8788956B2 (en) Symbolic tree node selector
US20240104112A1 (en) Identity resolution in knowledge graph databases
CN115658779B (en) Population data display method and device
Zhou et al. Design and implementation of multi-scale databases
Li et al. Supporting large-scale geographical visualization in a multi-granularity way
CN107341221B (en) Index structure establishing and associated retrieving method, device, equipment and storage medium
US20230418846A1 (en) User-defined graphical hierarchies
Bereuter et al. Content zooming and exploration for mobile maps
US9116603B2 (en) Managing interactions with data having membership in multiple groupings
Migliorini et al. CoPart: a context-based partitioning technique for big data

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20211105