A database table classification method, device, equipment and storage medium

By determining the link relationship and field information of the tables in the database, dividing and classifying the tables, the search difficulty problem caused by the unclassified tables in different fields is solved, and the effect of quickly finding specific tables is achieved.

CN117216058BActive Publication Date: 2025-10-21CHINA PING AN PROPERTY INSURANCE CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202311146300.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-09-05
Publication Date
2025-10-21
Estimated Expiration
2043-09-05

AI Technical Summary

Technical Problem

In the prior art, tables in different fields in the database are not classified, which results in users spending a lot of manpower and time when searching for tables in a specific field.

Method used

By obtaining the domain information of the table, determining the link relationship between the tables, dividing them into multiple first sets, and determining the target table in the first set, classifying the target table according to the link relationship and domain information, and obtaining multiple second sets of corresponding fields.

Benefits of technology

It achieves efficient classification of database tables, allowing users to quickly find the required table information, reducing manpower and time consumption.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117216058B_ABST
    Figure CN117216058B_ABST
Patent Text Reader

Abstract

The application relates to the technical field of data processing, and provides a database table classification method and device, equipment and a storage medium, the method comprises the following steps: acquiring a plurality of table forms of record field information; determining whether there is a link relationship between different table forms; dividing the table forms according to corresponding field information, and obtaining at least one first set; determining a target table form in the first set; and classifying the target table forms according to the link relationship between the target table forms and the corresponding field information, and obtaining a plurality of second sets of corresponding field information, wherein there is no link relationship between the target table forms in different second sets. Taking the financial field as an example, an insurance company has a database for storing table form information, a large number of table forms are stored in the database, table forms of different fields are classified into different field sets, when a user searches for a table form of a financial report, a plurality of table forms of the financial field are correspondingly displayed in the database, so that the user can conveniently find the required table form information.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a database table classification method, apparatus, device and storage medium. Background Art

[0002] With the advancement of network technology, the amount of system-generated data is increasing. When user or business information changes, the structure and data in the database also change. Furthermore, databases often store a large number of tables from different fields without proper categorization, making it difficult for users to search for the tables they need and leading to complex maintenance. For example, in the financial sector, insurance companies often combine tables from their core business areas with tables from their peripheral business areas, requiring significant manpower and time to search for tables from different fields. Summary of the Invention

[0003] The main purpose of this application is to provide a method, device, equipment and storage medium for classifying database tables. Taking the financial field as an example, an insurance company has a database for storing table information. A large number of tables are stored in the database, and tables in different fields will be classified into sets of different fields. When a user searches for a table of a financial statement, a plurality of tables in the financial field will be displayed accordingly in the database, so that the user can find the required table information conveniently, so as to solve the technical problem that the existing technology does not classify these tables in different fields, and it takes a lot of manpower and time to search for tables in the corresponding field from tables in different fields.

[0004] In a first aspect, the present application provides a database table classification method, comprising:

[0005] A form for obtaining information on multiple record fields;

[0006] Determining whether there is a link relationship between different tables;

[0007] Dividing the table according to the field information corresponding to the table to obtain at least one first set, wherein the first set includes tables corresponding to at least one field information, and the link relationship exists between multiple tables;

[0008] Determine a target table in the first set, wherein the number of link relationships existing in the target table is less than or equal to the number of link relationships existing in non-target tables, or the number of link relationships existing in the target table is less than or equal to a preset threshold;

[0009] The target tables are classified according to the link relationship between the target tables and the corresponding field information to obtain a plurality of second sets of corresponding field information, wherein the target tables in different second sets do not have the link relationship between them.

[0010] In a second aspect, the present application further provides a database table classification device, comprising:

[0011] The acquisition module is used to obtain tables of multiple record field information;

[0012] A relationship determination module, used to determine whether there is a link relationship between different tables;

[0013] a domain division module, configured to divide the table according to the domain information corresponding to the table to obtain at least one first set, wherein the first set includes tables corresponding to at least one domain information, and the link relationship exists between the plurality of tables;

[0014] a target table determining module, configured to determine a target table in the first set, wherein the number of link relationships existing in the target table is less than or equal to the number of link relationships existing in the non-target tables, or the number of link relationships existing in the target table is less than or equal to a preset threshold;

[0015] The classification module is used to classify the target tables according to the link relationship between the target tables and the corresponding field information to obtain a plurality of second sets of corresponding field information, wherein the link relationship does not exist between the target tables in different second sets.

[0016] In a third aspect, the present application further provides a computer device, comprising a memory and a processor;

[0017] The memory is used to store computer programs;

[0018] The processor is configured to execute the computer program and implement the above-mentioned database table classification method when executing the computer program.

[0019] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps of the above-mentioned database table classification method are implemented.

[0020] The present application provides a database table classification method, apparatus, device and storage medium, the method comprising: obtaining multiple tables recording field information; determining whether there is a link relationship between different tables; dividing the tables according to the field information corresponding to the tables to obtain at least one first set, the first set including tables corresponding to at least one field information, and the link relationship between the multiple tables; determining a target table in the first set, the number of target tables with the link relationship being less than or equal to the number of non-target tables with the link relationship, or the number of target tables with the link relationship being less than or equal to a preset threshold; classifying the target tables according to the link relationship and the corresponding field information between the target tables to obtain multiple second sets of corresponding field information, the target tables in different second sets not having the link relationship. Taking the financial field as an example, insurance companies or banking institutions all have databases for storing table information, and the databases store a large number of tables. Tables in different fields will be classified into sets of different fields. When a user searches for a table for a financial statement, the database will display multiple tables in the financial field, thereby facilitating the user to find the required table information, solving the technical problem that the existing technology does not classify these tables in different fields and requires a lot of manpower and time to search for tables in the corresponding field from tables in different fields. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following is a brief introduction to the drawings required for use in the description of the embodiments. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0022] Figure 1 A flowchart of a database table classification method provided in an embodiment of the present application;

[0023] Figure 2 A schematic diagram of the connection between the server and the terminal provided in the embodiment of the present application;

[0024] Figure 3 This is a first schematic diagram showing a link relationship between different tables provided in an embodiment of the present application;

[0025] Figure 4 A second schematic diagram showing a link relationship between different tables provided in an embodiment of the present application;

[0026] Figure 5 A third schematic diagram showing a link relationship between different tables provided in an embodiment of the present application;

[0027] Figure 6 A schematic block diagram of a database table classification device provided in an embodiment of the present application;

[0028] Figure 7 A schematic block diagram of the structure of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0029] The following will be combined with the drawings in the embodiments of this application to clearly and completely describe the technical solutions in the embodiments of this application. Obviously, the embodiments described are part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0030] The flowcharts shown in the accompanying drawings are for illustrative purposes only and do not necessarily include all contents and operations / steps, nor must they be executed in the order described. For example, some operations / steps may be decomposed, combined, or partially merged, so the actual execution order may vary depending on the actual situation.

[0031] The embodiments of the present application provide a method, apparatus, device, and storage medium for classifying database tables. The method for classifying database tables can be applied to electronic devices, such as mobile phones, tablet computers, laptop computers, and desktop computers. It can also be applied to servers, which can be standalone servers or cloud servers that provide basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (CDNs), and big data and artificial intelligence platforms.

[0032] The following describes some embodiments of the present application in detail with reference to the accompanying drawings. In the absence of conflict, the following embodiments and features in the embodiments may be combined with each other.

[0033] See also Figure 1 , Figure 1 This is a flow chart of a database table classification method provided in an embodiment of the present application. It should be noted that the database table classification method provided in the embodiment of the present application can be used in electronic devices and of course can also be used in servers.

[0034] like Figure 2 As shown, the classification method of the database table is applied to the server, the server and the terminal are in communication connection, and the server can send the second set obtained by the classification method of the database table to the terminal electronic device. Of course, it is not limited to this and is not limited here.

[0035] In specific implementation, electronic devices include but are not limited to: any one of mobile phones, tablet computers, laptops, and desktop computers; the server can be a single server or a server cluster, or a cloud server that provides cloud computing services.

[0036] like Figure 1 As shown, the database table classification method includes steps S101 to S105.

[0037] Step S101: Acquire multiple tables recording field information.

[0038] Databases typically store a large amount of information, including various tables that record information in specific fields. For example, in the financial sector, a banking institution's database might store tables related to finance, personnel, administration, financing, insurance, development, and management, among others.

[0039] Understandably, there are many public forms in a database. Some contain extensive and complex information, making them difficult to filter out. Others contain simpler information and are easier to filter out. For example, insurance companies have various registration forms, including those for administrative personnel visits and item collection. Therefore, before retrieving forms recording information in different areas from the database, it's helpful to perform a preliminary screening of unnecessary public forms.

[0040] Step S102: Determine whether there is a link relationship between different tables.

[0041] In this embodiment, the link relationship may refer to the recording of the same field information between different tables. A plurality of tables recording different field information and tables recording the same field information are stored in the database. It can generally be considered that there is no link relationship between tables recording different field information, while there is a link relationship between tables recording the same field information. In general, a table that has a link relationship with a table recording different field information can be defined as a public table. Therefore, some public tables will cause a link relationship between tables corresponding to different field information. Specifically, taking an insurance company as an example, assuming that the personnel registration form is the basic table, then the personnel registration form may have a link relationship with the outgoing personnel registration form of the insurance business department, and may also have a link relationship with the visitor registration form of the administrative department, and may also have a link relationship with the claims personnel registration form of the insurance claims review department.

[0042] In an exemplary embodiment, the present invention may determine whether a link relationship exists between different tables based on a preset judgment condition and according to the text content included in the table.

[0043] Specifically, the domain information recorded in the table can be used as a judgment condition, and then the text content included in the table can be used to determine whether there is a link relationship between different tables. In actual applications, when a user enters text content for querying a table, multiple tables are displayed accordingly. Since these tables appear when the same text content is entered for search, it can be considered that these tables have a link relationship.

[0044] Step S103: Divide the table according to the field information corresponding to the table to obtain at least one first set, where the first set includes tables corresponding to at least one field information, and a link relationship exists between the multiple tables.

[0045] Tables are divided into domains based on the domain information recorded in the tables. Specifically, tables recording development domain information are classified in the development domain, tables recording business domain information are classified in the business domain, and tables recording finance domain information are classified in the finance domain. Different first sets represent different domains. Generally, multiple tables classified in the development domain have link relationships, multiple tables classified in the business domain have link relationships, and multiple tables classified in the finance domain have link relationships.

[0046] In actual applications, although there are link relationships between multiple tables divided into the same field, some tables may be common tables. Generally speaking, when a large number of tables have link relationships, it means that there may be common tables among these tables. Therefore, when different tables are divided into fields, one or more first sets can be obtained, each of which includes tables corresponding to at least one field information, and there are link relationships between the tables in the first set. Figure 3 As shown, there is a link relationship between table k1 and table k2, which means that table k1 and table k2 are a first set. This situation is ideal because table k1 and table k2 do not have a link relationship with other tables. Figure 4 As shown in , tables p1, p2, and p4 all have a link relationship with table p3, and table p1 and table p2 all have a link relationship. This means that tables p1, p2, p3, and p4 are a first set, which is also ideal because there are no more complex link relationships. Figure 5 As shown in the figure, tables t1, t2, t3, ..., t12, t13 all have links, indicating that tables t1, t2, t3, ..., t12, t13 are a first set. This is because there may be common tables, resulting in links between many tables. In this case, these first sets need to be reclassified to improve the accuracy of table domain classification.

[0047] Step S104: Determine a target table in the first set, wherein the number of link relationships in the target table is less than or equal to the number of link relationships in the non-target tables, or the number of link relationships in the target table is less than or equal to a preset threshold.

[0048] It should be noted that the number of first sets in this embodiment is at least one. And there are link relationships between the tables in the first set. Of course, some first sets may have only one table, that is, the table does not have a link relationship with other tables. Some first sets may have multiple tables and there are common tables, resulting in relatively many and complex link relationships between the tables in the first set. Therefore, this embodiment needs to determine the target table from these first sets. The target table in this embodiment is a table to be classified that needs to be divided twice. Specifically, if there are common tables in the first set, then these common tables are non-target tables. Since the common tables have link relationships with tables in different fields, the common tables, that is, the non-target tables, have more link relationships than the target tables. Of course, this embodiment can also set a threshold value and compare the link relationships of the tables with the threshold value. Generally, if the number of link relationships of the table is less than or equal to the preset threshold value, the table is defined as the target table. The preset threshold can be determined by multiplying the number of tables stored in the database by a preset ratio. For example, if the database stores 3,000 tables and the preset ratio is 1 / 30, the preset threshold is 100. Of course, those skilled in the art can adjust the preset threshold based on actual circumstances. In this embodiment, using a bank as an example, a personnel registration form is used as the base form, and this personnel registration form is linked to a visitor form in the financial management domain, an insurance application form in the insurance domain, and a card activation form in the credit card domain. Therefore, the personnel registration form is a non-target form, while the visitor form in the financial management domain, the insurance application form in the insurance domain, and the card activation form in the credit card domain are all target forms.

[0049] In an exemplary embodiment, step S104 includes: determining a first set having more tables than other sets as a set to be split; and determining a target table according to the number of link relationships existing in each table in the set to be split.

[0050] It is understandable that this embodiment does not determine the target table from all the first sets. Even if some first sets include many tables, but the link relationship between these tables is relatively clear, and the same table does not have a link relationship with multiple tables, then this embodiment does not need to determine the target table from these tables. Figure 4Although tables p1, p2, and p4 are all linked to table p3, there is no situation where a table is linked to multiple tables at the same time. Therefore, this embodiment does not need to process this type of first set. Figure 5 As shown, there are link relationships between tables t1, t2, t3...t12, and t13, and among these tables, there is a case where one table is linked to multiple tables, such as table t1 and table t4, which both have link relationships with multiple tables. In this case, this embodiment needs to process the first set of this type.

[0051] Because there are first sets with a large number of tables, there will generally be non-target tables, that is, public tables. Based on this, this implementation can screen out the first set with the largest number of tables from multiple first sets, and define the first set with the largest number of tables as the set to be split, and then determine the target table based on the number of link relationships existing in each table in the set to be split. Specifically, the non-target tables with the most link relationships are eliminated, and the remaining tables with a relatively small number of link relationships are defined as target tables, or the tables with a number of link relationships less than or equal to a preset threshold are defined as target tables, and the non-target tables with a number of link relationships greater than the preset threshold are eliminated. Figure 5 As shown, table t1 and table t4 are non-target tables, and tables t2, t3, t5, t6, ..., t12, t13 are all target tables.

[0052] Step S105 : Classify the target tables according to the link relationship between the target tables and the corresponding field information to obtain a plurality of second sets of corresponding field information. There is no link relationship between the target tables in different second sets.

[0053] After selecting the target tables, the target tables can be further classified based on the link relationships between them and the domain information corresponding to the target tables, resulting in multiple second sets of corresponding domain information. It will be appreciated that each second set represents a different domain, target tables within the same second set have link relationships, and target tables in different second sets do not have link relationships. Categorizing tables in different domains allows users to quickly understand the tables included in the database and the corresponding domain information, facilitating searches.

[0054] In an exemplary embodiment, the number of first sets is multiple, and the domain information corresponding to the second set is partially the same as the domain information corresponding to the first set except the set to be split; the second set with different domain information corresponding to the first set and the first set except the set to be split are combined to obtain the target classification set.

[0055] If there are multiple first sets, they represent multiple different fields. The second sets obtained by classifying the target table each represent a field. If the field information corresponding to the first set and the field information corresponding to the second set are partially the same, except for the set to be split, it means that the fields represented by the first set and the fields represented by the second set are partially the same. Therefore, it is necessary to eliminate the sets representing the same fields and combine the second sets corresponding to different field information with the first set to obtain the target classification set.

[0056] In an exemplary embodiment, the number of the first sets is multiple, and the domain information corresponding to the second set is different from the domain information corresponding to the first set except the set to be split; the second set and the first set except the set to be split are combined to obtain the target classification set.

[0057] Similarly, if the domain information corresponding to the first set of the set to be split is different from the domain information corresponding to the second set, it means that the domain represented by the first set and the domain represented by the second set represent different domains. Therefore, the second set and the first set corresponding to different domain information can be directly combined to obtain the target classification set.

[0058] In an exemplary embodiment, the number of first sets is multiple, and the field information corresponding to the second set is the same as the field information corresponding to the first set except the set to be split; the first set except the set to be split is used as the target classification set, and the target table in the second set is associated with the target classification set; or the second set is used as the target classification set, and the table in the first set except the set to be split is associated with the target classification set.

[0059] It is understandable that if the domain information corresponding to the first set excluding the set to be split is the same as the domain information corresponding to the second set, it means that the domain represented by the first set and the domain represented by the second set are the same domain. In this case, either the first set excluding the set to be split can be used as the target classification set, or the second set can be used as the target classification set. If the first set excluding the set to be split is used as the target classification set, it is necessary to associate the target table with the first set of the corresponding domain based on the domain information corresponding to the target table in the second set; if the second set is used as the target classification set, it is necessary to associate the table with the second set based on the domain information corresponding to the table in the first set excluding the set to be split.

[0060] Based on the target classification sets representing different fields obtained in the above three implementation methods, it is possible to classify the tables of information in different fields that are linked together, making it easier for users to find corresponding tables.

[0061] In an exemplary embodiment, this embodiment further includes:

[0062] A text box of a search form, a target classification set, and a table of corresponding field information included in the target classification set are displayed on the human-computer interaction interface.

[0063] When a user clicks on a database storing tables, a text box for searching tables, a target category set, and a table containing the corresponding fields of information within the target category set are displayed on the human-computer interaction interface. If a user enters text within the text box, a table corresponding to the field of information is displayed based on the text entered, making it easier for the user to find the desired table.

[0064] The database table classification method provided in the above embodiment includes: obtaining multiple tables that record field information; determining whether there is a link relationship between different tables; dividing the tables according to the field information corresponding to the tables to obtain at least one first set, the first set including tables corresponding to at least one field information, and there is a link relationship between the multiple tables; determining a target table in the first set, the number of target tables with link relationships is less than or equal to the number of non-target tables with link relationships, or the number of target tables with link relationships is less than or equal to a preset threshold; classifying the target tables according to the link relationships and corresponding field information between the target tables to obtain multiple second sets of corresponding field information, and there is no link relationship between the target tables in different second sets. Taking the financial field as an example, insurance companies or banking institutions have databases that store table information. The databases store a large number of tables, and tables in different fields will be classified into sets of different fields. When a user searches for a table for a financial statement, multiple tables in the financial field will be displayed in the database, making it easier for the user to find the required table information, thereby solving the technical problem that the existing technology does not classify these tables in different fields, and requires a lot of manpower and time to search for tables in the corresponding field from tables in different fields.

[0065] See also Figure 6 , Figure 6 This is a schematic block diagram of a database table classification device provided in an embodiment of the present application. The database table classification device can be configured in a server or electronic device to execute the aforementioned database table classification method.

[0066] like Figure 6 As shown, the database table classification device includes: an acquisition module 110 , a relationship determination module 120 , a field division module 130 , a target table determination module 140 and a classification module 150 .

[0067] The acquisition module 110 is used to acquire a plurality of tables recording field information.

[0068] The relationship determination module 120 is used to determine whether there is a link relationship between different tables.

[0069] The domain division module 130 is used to divide the table according to the domain information corresponding to the table to obtain at least one first set, where the first set includes tables corresponding to at least one domain information, and there are link relationships between the multiple tables.

[0070] The target table determining module 140 is configured to determine a target table in the first set, wherein the number of link relationships of the target table is less than or equal to the number of link relationships of the non-target tables, or the number of link relationships of the target table is less than or equal to a preset threshold.

[0071] The classification module 150 is configured to classify the target tables according to the link relationships between the target tables and the corresponding domain information, and obtain a plurality of second sets of corresponding domain information. There is no link relationship between the target tables in different second sets.

[0072] In an exemplary embodiment, the target table determination module 140 specifically includes a split determination submodule and a target determination submodule.

[0073] The split determination submodule is configured to determine a first set having more tables than other sets as a set to be split.

[0074] The target determination submodule is used to determine the target table according to the number of link relationships existing in each table in the set to be split.

[0075] In an exemplary embodiment, there are multiple first sets, and the domain information corresponding to the second set is partially identical to the domain information corresponding to the first set except the set to be split. Accordingly, the classification device for the database table further includes a first combining submodule.

[0076] The first combining submodule is configured to combine a second set having different domain information from the first set and the first set except the set to be split to obtain a target classification set.

[0077] In an exemplary embodiment, there are multiple first sets, and the domain information corresponding to the second set is different from the domain information corresponding to the first set excluding the set to be split. Accordingly, the classification device for the database table further includes a second combining submodule.

[0078] The second combining submodule is used to combine the second set with the first set except the set to be split to obtain a target classification set.

[0079] In an exemplary embodiment, the number of first sets is multiple, and the domain information corresponding to the second set is the same as the domain information corresponding to the first set except the set to be split. Accordingly, the classification device of the database table also includes a first table association submodule and a second table association submodule.

[0080] The first table associating submodule is configured to take the first set excluding the set to be split as the target classification set, and associate the target table in the second set with the target classification set.

[0081] The second table associating submodule is configured to take the second set as a target classification set and associate the tables in the first set except the set to be split with the target classification set.

[0082] In an exemplary embodiment, the relationship determination module 120 is specifically configured to determine whether a link relationship exists between different tables based on a preset judgment condition and according to text content included in the tables.

[0083] In an exemplary embodiment, the database table classification device further includes a display submodule.

[0084] The display submodule is used to display the text box of the search form, the target classification set and the table of corresponding field information included in the target classification set on the human-computer interaction interface.

[0085] It should be noted that those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described devices and modules and units can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0086] The method of the present application can be used in many general or special computer system environments or configurations. For example: personal computers, server computers, handheld devices or portable devices, tablet devices, multi-processor systems, microprocessor-based systems, set-top boxes, programmable consumer electronic devices, network PCs, minicomputers, mainframe computers, distributed computing environments including any of the above systems or devices, etc. The present application can be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present application can also be practiced in distributed computing environments, in which tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules can be located in local and remote computer storage media, including storage devices.

[0087] Illustratively, the above-mentioned method and apparatus may be implemented in the form of a computer program, which may be run on a computer device.

[0088] See also Figure 7 , Figure 71 is a schematic block diagram of a computer device provided in an embodiment of the present application. The computer device may be a server or an electronic device.

[0089] like Figure 7 As shown, the computer device includes a processor, a memory, and a network interface connected via a system bus, wherein the memory may include a storage medium and an internal memory.

[0090] The storage medium can store an operating system and a computer program. The computer program includes program instructions, and when the program instructions are executed, the processor can execute the steps of any database table classification method.

[0091] The processor is used to provide computing and control capabilities and support the operation of the entire computer equipment.

[0092] The internal memory provides an environment for the operation of the computer program in the storage medium. When the computer program is executed by the processor, the processor can execute the steps of any database table classification method.

[0093] This network interface is used for network communication, such as sending assigned tasks.

[0094] Those skilled in the art will understand that Figure 7 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0095] It should be understood that the processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor, etc.

[0096] In one embodiment, the processor is configured to execute a computer program and implement the following steps when executing the computer program:

[0097] A form for obtaining information on multiple record fields;

[0098] Determine whether there is a link relationship between different tables;

[0099] Divide the tables according to the field information corresponding to the tables to obtain at least one first set, where the first set includes tables corresponding to at least one field information, and a link relationship exists between the multiple tables;

[0100] Determine a target table in the first set, wherein the number of link relationships existing in the target table is less than or equal to the number of link relationships existing in the non-target table, or the number of link relationships existing in the target table is less than or equal to a preset threshold;

[0101] The target tables are classified according to the link relationship between the target tables and the corresponding field information to obtain a plurality of second sets of corresponding field information. There is no link relationship between the target tables in different second sets.

[0102] Furthermore, determining a target table in the first set includes:

[0103] Determine the first set with more tables than the other sets as the set to be split;

[0104] The target table is determined according to the number of link relationships existing in each table in the set to be split.

[0105] In an exemplary embodiment, the number of the first set is multiple, and the domain information corresponding to the second set is partially identical to the domain information corresponding to the first set except for the set to be split;

[0106] After classifying the target tables according to the link relationships between the target tables and the corresponding field information to obtain a second set of multiple corresponding field information, the method further includes:

[0107] The second set having different domain information from that corresponding to the first set is combined with the first set except the set to be split to obtain a target classification set.

[0108] In an exemplary embodiment, the number of the first sets is multiple, and the domain information corresponding to the second set is different from the domain information corresponding to the first set excluding the set to be split;

[0109] After classifying the target tables according to the link relationships between the target tables and the corresponding field information to obtain a second set of multiple corresponding field information, the method further includes:

[0110] The second set is combined with the first set except the set to be split to obtain a target classification set.

[0111] In an exemplary embodiment, the number of the first sets is multiple, and the domain information corresponding to the second set is the same as the domain information corresponding to the first set except the set to be split;

[0112] After classifying the target tables according to the link relationships between the target tables and the corresponding field information to obtain a second set of multiple corresponding field information, the method further includes:

[0113] The first set except the set to be split is used as the target classification set, and the target table in the second set is associated with the target classification set;

[0114] Alternatively, the second set is used as the target classification set, and the tables in the first set except the set to be split are associated with the target classification set.

[0115] Furthermore, determining whether there is a link relationship between different tables includes:

[0116] Based on the preset judgment conditions and according to the text content included in the tables, it is determined whether there is a link relationship between different tables.

[0117] In an exemplary embodiment, the method further includes:

[0118] A text box of a search form, a target classification set, and a table of corresponding field information included in the target classification set are displayed on the human-computer interaction interface.

[0119] It should be noted that those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the above-mentioned classification of database tables can refer to the corresponding process in the aforementioned database table classification method embodiment, and will not be repeated here.

[0120] An embodiment of the present application also provides a computer-readable storage medium on which a computer program is stored. The method implemented when the computer program is executed by a processor can refer to the various embodiments of the classification method of the database table of the present application.

[0121] The computer-readable storage medium may be an internal storage unit of the computer device described in the aforementioned embodiment, such as a hard disk or memory of the computer device. The computer-readable storage medium may also be an external storage device of the computer device, such as a plug-in hard disk, a SmartMedia Card (SMC), a Secure Digital (SD) card, a flash memory card, etc., equipped on the computer device.

[0122] It should be understood that the terms used in this specification are only for the purpose of describing specific embodiments and are not intended to limit the present application. As used in this specification and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms unless the context clearly indicates otherwise.

[0123] It should also be understood that the term "and / or" used in this specification and the appended claims refers to any combination of one or more of the associated listed items and all possible combinations, including these combinations. It should be noted that, in this article, the terms "include", "comprise" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system that includes a series of elements includes not only those elements, but also other elements that are not explicitly listed, or also includes elements that are inherent to such process, method, article or system. In the absence of further restrictions, an element defined by the sentence "including a..." does not exclude the presence of other identical elements in the process, method, article or system that includes the element.

[0124] The serial numbers of the embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments. The above description is only a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed in this application, and these modifications or replacements should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A database table classification method, characterized in that: include: A form for obtaining information on multiple record fields; Based on a preset judgment condition and according to the text content included in the table, determining whether there is a link relationship between different tables; Dividing the table according to the field information corresponding to the table to obtain at least one first set, wherein the first set includes tables corresponding to at least one field information, and the link relationship exists between multiple tables; Determine a target table in the first set, wherein the number of link relationships existing in the target table is less than or equal to the number of link relationships existing in non-target tables, or the number of link relationships existing in the target table is less than or equal to a preset threshold; The target tables are classified according to the link relationship between the target tables and the corresponding field information to obtain multiple second sets of corresponding field information, different second sets correspond to different field information, the link relationship exists between the target tables in the same second set, and the link relationship does not exist between the target tables in different second sets.

2. The database table classification method according to claim 1, characterized in that: The determining of a target table in the first set includes: Determine the first set with more tables than the other sets as the set to be split; A target table is determined according to the number of link relationships existing in each of the tables in the set to be split.

3. The database table classification method according to claim 2, characterized in that: There are multiple first sets, and the domain information corresponding to the second set is partially identical to the domain information corresponding to the first set except for the set to be split; After classifying the target tables according to the link relationships between the target tables and the corresponding field information to obtain a plurality of second sets of corresponding field information, the method further includes: The second set having different domain information from that corresponding to the first set is combined with the first set excluding the set to be split to obtain a target classification set.

4. The database table classification method according to claim 2, characterized in that: There are multiple first sets, and the domain information corresponding to the second set is different from the domain information corresponding to the first set excluding the set to be split; After classifying the target tables according to the link relationships between the target tables and the corresponding field information to obtain a plurality of second sets of corresponding field information, the method further includes: The second set is combined with the first set excluding the set to be split to obtain a target classification set.

5. The database table classification method according to claim 2, characterized in that: There are multiple first sets, and the domain information corresponding to the second sets is the same as the domain information corresponding to the first sets except the set to be split; After classifying the target tables according to the link relationships between the target tables and the corresponding field information to obtain a plurality of second sets of corresponding field information, the method further includes: taking the first set excluding the set to be split as a target classification set, and associating the target table in the second set with the target classification set; Alternatively, the second set is used as a target classification set, and the tables in the first set except the set to be split are associated with the target classification set.

6. The database table classification method according to any one of claims 3 to 5, characterized in that: Also includes: A text box for searching the table, the target classification set, and a table of corresponding field information included in the target classification set are displayed on a human-computer interaction interface.

7. A classification device for a database table, characterized in that: include: The acquisition module is used to obtain tables of multiple record field information; A relationship determination module, configured to determine whether a link relationship exists between different tables based on a preset judgment condition and the text content included in the tables; a domain division module, configured to divide the table according to the domain information corresponding to the table to obtain at least one first set, wherein the first set includes tables corresponding to at least one domain information, and the link relationship exists between the plurality of tables; a target table determining module, configured to determine a target table in the first set, wherein the number of link relationships existing in the target table is less than or equal to the number of link relationships existing in the non-target tables, or the number of link relationships existing in the target table is less than or equal to a preset threshold; A classification module is used to classify the target tables according to the link relationship between the target tables and the corresponding field information to obtain multiple second sets of corresponding field information, where different second sets correspond to different field information, the link relationship exists between the target tables in the same second set, and the link relationship does not exist between the target tables in different second sets.

8. A computer device, characterized in that: The computer device includes a memory and a processor; The memory is used to store computer programs; The processor is configured to execute the computer program and implement the database table classification method according to any one of claims 1 to 6 when executing the computer program.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the database table classification method according to any one of claims 1 to 6 are implemented.

Citation Information

Patent Citations

  • Method for establishing interest theme semantic network facing to social networking services

    CN105893611A

  • Data processing method and device

    CN116303428A