CN114637811A - Method, device, device and storage medium for generating entity relationship diagram of data table - Google Patents

Abstract

The invention relates to an artificial intelligence technology, and discloses a data table entity relation graph generation method, which comprises the following steps: acquiring indexes and index types of all data tables in a preset database, and inquiring the data tables according to the indexes to obtain inquiry results; when the data tables are judged to have correlation according to the query result, analyzing the data tables with correlation according to the index and the index type to obtain a main table and a sub table and a corresponding relation between the main table and the sub table; and generating an entity relation graph by using a preset drawing tool according to the corresponding relation. In addition, the invention also relates to a block chain technology, and the data table can be stored in the node of the block chain. The invention also provides a data table entity relation graph generating device, electronic equipment and a storage medium. The invention can improve the efficiency of obtaining the data table relation.

Description

Method, device, device and storage medium for generating entity relationship diagram of data table

technical field

The present invention relates to the technical field of artificial intelligence, and in particular, to a method, apparatus, electronic device and computer-readable storage medium for generating an entity relationship diagram of a data table.

Background technique

With the development of the Internet, there are more and more data tables in the database, and it is more and more difficult to view the table relationships in the database.

Historically, the table relationships in the database were identified by foreign key relationships. To understand the underlying data storage structure of a project, ER relationship diagrams can be established directly based on foreign keys. With the increase of Internet users, the extensive use of foreign key relationships will make data The table structure involves too much, making the program unable to manipulate data flexibly.

The foreign key in the existing database has basically been abandoned, and the direct relationship between the table and the table is no longer strongly related by the database, but the relationship between the data is controlled by the code. The developer needs to enter from the page layer by layer, find the interface, and use the interface. Find the way and location of data landing, and use the data relationship design diagram and the assistance of related business personnel to obtain the data relationship of a project.

To sum up, the current method of obtaining the relationship of the data table is inefficient.

SUMMARY OF THE INVENTION

The present invention provides a method, a device and a computer-readable storage medium for generating an entity relationship diagram of a data table, the main purpose of which is to solve the problem of low efficiency of the method for obtaining the relationship of the data table.

To achieve the above purpose, a method for generating a data table entity relationship diagram provided by the present invention includes:

Obtain indexes and index types of all data tables in the preset database, query the data tables according to the indexes, and obtain query results;

When judging that there is an association between the data tables according to the query result, analyze the associated data table according to the index and the index type to obtain the main table and the sub-table, and the main table and the sub-table Correspondence between;

According to the corresponding relationship, an entity relationship diagram is generated by using a preset drawing tool.

Optionally, the querying the data table according to the index to obtain a query result includes:

Select the primary key index in the index of any data table in the database;

Select non-primary key indexes in the indexes of other data tables in the database;

Matching the primary key index with the non-primary key index to obtain a query result.

Optionally, according to the index and the index type, analyzing the associated data tables to obtain the main table and the sub-table and the corresponding relationship between the main table and the sub-table, including:

According to the index and the index type, analyze the associated data table to obtain an equijoin calculation result and a data table relationship type;

Classify the associated data tables according to the calculation result of the equi-join to obtain a main table and a sub-table;

The corresponding field information in the main table and the sub-table is extracted, and the corresponding relationship between the main table and the sub-table is obtained by using the field information, the index, and the relationship type of the data table.

Optionally, according to the index and the index type, analyze the associated data table to obtain an equijoin calculation result, including:

Select the primary key index in the index of the associated data table in the database;

Selecting non-primary key indexes in the indexes of other associated data tables in the database;

Using a preset SQL script, perform an equijoin calculation on the data table according to the primary key index and the non-primary key index, and obtain an equijoin calculation result.

Optionally, classifying the associated data tables according to the equi-join calculation results, to obtain a main table and a sub-table, including:

Select the data table with many times in the calculation result of the equi-join as the sub-table;

The data table with the few times in the calculation result of the equijoin is selected as the main table.

Optionally, according to the corresponding relationship, using a preset drawing tool to generate an entity relationship diagram, including:

Extract field information with preset rules from the corresponding relationship as an entity;

Extract the feature corresponding to the entity from the corresponding relationship as an attribute;

Extract the mapping relationship and mapping cardinality between the entities from the corresponding relationship;

According to the entity, the attribute, the mapping relationship and the mapping cardinality, an entity relationship diagram is generated by using a preset entity relationship diagram generating tool.

Optionally, after the entity relationship diagram is generated by using a preset drawing tool according to the corresponding relationship and the field information, the method further includes:

The entity relationship diagram is mapped into a relationship table according to a preset mapping rule.

In order to solve the above problems, the present invention also provides a data table entity relationship diagram generating device, the device includes:

a query module, configured to obtain indexes and index types of all data tables in the preset database, query the data tables according to the indexes, and obtain query results;

An analysis module, configured to analyze the associated data tables according to the index and the index type when judging that there is an association between the data tables according to the query result to obtain the main table, the sub-table and the main table the corresponding relationship with the sub-table;

A drawing module, configured to generate an entity relationship diagram by using a preset drawing tool according to the corresponding relationship.

In order to solve the above problems, the present invention also provides an electronic device, the electronic device includes:

at least one processor; and,

a memory communicatively coupled to the at least one processor; wherein,

The memory stores a computer program executable by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to execute the data table entity relationship diagram described above Generate method.

In order to solve the above problems, the present invention also provides a computer-readable storage medium, where at least one computer program is stored in the computer-readable storage medium, and the at least one computer program is executed by a processor in an electronic device to realize the above-mentioned The method for generating the entity relationship diagram of the data table described above.

In the embodiment of the present invention, the indexes and index types of all data tables in the preset database are obtained, and the data tables are queried according to the indexes to obtain the query result; For the index and the index type, analyze the associated data tables to obtain the main table and the sub-table and the corresponding relationship between the main table and the sub-table; according to the corresponding relationship and the field information, Use the preset drawing tool to generate an entity relationship diagram, and directly extract the relationship between the data tables from the index of the data table, without using foreign keys or developers to reverse the data relationship from the page, which improves the data table relationship. Get efficiency. Therefore, the method, device, electronic device and computer-readable storage medium for generating a data table entity relationship diagram proposed by the present invention can solve the problem of low efficiency of the method for obtaining data table relationship.

Description of drawings

1 is a schematic flowchart of a method for generating an entity relationship diagram of a data table according to an embodiment of the present invention;

Fig. 2 is a detailed implementation flow diagram of one of the steps in the data table entity relationship diagram generation method shown in Fig. 1;

Fig. 3 is a detailed implementation flowchart of another step in the method for generating an entity relationship diagram of a data table shown in Fig. 1;

4 is a functional block diagram of an apparatus for generating an entity relationship diagram of a data table provided by an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of an electronic device implementing the method for generating an entity relationship diagram of a data table according to an embodiment of the present invention.

The realization, functional characteristics and advantages of the present invention will be further described with reference to the accompanying drawings in conjunction with the embodiments.

Detailed ways

It should be understood that the specific embodiments described herein are only used to explain the present invention, but not to limit the present invention.

The embodiment of the present application provides a method for generating an entity relationship diagram of a data table. The execution body of the method for generating an entity relationship diagram of a data table includes, but is not limited to, at least one of electronic devices that can be configured to execute the method provided by the embodiments of the present application, such as a server and a terminal. In other words, the method for generating the entity relationship diagram of the data table may be executed by software or hardware installed in a terminal device or a server device, and the software may be a blockchain platform. The server includes but is not limited to: a single server, a server cluster, a cloud server or a cloud server cluster, and the like. The server can be an independent server, or can provide cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery network (Content Delivery Network) , CDN), and cloud servers for basic cloud computing services such as big data and artificial intelligence platforms.

Referring to FIG. 1 , it is a schematic flowchart of a method for generating an entity relationship diagram of a data table according to an embodiment of the present invention. In this embodiment, the method for generating an entity relationship diagram of a data table includes:

S1. Obtain indexes and index types of all data tables in a preset database, and query the data tables according to the indexes to obtain query results.

In the embodiment of the present invention, the preset database is a relational database, and the relational database is a database established on the basis of a relational database model, and in a given application field, is composed of all entities and a set of connections between entities . One or more data types represented by each column of the table in the relational database, and each row contains a unique data entity.

In this embodiment of the present invention, the index is a structure for sorting the values of one or more columns in a data table of a database, and specific information in the data table can be quickly accessed by using the index.

In this embodiment of the present invention, the index types include: a normal index (normal), a unique index (unique), and a full text search index (full text). Wherein, the ordinary index is not limited; wherein, the unique index represents a unique index that does not allow repetition, and if the field information is guaranteed not to be repeated, for example, when an ID card number is used as an index, it can be set as a unique index; wherein, The full-text search index represents an index for full-text search. For example, when long-text search is performed, the full-text search index can be used.

In the embodiment of the present invention, BTree and Hash are commonly used in the algorithm of the index, and the embodiment of the present invention may adopt BTree.

Specifically, in S1, the data table is queried according to the index, and the query result is obtained, including:

Select the primary key index in the index of any data table in the database;

Select non-primary key indexes in the indexes of other data tables in the database;

Matching the primary key index with the non-primary key index to obtain a query result.

In this embodiment of the present invention, the primary key index is one or more fields in the data table, and its value is used to uniquely identify a certain record in the data table. The primary key index may be composed of multiple keywords, and the value of the primary key index cannot be empty or repeated.

In the embodiment of the present invention, the non-primary key index is a secondary index, the value of the primary key index is stored in the leaf nodes of the non-primary key index, and the non-primary key index is the same as the primary key index mechanism, but the non-primary key index The value of the primary key index can be repeated.

In the implementation of the present invention, the primary key index and the non-primary key index are matched to obtain a query result. The same value of the non-primary key index is queried in the primary key index.

S2. Determine whether there is a relationship between the data tables according to the query result.

In this embodiment of the present invention, when the query result is that the same value of the non-primary key index can be queried from the primary key index, it indicates that there is an association between the data tables.

In this embodiment of the present invention, when the query result is that the same value of the non-primary key index cannot be queried from the primary key index, it indicates that there is no association between the data tables.

When there is no association between the data table and other data tables, in S3, the data table that does not have an association is used as a basic data table, and no processing is performed.

In the embodiment of the present invention, the basic data table does not involve business data, and mainly stores case data and table structure annotations.

In the embodiment of the present invention, when there is no association relationship between the data table and other data tables, the data table is used as a basic data table and stored in a preset database without further processing.

When it is determined according to the query result that there is an association between the data tables, S4, according to the index and the index type, analyze the associated data table to obtain a main table and a sub-table, as well as the main table and the data table. Correspondence between the sub-tables.

In detail, referring to Fig. 2, the S4 includes:

S41, according to the index and the index type, analyze the associated data table to obtain an equi-join calculation result and a data table relationship type;

S42, classify the associated data tables according to the equivalent connection calculation result to obtain a main table and a sub-table;

S43. Extract the corresponding field information in the main table and the sub-table, and obtain the corresponding relationship between the main table and the sub-table by using the field information, the index, and the relationship type of the data table.

In the embodiment of the present invention, the data table relationship types include: 1:1, 1:N, M:1, M:N, wherein N and M are natural numbers respectively; it means that the mapping relationship between the data tables is 1 Pair 1, 1 to many, many to 1, many to many.

Wherein, the 1-to-1 (1:1), for example: for data table A and data table B, each entity in the data table A has a relationship with at most one entity in the data table B; Each entity in the data table B has a relationship with at most one entity in the data table A.

Wherein, the 1-to-many (1:N), for example: for the entity in the data table A and the data table B at least N entities have a relationship; and each entity in the data table B and at most one in the data table A Entities have relationships.

Wherein, the many-to-1 (M:1), for example: the entity in the data table B has a relationship with at least M entities in the data table A; and each entity in the data table A is at most one entity in the data table B There are relationships.

Wherein, the many-to-many (M:N), for example: each entity in the data table A has a relationship with at least M entities in the data table B, and each entity in the data table B is related to the entity set At least N entities in A have relationships.

In the embodiment of the present invention, the entity is an objectively existing and mutually distinguishable thing, which refers to a collection of certain types of things, and an individual of each type of data object is called an entity.

In detail, referring to FIG. 3 , in S41, according to the index and the index type, the associated data table is analyzed to obtain an equijoin calculation result, including:

S411, select the primary key index in the index of the data table associated with any one in the database;

S412, select a non-primary key index in the index of other associated data tables in the database;

S413. Using a preset SQL script, perform an equijoin calculation on the data table according to the primary key index and the non-primary key index, and obtain an equijoin calculation result.

In the embodiment of the present invention, the preset SQL script is to count the number of IDs of the join fields in the two tables that are equal. For example: SELECT count(DISTINCT t.id), count(DISTINCT m.id) FROM t_s_user_ext01 tinner join t_s_user01 m on m.id=t.user_id, where DISTINCT t.id is the non-primary key value after deduplication; (DISTINCT m.id) The data value of the primary key after deduplication; t_s_user_ext01 is the table name of one of the data tables; t_s_user01 is the table name of another data table; id is the primary key value of the data table t_s_user01; t. user_id is the non-primary key value of the data table t_s_user_ext01.

Wherein, the equi-join calculation is implemented by using an inner join operation statement, the equi-join is a combination of the primary key index and the non-primary key index in the two tables, and when there is at least one match, the two tables are returned. Join the rows where the fields are equal.

Further, classifying the associated data tables according to the equi-join calculation results to obtain a main table and a sub-table, including:

Select the data table with many times in the calculation result of the equi-join as the sub-table;

The data table with the few times in the calculation result of the equijoin is selected as the main table.

In the embodiment of the present invention, for example, the calculation result of the equal value connection is that the data table t_s_user_ext01 is 3 and the data table t.user_id is 2, then the data table t.user_id is the main table, and the data table t_s_user_ext01 for the subtable.

In the embodiment of the present invention, the corresponding relationship includes all field information associated with the data table and the associated relationship between the fields.

In this embodiment of the present invention, through the index and the index type, the associated data tables are analyzed to obtain the main table and the sub-table and the corresponding relationship between the main table and the sub-table, and the corresponding relationship between the main table and the sub-table is obtained directly from the The relationship between the data tables is extracted from the index of the data table, and there is no need to infer the data relationship from the page through foreign keys or developers, which improves the acquisition efficiency of the data table relationship.

S5. According to the corresponding relationship, use a preset drawing tool to generate an entity relationship diagram.

In the embodiment of the present invention, the preset drawing tool can be selected from tools such as DbSchema, PowerDesigner, and ERStudio.

In the embodiment of the present invention, the entity relationship diagram is an ER diagram (Entity Relationship Diagram), which is composed of entities, attributes, mapping relationships, and connections. Among them, the entity is an entity that is distinguished from each other, and the entity can be a specific person or thing, which is represented by a rectangular frame; a certain characteristic of the attribute entity, an entity can be represented by several attributes, which are represented by an ellipse It is represented by a shape; wherein the mapping relationship reflects the relationship within or between entities, and is represented by a diamond.

In detail, the S5 includes:

Extract field information with preset rules from the corresponding relationship as an entity;

Extract the feature corresponding to the entity from the corresponding relationship as an attribute;

Extract the mapping relationship and mapping cardinality between the entities from the corresponding relationship;

According to the entity, the attribute, the mapping relationship and the mapping cardinality, an entity relationship diagram is generated by using a preset entity relationship diagram generating tool.

In the embodiment of the present invention, the field information with preset rules is mainly objects that exist objectively and can be distinguished from each other confirmed according to business requirements. For example, in the student course system, students, teachers, and courses are all entities.

In this embodiment of the present invention, the mapping cardinality is the number of the mapping relationships. For example, there may be a one-to-one relationship, a one-to-many relationship, a many-to-many relationship, and the like between entity A and entity B.

Further, after the entity relationship diagram is generated, when attribute conflicts, naming conflicts, structural conflicts, redundant data and redundant inter-entity relationships occur in each entity relationship diagram, the entity relationship diagram needs to be modified or reconstructed. In addition, normalization theory can be used to eliminate the redundant data and redundant relationships between the entities.

In the embodiment of the present invention, after the entity relationship diagram is generated by using a preset drawing tool according to the corresponding relationship and the field information, the method further includes: mapping the entity relationship diagram according to a preset mapping rule for the relational table. The relational table includes rows (which cannot be repeated), columns (attributes), primary keys, and foreign keys; the foreign keys represent the correlation between the two relational tables. The relationship table can display the relationship between the data tables more intuitively and in detail, so that the developer can clearly see the relationship between the various data tables in the database.

In the embodiment of the present invention, the indexes and index types of all data tables in the preset database are obtained, and the data tables are queried according to the indexes to obtain the query result; For the index and the index type, analyze the associated data tables to obtain the main table and the sub-table and the corresponding relationship between the main table and the sub-table; according to the corresponding relationship and the field information, Use the preset drawing tool to generate an entity relationship diagram, and directly extract the relationship between the data tables from the index of the data table, without using foreign keys or developers to reverse the data relationship from the page, which improves the data table relationship. Get efficiency. Therefore, the method for generating the entity relationship diagram of the data table proposed by the present invention can solve the problem of low efficiency of the method for obtaining the relationship of the data table.

As shown in FIG. 4 , it is a functional module diagram of an apparatus for generating an entity relationship diagram of a data table provided by an embodiment of the present invention.

The data table entity relationship diagram generating apparatus 100 of the present invention can be installed in an electronic device. According to the implemented functions, the data table entity relationship diagram generating apparatus 100 may include a query module 101 , an analysis module 102 , and a drawing module 103 . The modules in the present invention can also be called units, which refer to a series of computer program segments that can be executed by the electronic device processor and can perform fixed functions, and are stored in the memory of the electronic device.

In this embodiment, the functions of each module/unit are as follows:

The query module 101 is configured to acquire indexes and index types of all data tables in the preset database, and query the data tables according to the indexes to obtain query results.

In the embodiment of the present invention, the preset database is a relational database, and the relational database is a database established on the basis of a relational database model, and in a given application field, is composed of all entities and a set of connections between entities . One or more data types represented by each column of the table in the relational database, and each row contains a unique data entity.

In this embodiment of the present invention, the index is a structure for sorting the values of one or more columns in a data table of a database, and specific information in the data table can be quickly accessed by using the index.

In this embodiment of the present invention, the index types include: a normal index (normal), a unique index (unique), and a full text search index (full text). Wherein, the ordinary index is not limited; wherein, the unique index represents a unique index that does not allow repetition, and if the field information is guaranteed not to be repeated, for example, when an ID card number is used as an index, it can be set as a unique index; wherein, The full-text search index represents an index for full-text search. For example, when long-text search is performed, the full-text search index can be used.

In the embodiment of the present invention, BTree and Hash are commonly used in the algorithm of the index, and the embodiment of the present invention may adopt BTree.

Specifically, the query module 101 queries the data table according to the index to obtain query results, which are used for:

Select the primary key index in the index of any data table in the database;

Selecting non-primary key indexes in the indexes of other data tables in the database;

Matching the primary key index with the non-primary key index to obtain a query result.

In this embodiment of the present invention, the primary key index is one or more fields in the data table, and its value is used to uniquely identify a certain record in the data table. The primary key index may be composed of multiple keywords, and the value of the primary key index cannot be empty or repeated.

In the embodiment of the present invention, the non-primary key index is a secondary index, the value of the primary key index is stored in the leaf nodes of the non-primary key index, and the non-primary key index is the same as the primary key index mechanism, but the non-primary key index The value of the primary key index can be repeated.

In the implementation of the present invention, the primary key index and the non-primary key index are matched to obtain a query result. The same value of the non-primary key index is queried in the primary key index.

The analysis module 102 is configured to analyze the associated data tables according to the index and the index type when judging that there is an association between the data tables according to the query result to obtain the main table, the sub-table and all the data tables. The corresponding relationship between the main table and the sub-table.

In this embodiment of the present invention, it is determined whether there is an association between the data tables according to the query result.

In this embodiment of the present invention, when the query result is that the same value of the non-primary key index can be queried from the primary key index, it indicates that there is an association between the data tables.

In this embodiment of the present invention, when the query result is that the same value of the non-primary key index cannot be queried from the primary key index, it indicates that there is no association between the data tables.

When there is no relationship between the data table and other data tables, the data table without the relationship is regarded as the basic data table, and no processing is performed.

In the embodiment of the present invention, the basic data table does not involve business data, and mainly stores case data and table structure annotations.

In the embodiment of the present invention, when there is no association relationship between the data table and other data tables, the data table is used as a basic data table and stored in a preset database without further processing.

When it is determined according to the query result that there is an association between the data tables, according to the index and the index type, analyze the associated data tables to obtain a main table and a sub-table, as well as the main table and the sub-table Correspondence between tables.

In detail, as shown in FIG. 2 , the analysis module 102 is used for:

According to the index and the index type, analyze the associated data table to obtain an equijoin calculation result and a data table relationship type;

Classify the associated data tables according to the calculation result of the equi-join to obtain a main table and a sub-table;

The corresponding field information in the main table and the sub-table is extracted, and the corresponding relationship between the main table and the sub-table is obtained by using the field information, the index, and the relationship type of the data table.

In the embodiment of the present invention, the data table relationship types include: 1:1, 1:N, M:1, M:N, wherein N and M are natural numbers respectively; it means that the mapping relationship between the data tables is 1 Pair 1, 1 to many, many to 1, many to many.

Wherein, the 1-to-1 (1:1), for example: for data table A and data table B, each entity in the data table A has a relationship with at most one entity in the data table B; Each entity in the data table B has a relationship with at most one entity in the data table A.

Wherein, the 1-to-many (1:N), for example: for the entity in the data table A and the data table B at least N entities have a relationship; and each entity in the data table B and at most one in the data table A Entities have relationships.

Wherein, the many-to-1 (M:1), for example: the entity in the data table B has a relationship with at least M entities in the data table A; and each entity in the data table A is at most one entity in the data table B There are relationships.

Wherein, the many-to-many (M:N), for example: each entity in the data table A has a relationship with at least M entities in the data table B, and each entity in the data table B is related to the entity set At least N entities in A have relationships.

In the embodiment of the present invention, the entity is an objectively existing and mutually distinguishable thing, which refers to a collection of certain types of things, and an individual of each type of data object is called an entity.

In detail, referring to FIG. 3 , according to the index and the index type, analyze the associated data table to obtain an equijoin calculation result, which is used for:

Select the primary key index in the index of the associated data table in the database;

Selecting non-primary key indexes in the indexes of other associated data tables in the database;

Using a preset SQL script, perform an equijoin calculation on the data table according to the primary key index and the non-primary key index, and obtain an equijoin calculation result.

In the embodiment of the present invention, the preset SQL script is to count the number of IDs of the join fields in the two tables that are equal. For example: SELECT count(DISTINCT t.id), count(DISTINCT m.id) FROM t_s_user_ext01t innerjoin t_s_user01 m on m.id=t.user_id, where DISTINCT t.id is the value after deduplication of non-primary key values; ( DISTINCT m.id) The data value of the primary key after deduplication; t_s_user_ext01 is the table name of one of the data tables; t_s_user01 is the table name of another data table; id is the primary key value of the data table t_s_user01; t.user_id It is the non-primary key value of the data table t_s_user_ext01.

Wherein, the equi-join calculation is implemented by using an inner join operation statement, the equi-join is a combination of the primary key index and the non-primary key index in the two tables, and when there is at least one match, the two tables are returned. Join the rows where the fields are equal.

Further, the described data table with association is classified according to the calculation result of the equi-value connection, and the main table and the sub-table are obtained, which are used for:

Select the data table with many times in the calculation result of the equi-join as the sub-table;

The data table with the few times in the calculation result of the equijoin is selected as the main table.

In the embodiment of the present invention, for example, the calculation result of the equal value connection is that the data table t_s_user_ext01 is 3 and the data table t.user_id is 2, then the data table t.user_id is the main table, and the data table t_s_user_ext01 for the subtable.

In this embodiment of the present invention, the corresponding relationship includes all field information associated with the data table and the associated relationship between the fields.

In this embodiment of the present invention, through the index and the index type, the associated data tables are analyzed to obtain the main table and the sub-table and the corresponding relationship between the main table and the sub-table, and the corresponding relationship between the main table and the sub-table is obtained directly from the The relationship between the data tables is extracted from the index of the data table, and there is no need to infer the data relationship from the page through foreign keys or developers, which improves the acquisition efficiency of the data table relationship.

The drawing module 103 is configured to use a preset drawing tool to generate an entity relationship diagram according to the corresponding relationship.

In the embodiment of the present invention, the preset drawing tool can be selected from tools such as DbSchema, PowerDesigner, and ERStudio.

In the embodiment of the present invention, the entity relationship diagram is an ER diagram (Entity Relationship Diagram), which is composed of entities, attributes, mapping relationships, and connections. Among them, the entity is an entity that is distinguished from each other, and the entity can be a specific person or thing, which is represented by a rectangular frame; a certain characteristic of the attribute entity, an entity can be represented by several attributes, which are represented by an ellipse It is represented by a shape; wherein the mapping relationship reflects the relationship within or between entities, and is represented by a diamond.

In detail, the drawing module 103 is used for:

Extract field information with preset rules from the corresponding relationship as an entity;

Extract the feature corresponding to the entity from the corresponding relationship as an attribute;

Extract the mapping relationship and mapping cardinality between the entities from the corresponding relationship;

According to the entity, the attribute, the mapping relationship and the mapping cardinality, an entity relationship diagram is generated by using a preset entity relationship diagram generating tool.

In the embodiment of the present invention, the field information with preset rules is mainly objects that exist objectively and can be distinguished from each other confirmed according to business requirements. For example, in the student course system, students, teachers, and courses are all entities.

In this embodiment of the present invention, the mapping cardinality is the number of the mapping relationships. For example, there may be a one-to-one relationship, a one-to-many relationship, a many-to-many relationship, and the like between entity A and entity B.

Further, after the entity relationship diagram is generated, when attribute conflicts, naming conflicts, structural conflicts, redundant data and redundant inter-entity relationships occur in each entity relationship diagram, the entity relationship diagram needs to be modified or reconstructed. In addition, normalization theory can be used to eliminate the redundant data and redundant relationships between the entities.

In the embodiment of the present invention, after the entity relationship diagram is generated by using a preset drawing tool according to the corresponding relationship and the field information, the method further includes: mapping the entity relationship diagram according to a preset mapping rule for the relational table. The relational table includes rows (which cannot be repeated), columns (attributes), primary keys, and foreign keys; the foreign keys represent the correlation between the two relational tables. The relationship table can display the relationship between the data tables more intuitively and in detail, so that the developer can clearly see the relationship between the various data tables in the database.

In detail, each module described in the data table entity relationship diagram generating apparatus 100 in the embodiment of the present invention adopts the same technical means as the data table entity relationship diagram generating method described in FIG. 1 to FIG. 3 when used. , and can produce the same technical effect, which will not be repeated here.

As shown in FIG. 5 , it is a schematic structural diagram of an electronic device for implementing a method for generating an entity relationship diagram of a data table provided by an embodiment of the present invention.

The electronic device 1 may include a processor 10, a memory 11, a communication bus 12, and a communication interface 13, and may also include a computer program stored in the memory 11 and executable on the processor 10, such as a data table entity Relationship diagram generator.

The processor 10 may be composed of integrated circuits in some embodiments, for example, may be composed of a single packaged integrated circuit, or may be composed of multiple integrated circuits packaged with the same function or different functions, including one or A combination of multiple central processing units (Central Processing Units, CPUs), microprocessors, digital processing chips, graphics processors, and various control chips, etc. The processor 10 is the control core (ControlUnit) of the electronic device, and uses various interfaces and lines to connect various components of the entire electronic device, and by running or executing the programs or modules (such as execution data) stored in the memory 11. Table entity relationship diagram generating program, etc.), and call the data stored in the memory 11 to execute various functions of the electronic device and process data.

The memory 11 includes at least one type of readable storage medium, and the readable storage medium includes flash memory, mobile hard disk, multimedia card, card-type memory (for example: SD or DX memory, etc.), magnetic memory, magnetic disk, optical disk, etc. . In some embodiments, the memory 11 may be an internal storage unit of an electronic device, such as a mobile hard disk of the electronic device. In other embodiments, the memory 11 may also be an external storage device of the electronic device, such as a pluggable mobile hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) equipped on the electronic device. ) card, flash card (Flash Card) and so on. Further, the memory 11 may also include both an internal storage unit of an electronic device and an external storage device. The memory 11 can not only be used to store application software installed in the electronic device and various types of data, such as the code of a data table entity relationship diagram generating program, etc., but also can be used to temporarily store data that has been output or will be output.

The communication bus 12 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus or the like. The bus can be divided into address bus, data bus, control bus and so on. The bus is configured to implement connection communication between the memory 11 and at least one processor 10 and the like.

The communication interface 13 is used for communication between the above electronic device and other devices, including a network interface and a user interface. Optionally, the network interface may include a wired interface and/or a wireless interface (eg, a WI-FI interface, a Bluetooth interface, etc.), which is generally used to establish a communication connection between the electronic device and other electronic devices. The user interface may be a display (Display), an input unit (such as a keyboard (Keyboard)), and optionally, the user interface may also be a standard wired interface or a wireless interface. Optionally, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode, organic light-emitting diode) touch device, and the like. The display may also be appropriately called a display screen or a display unit, which is used for displaying information processed in the electronic device and for displaying a visual user interface.

FIG. 5 only shows an electronic device with components. Those skilled in the art can understand that the structure shown in FIG. 5 does not constitute a limitation on the electronic device 1, and may include fewer or more components than those shown in the drawings. components, or a combination of certain components, or a different arrangement of components.

For example, although not shown, the electronic device may also include a power source (such as a battery) for powering the various components, preferably, the power source may be logically connected to the at least one processor 10 through a power management device, so that the power source can be logically connected through the power management device. Implement functions such as charge management, discharge management, and power management. The power source may also include one or more DC or AC power sources, recharging devices, power failure detection circuits, power converters or inverters, power status indicators, and any other components. The electronic device may further include various sensors, Bluetooth modules, Wi-Fi modules, etc., which will not be repeated here.

It should be understood that the embodiments are only used for illustration, and are not limited by this structure in the scope of the patent application.

The data table entity relationship diagram generation program stored in the memory 11 in the electronic device 1 is a combination of multiple instructions, and when running in the processor 10, it can realize:

Obtain indexes and index types of all data tables in the preset database, query the data tables according to the indexes, and obtain query results;

When judging that there is an association between the data tables according to the query result, analyze the associated data table according to the index and the index type to obtain the main table and the sub-table, and the main table and the sub-table Correspondence between;

According to the corresponding relationship, an entity relationship diagram is generated by using a preset drawing tool.

Specifically, for the specific implementation method of the above-mentioned instruction by the processor 10, reference may be made to the description of the relevant steps in the embodiment corresponding to the accompanying drawings, which will not be repeated here.

Further, if the modules/units integrated in the electronic device 1 are implemented in the form of software functional units and sold or used as independent products, they may be stored in a computer-readable storage medium. The computer-readable storage medium may be volatile or non-volatile. For example, the computer-readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a USB flash drive, a removable hard disk, a magnetic disk, an optical disc, a computer memory, a read-only memory (ROM, Read-Only). Memory).

The present invention also provides a computer-readable storage medium, where the readable storage medium stores a computer program, and when executed by a processor of an electronic device, the computer program can realize:

Obtain indexes and index types of all data tables in the preset database, query the data tables according to the indexes, and obtain query results;

When judging that there is an association between the data tables according to the query result, analyze the associated data table according to the index and the index type to obtain the main table and the sub-table, and the main table and the sub-table Correspondence between;

According to the corresponding relationship, an entity relationship diagram is generated by using a preset drawing tool.

In the several embodiments provided by the present invention, it should be understood that the disclosed apparatus, apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are only illustrative. For example, the division of the modules is only a logical function division, and there may be other division manners in actual implementation.

The modules described as separate components may or may not be physically separated, and components shown as modules may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution in this embodiment.

In addition, each functional module in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit. The above-mentioned integrated units can be implemented in the form of hardware, or can be implemented in the form of hardware plus software function modules.

It will be apparent to those skilled in the art that the present invention is not limited to the details of the above-described exemplary embodiments, but that the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics of the invention.

Therefore, the embodiments are to be regarded in all respects as illustrative and not restrictive, and the scope of the invention is to be defined by the appended claims rather than the foregoing description, which are therefore intended to fall within the scope of the claims. All changes within the meaning and range of the equivalents of , are included in the present invention. Any reference signs in the claims shall not be construed as limiting the involved claim.

The blockchain referred to in the present invention is a new application mode of computer technologies such as distributed data storage, point-to-point transmission, consensus mechanism, and encryption algorithm. Blockchain, essentially a decentralized database, is a series of data blocks associated with cryptographic methods. Each data block contains a batch of network transaction information to verify its Validity of information (anti-counterfeiting) and generation of the next block. The blockchain can include the underlying platform of the blockchain, the platform product service layer, and the application service layer.

The embodiments of the present application may acquire and process related data based on artificial intelligence technology. Among them, artificial intelligence (AI) is a theory, method, technology and application system that uses digital computers or machines controlled by digital computers to simulate, extend and expand human intelligence, perceive the environment, acquire knowledge and use knowledge to obtain the best results. .

Furthermore, it is clear that the word "comprising" does not exclude other units or steps and the singular does not exclude the plural. Several units or means recited in the system claims can also be realized by one unit or means by means of software or hardware. The words first, second, etc. are used to denote names and do not denote any particular order.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit them. Although the present invention has been described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that the technical solutions of the present invention can be Modifications or equivalent substitutions can be made without departing from the spirit and scope of the technical solutions of the present invention.

Claims (10)

1. a data table entity relationship diagram generating method, is characterized in that, described method comprises: Obtain indexes and index types of all data tables in the preset database, query the data tables according to the indexes, and obtain query results; When judging that there is an association between the data tables according to the query result, analyze the associated data table according to the index and the index type to obtain the main table and the sub-table, and the main table and the sub-table Correspondence between; According to the corresponding relationship, an entity relationship diagram is generated by using a preset drawing tool. 2. The method for generating an entity relationship diagram of a data table according to claim 1, wherein the querying the data table according to the index to obtain a query result comprises: Select the primary key index in the index of any data table in the database; Select non-primary key indexes in the indexes of other data tables in the database; Matching the primary key index with the non-primary key index to obtain a query result. 3. The method for generating an entity relationship diagram of a data table according to claim 1, wherein, according to the index and the index type, analyzing the associated data table to obtain a main table and a sub-table and the The corresponding relationship between the main table and the sub-table includes: According to the index and the index type, analyze the associated data table to obtain an equijoin calculation result and a data table relationship type; Classify the associated data tables according to the calculation result of the equi-join to obtain a main table and a sub-table; The corresponding field information in the main table and the sub-table is extracted, and the corresponding relationship between the main table and the sub-table is obtained by using the field information, the index, and the relationship type of the data table. 4. The method for generating an entity-relationship diagram of a data table according to claim 3, wherein, according to the index and the index type, analyzing the associated data table to obtain an equi-join calculation result, comprising: : Select the primary key index in the index of the associated data table in the database; Selecting non-primary key indexes in the indexes of other associated data tables in the database; Using a preset SQL script, perform an equijoin calculation on the data table according to the primary key index and the non-primary key index, and obtain an equijoin calculation result. 5. The method for generating an entity-relationship diagram of a data table according to claim 3, wherein the described data table that is associated is classified according to the calculation result of the equi-value connection, and a main table and a sub-table are obtained, including : Select the data table with many times in the calculation result of the equi-join as the sub-table; The data table with the few times in the calculation result of the equijoin is selected as the main table. 6. The method for generating an entity-relationship diagram of a data table according to claim 1, wherein, according to the corresponding relationship, utilizing a preset drawing tool to generate an entity-relationship diagram, comprising: Extract field information with preset rules from the corresponding relationship as an entity; Extract the feature corresponding to the entity from the corresponding relationship as an attribute; Extract the mapping relationship and mapping cardinality between the entities from the corresponding relationship; According to the entity, the attribute, the mapping relationship and the mapping cardinality, an entity relationship diagram is generated by using a preset entity relationship diagram generating tool. 7. The method for generating an entity-relationship diagram of a data table according to any one of claims 1-6, wherein, after the entity-relationship diagram is generated by using a preset drawing tool according to the corresponding relationship and the field information , the method also includes: The entity relationship diagram is mapped into a relationship table according to a preset mapping rule. 8. A device for generating an entity relationship diagram of a data table, wherein the device comprises: a query module, configured to obtain indexes and index types of all data tables in the preset database, query the data tables according to the indexes, and obtain query results; An analysis module, configured to analyze the associated data tables according to the index and the index type when judging that there is an association between the data tables according to the query result to obtain the main table, the sub-table and the main table the corresponding relationship with the sub-table; A drawing module, configured to generate an entity relationship diagram by using a preset drawing tool according to the corresponding relationship. 9. An electronic device, characterized in that the electronic device comprises: at least one processor; and, a memory communicatively coupled to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform any one of claims 1 to 7 The method for generating the entity relationship diagram of the data table described in the item. 10 . A computer-readable storage medium storing a computer program, wherein when the computer program is executed by a processor, the method for generating an entity-relationship diagram of a data table according to any one of claims 1 to 7 is implemented. 11 .

Images