CN109918433B - Message storage method and device based on universal data interface and computer equipment - Google Patents
Message storage method and device based on universal data interface and computer equipment Download PDFInfo
- Publication number
- CN109918433B CN109918433B CN201910100489.2A CN201910100489A CN109918433B CN 109918433 B CN109918433 B CN 109918433B CN 201910100489 A CN201910100489 A CN 201910100489A CN 109918433 B CN109918433 B CN 109918433B
- Authority
- CN
- China
- Prior art keywords
- data
- data interface
- message
- information
- data table
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000004321 preservation Methods 0.000 claims abstract description 8
- 238000004590 computer program Methods 0.000 claims description 12
- 230000004308 accommodation Effects 0.000 claims description 2
- 238000004364 calculation method Methods 0.000 abstract description 11
- 239000002699 waste material Substances 0.000 abstract description 10
- 238000013507 mapping Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 3
- 230000001360 synchronised effect Effects 0.000 description 2
- 108010001267 Protein Subunits Proteins 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer And Data Communications (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a message preservation method, a device, a computer device and a storage medium based on a universal data interface, wherein the method comprises the following steps: receiving a message sent by a data provider by adopting a preset first data interface; analyzing the message to obtain a plurality of information segments in the message; judging whether a data table comprising all the information segments can be generated through the existing table structure of the first data interface; if the data table comprising all the information segments cannot be generated, judging whether a first universal data interface capable of generating the data table comprising all the information segments by utilizing the existing table structure of the data interface exists in a plurality of preset universal data interfaces or not; and if the first universal data interface exists, calling the first universal data interface, and storing the message into a data table. Thus avoiding the waste of calculation force and reducing repeated codes.
Description
Technical Field
The present application relates to the field of computers, and in particular, to a method and apparatus for storing a message based on a universal data interface, a computer device, and a storage medium.
Background
The data provider uses a message composed of a plurality of information segments to deliver data information. When receiving the message composed of a plurality of information segments, an interface is required for receiving. If the existing table structure of the interface can be matched with the message formed by the plurality of information segments (namely, all the information segments can be represented by the existing table structure of the interface), the data table corresponding to the message can be directly generated through the interface. However, it is not possible to adapt the existing table structure of a specific interface to all messages, and at this time, a new table is generated in real time (according to the new table structure) to accommodate all the information segments of the message, which requires more computation and more code (for generating the new table structure). Therefore, the prior art has the problems of labor waste and code waste.
Disclosure of Invention
The application mainly aims to provide a message preservation method, a message preservation device, computer equipment and a storage medium based on a general data interface, which aim to reduce the waste of calculation force and avoid the waste of codes.
In order to achieve the above object, the present application provides a message storage method based on a universal data interface, which includes the following steps:
Receiving a message sent by a data provider by adopting a preset first data interface, wherein the message is composed of a plurality of information segments;
Analyzing the message to obtain a plurality of information segments in the message;
judging whether a data table comprising all the information segments can be generated through the existing table structure of the first data interface;
If the existing table structure of the first data interface can not generate the data table comprising all the information segments, judging whether a first universal data interface capable of generating the data table comprising all the information segments by using the existing table structure of the data interface exists in a plurality of preset universal data interfaces or not;
And if the first universal data interface exists, calling the first universal data interface, and storing the message into a data table.
Further, the step of receiving, by using a preset first data interface, a message sent by a data provider, where the message includes, before the step of forming a plurality of information segments, the steps of:
counting the second universal data interface with the largest called times from the preset plurality of universal data interfaces within the preset time before the current time;
the second generic data interface is denoted as the first data interface.
Further, the step of determining whether a data table including all the information segments can be generated through an existing table structure of the first data interface includes:
Judging whether all the information segments can be accommodated in a data table generated by the existing table structure of the first data interface;
if it can be accommodated in a data table generated by an existing table structure of said first data interface, it is determined that a data table comprising all said pieces of information can be generated.
Further, the step of determining whether all the pieces of information can be accommodated in a data table generated by an existing table structure of the first data interface includes:
Judging whether all the information segments are matched with the fields of the existing table structure of the first data interface;
If there is a match, then the determination can be accommodated in a data table generated by an existing table structure of the first data interface.
Further, after the step of determining whether the data table including all the information segments can be generated by the existing table structure of the first data interface, the step of determining includes:
and if the data table comprising all the information segments can be generated, storing the message into the data table through the first data interface.
Further, if the existing table structure of the first data interface is not capable of generating the data table including all the information segments, determining whether there is a first generic data interface capable of generating the data table including all the information segments using the existing table structure of the data interface among the preset plurality of generic data interfaces, including:
if the existing table structure of the first data interface can not generate a data table comprising all the information segments, judging whether all the information segments can be accommodated in the data table generated by the preset existing table structures of a plurality of universal data interfaces;
If the first universal data interface can be accommodated in a data table generated through the existing table structure of the preset plurality of universal data interfaces, the first universal data interface capable of generating the data table comprising all the information segments is judged.
Further, if the existing table structure of the first data interface is not capable of generating the data table including all the information segments, the step of determining whether there is a first generic data interface capable of generating the data table including all the information segments using the existing table structure of the data interface among the preset plurality of generic data interfaces includes:
if the first universal data interface does not exist, a second universal data interface capable of generating a data table comprising the maximum information segments is obtained from a plurality of preset universal data interfaces;
Calling the second general data interface and storing the message into a preliminary data table;
Judging whether the name of the information segment lost by the preliminary data table relative to the message exists in a preset important information segment name list or not;
And if the preliminary data table does not exist in the preset important information segment name list relative to the information segment names lost by the message, the preliminary data table is marked as a final data table.
The application provides a message storage device based on a universal data interface, which comprises:
the message receiving unit is used for receiving a message sent by a data provider by adopting a preset first data interface, wherein the message consists of a plurality of information segments;
the analysis unit is used for analyzing the message and obtaining a plurality of information segments in the message;
a data table judging unit for judging whether the existing table structure through the first data interface can generate a data table including all the information segments;
A first general data interface judging unit, configured to judge whether a first general data interface capable of generating a data table including all the information segments using an existing table structure of a data interface exists among a plurality of preset general data interfaces if the data table including all the information segments cannot be generated by the existing table structure of the first data interface;
And the message storage unit is used for calling the first universal data interface and storing the message into a data table if the first universal data interface exists.
The present application provides a computer device comprising a memory storing a computer program and a processor implementing the steps of any of the methods described above when the processor executes the computer program.
The present application provides a computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of the method of any of the preceding claims.
The message storage method, the device, the computer equipment and the storage medium based on the universal data interface adopt a preset first data interface to receive the message sent by the data provider; analyzing the message to obtain a plurality of information segments in the message; judging whether the existing table structure of the first data interface can generate a data table comprising all the information segments; if not, the universal data interface capable of generating the data table comprising all the information segments is called from a plurality of preset universal data interfaces, so that the waste of calculation force is avoided, and repeated codes are reduced.
Drawings
FIG. 1 is a flow chart of a message preservation method based on a universal data interface according to an embodiment of the application;
FIG. 2 is a schematic block diagram illustrating a message storing apparatus based on a universal data interface according to an embodiment of the present application;
Fig. 3 is a schematic block diagram of a computer device according to an embodiment of the present application.
The achievement of the objects, functional features and advantages of the present application will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
Referring to fig. 1, an embodiment of the present application provides a method for storing a message based on a universal data interface, including the following steps:
s1, receiving a message sent by a data provider by adopting a preset first data interface, wherein the message is composed of a plurality of information segments;
S2, analyzing the message to obtain a plurality of information segments in the message;
S3, judging whether the existing table structure of the first data interface can generate a data table comprising all the information segments;
S4, if the existing table structure of the first data interface can not generate the data table comprising all the information segments, judging whether the first universal data interface capable of generating the data table comprising all the information segments by using the existing table structure of the data interface exists in a plurality of preset universal data interfaces;
s5, if the first universal data interface exists, calling the first universal data interface, and storing the message into a data table.
As described in step S1, a message sent by a data provider is received by using a preset first data interface, where the message is composed of a plurality of information segments. The message is a data unit exchanged and transmitted in the network, and is the data interacted between each system, namely, the data block to be sent by the data provider at one time. The message contains complete data information to be transmitted, has very inconsistent length and unlimited and variable length, and is composed of a plurality of information segments. For example, in the message in XML format, the message is presented in the form of < body > < span > < 123</span > < h > abc </h > </body >, wherein the message comprises a message segment span (content is 123) and a message segment h (content is abc). Of course, more than two of the above-mentioned pieces of information are possible.
And (2) analyzing the message to obtain a plurality of information segments in the message. And analyzing a plurality of information segments from the message to obtain the names of the information segments and the specific contents in the information segments. For example, for a message in XML format, according to the predetermined format of < first information segment name > first information segment content < first information segment name > < second information segment name > second information segment content > … …, the first information segment name, first information segment content, second information segment name, second information segment content … … are obtained by parsing. For other messages with preset rules, a plurality of information segments can be obtained through analysis in the same way.
As described in the above step S3, it is determined whether the data table including all the pieces of information can be generated through the existing table structure of the first data interface. If the existing table structure of the first data interface can map the message directly into the data table, then a new data table structure is not required to be created, so that extra calculation power is avoided, and excessive codes are not required. Specifically determining whether a data table including all of the information segments can be generated by an existing table structure of the first data interface includes: judging whether the names of all the information segments are the same as the field names in the same existing table structure, and if so, indicating that the existing table structure of the first data interface can map the text into a data table. Further, the existing table structure of the first data interface further includes other fields different from the information segment name.
If the existing table structure of the first data interface is not capable of generating the data table including all the information segments, it is determined whether there is a first generic data interface capable of generating the data table including all the information segments using the existing table structure of the data interface among the preset plurality of generic data interfaces, as described in the above step S4. As described above, the first data interface cannot map the message into the data table without creating a new table structure, and then it can find out whether other data interfaces can map the message into the data table without creating a new table structure. The specific process comprises the following steps: judging whether the names of all the information segments are the same as the field names in the same existing table structure of a plurality of preset universal data interfaces, and if so, judging that a first universal data interface capable of generating a data table comprising all the information segments exists. Further, the existing table structure of the first generic data interface also includes other fields that are different from the information segment names.
If the first generic data interface exists, the first generic data interface is called and the message is saved as a data table as described in step S5. And since the first universal data interface is judged to be suitable for processing the message, calling the first universal data interface to store the message into a data table, and thus realizing the message storage operation. Further, the data table mapped by the message can be stored in a table of a database, and also can be stored in a file. Preferably, the xml and json formats are stored in tables in a database, yml or other formats are stored in a file.
In one embodiment, the receiving, by using a preset first data interface, a packet sent by a data provider, where before step S1, the packet includes:
S001, counting the second universal data interface with the largest called times from the preset plurality of universal data interfaces within the preset time before the current time;
and S002, the second general data interface is marked as the first data interface.
As described above, setting the first data interface is achieved. The purpose of this embodiment is to find the most commonly used data interface as the first data interface, so as to achieve the purpose of minimizing the recall of other data interfaces. If the first data interface can satisfy the mapping that the message is a data table, then the message storage operation can be realized without calling other data interfaces again. The second generic data interface, which is called most frequently in a predetermined time, indicates that the existing table structure of the second generic data interface is most frequently used, and is suitable as the first data interface, and is accordingly marked as the first data interface.
In one embodiment, the step S3 of determining whether the data table including all the information segments can be generated by the existing table structure of the first data interface includes:
S301, judging whether all the information segments can be accommodated in a data table generated through the existing table structure of the first data interface;
S302, if the data table generated by the existing table structure of the first data interface can be accommodated, it is determined that the data table including all the information pieces can be generated.
As described above, it is achieved that it is determined whether a data table comprising all the pieces of information can be generated by means of an existing table structure of the first data interface. If all the information segments can be nested in the existing table structure of the first data interface to generate a data table, it is indicated that a data table comprising all the information segments can be generated. The judging method for judging whether all the information segments are accommodated in the data table generated by the existing table structure of the first data interface comprises the following steps: judging whether the names of the information segments exist in the existing table structure, if yes, judging that all the information segments can be sleeved in the existing table structure of the first data interface, namely judging that a data table comprising all the information segments can be generated. Further, determining whether the field attribute of the existing table structure can accommodate the information segment is included. For example, whether the length of a field in the table structure is smaller than the length of the corresponding information segment is judged, and if not, the information segment can be accommodated.
In one embodiment, the step S301 of determining whether all the information segments can be accommodated in a data table generated by an existing table structure of the first data interface includes:
s3011, judging whether all the information segments are matched with the fields of the existing table structure of the first data interface;
s3012, if they match, determining that they can be accommodated in a data table generated by the existing table structure of the first data interface.
As described above, it is achieved that a determination is made as to whether all of the pieces of information can be accommodated in a data table generated by an existing table structure of the first data interface. Wherein, the matching means that the name of the information segment is the same as the field name in the existing table structure of the first data interface. Further, the matching further includes: the properties of the information segment match field properties of an existing table structure of the first data interface, e.g. the length of the information segment is smaller than the length of the field, so that the field can accommodate the information segment.
In one embodiment, after the step S3 of determining whether the data table including all the information segments can be generated by the existing table structure of the first data interface, the method includes:
s31, if the data table comprising all the information segments can be generated, the message is stored into the data table through the first data interface.
As described above, the message is saved as a data table. If a data table can be generated that includes all the pieces of information, it indicates that the needs of the message save operation can be satisfied, so that the message can be saved directly as a data table without calling other data interfaces. Further, the data table mapped by the message can be stored in a table of a database, and also can be stored in a file. Preferably, the xml and json formats are stored in tables in a database, yml or other formats are stored in a file.
In one embodiment, if the existing table structure of the first data interface is not capable of generating the data table including all the information segments, the step S4 of determining whether there is a first generic data interface capable of generating the data table including all the information segments using the existing table structure of the data interface among the preset plurality of generic data interfaces includes:
S401, if the existing table structure of the first data interface can not generate a data table comprising all the information segments, judging whether all the information segments can be accommodated in the data table generated by the existing table structure of the preset plurality of universal data interfaces;
S402, if the first generic data interface can be accommodated in a data table generated by an existing table structure of a preset plurality of generic data interfaces, it is determined that there is a first generic data interface capable of generating a data table including all the information pieces.
As described above, it is achieved that a determination is made as to whether or not there is a first generic data interface capable of generating a data table comprising all of the pieces of information. The first general data interface is a data interface capable of mapping the message into a data table without information loss and without creating a new table structure. The preset universal data interfaces comprise data interfaces with different existing table structures, so that the generation speed of a message data table is increased, and the required calculation force is reduced. The judging whether all the information segments can be accommodated in a data table generated by the preset existing table structure of a plurality of universal data interfaces specifically comprises the following steps: judging whether the names of the information segments exist in the existing table structure, if yes, judging that all the information segments can be sleeved into a data table generated by the existing table structure of the preset plurality of universal data interfaces, namely judging that the first universal data interface exists. Further, determining whether the field attribute of the existing table structure can accommodate the information segment is included. For example, whether the length of a field in the table structure is smaller than the length of the corresponding information segment is judged, and if not, the information segment can be accommodated.
In one embodiment, if the existing table structure of the first data interface is not capable of generating the data table including all the information segments, the step S4 of determining whether there is a first generic data interface capable of generating the data table including all the information segments using the existing table structure of the data interface among the preset plurality of generic data interfaces includes:
s41, if the first universal data interface does not exist, obtaining a second universal data interface capable of generating a data table comprising the maximum information segments from a plurality of preset universal data interfaces;
S42, calling the second general data interface, and storing the message into a preliminary data table;
S43, judging whether the name of the information segment lost by the preliminary data table relative to the message exists in a preset important information segment name list or not;
S44, if the preliminary data table does not exist in a preset important information segment name list relative to the information segment names lost by the message, the preliminary data table is marked as a final data table.
As described above, obtaining the final data table is achieved. If the first universal data interface does not exist, searching a data interface capable of mapping the message under the condition of minimum information loss from a plurality of preset universal data interfaces. The specific process comprises the following steps: and comparing field names of the plurality of existing table structures with the names of the information segments, finding out the existing table structure with the largest number of the same names, and marking the universal data interface corresponding to the table structure as a second universal data interface. Since the second generic data interface cannot map the message perfectly, the message can only be saved as a preliminary data table. Since the preliminary data table cannot store all the information segments of the message, there is necessarily a loss of information segments. If the lost information segment is not important (by judging whether the lost information segment name exists in the preset important information segment name list, if not, judging that the lost information segment name does not exist), the lost information segment is ignored, and the preliminary data table can be recorded as a final data table. Further, if the lost information segment is important (by judging whether the lost information segment name exists in the preset important information segment name list, if so, judging that the lost information segment name exists), the preliminary data table and the corresponding lost information segment are sent to a worker, and the data table is perfected according to a further instruction (such as completing the information segment) of the worker.
The message storage method based on the universal data interface adopts a preset first data interface to receive the message sent by the data provider; analyzing the message to obtain a plurality of information segments in the message; judging whether the existing table structure of the first data interface can generate a data table comprising all the information segments; if not, the universal data interface capable of generating the data table comprising all the information segments is called from a plurality of preset universal data interfaces, so that the waste of calculation force is avoided, and repeated codes are reduced.
Referring to fig. 2, an embodiment of the present application provides a message storage device based on a generic data interface, including:
A message receiving unit 10, configured to receive a message sent by a data provider by using a preset first data interface, where the message is formed by a plurality of information segments;
The parsing unit 20 is configured to parse the message to obtain a plurality of information segments in the message;
a data table judging unit 30 for judging whether or not a data table including all the information pieces can be generated by an existing table structure of the first data interface;
A first general data interface judging unit 40, configured to judge whether there is a first general data interface capable of generating a data table including all the information pieces using an existing table structure of a data interface among a plurality of preset general data interfaces if the existing table structure of the first data interface is incapable of generating the data table including all the information pieces;
and the message storage unit 50 is configured to call the first generic data interface if the first generic data interface exists, and store the message as a data table.
As described in the above unit 10, a message sent by a data provider is received by using a preset first data interface, where the message is formed by a plurality of information segments. The message is a data unit exchanged and transmitted in the network, and is the data interacted between each system, namely, the data block to be sent by the data provider at one time. The message contains complete data information to be transmitted, has very inconsistent length and unlimited and variable length, and is composed of a plurality of information segments. For example, in the message in XML format, the message is presented in the form of < body > < span > < 123</span > < h > abc </h > </body >, wherein the message comprises a message segment span (content is 123) and a message segment h (content is abc). Of course, more than two of the above-mentioned pieces of information are possible.
As described in the above unit 20, the message is parsed to obtain a plurality of information segments in the message. And analyzing a plurality of information segments from the message to obtain the names of the information segments and the specific contents in the information segments. For example, for a message in XML format, according to the predetermined format of < first information segment name > first information segment content < first information segment name > < second information segment name > second information segment content > … …, the first information segment name, first information segment content, second information segment name, second information segment content … … are obtained by parsing. For other messages with preset rules, a plurality of information segments can be obtained through analysis in the same way.
As described in the above unit 30, it is determined whether a data table comprising all of the pieces of information can be generated by means of the existing table structure of the first data interface. If the existing table structure of the first data interface can map the message directly into the data table, then a new data table structure is not required to be created, so that extra calculation power is avoided, and excessive codes are not required. Specifically determining whether a data table including all of the information segments can be generated by an existing table structure of the first data interface includes: judging whether the names of all the information segments are the same as the field names in the same existing table structure, and if so, indicating that the existing table structure of the first data interface can map the text into a data table. Further, the existing table structure of the first data interface further includes other fields different from the information segment name.
As described in the above unit 40, if the existing table structure of the first data interface is not capable of generating the data table including all the information pieces, it is determined whether there is a first generic data interface capable of generating the data table including all the information pieces using the existing table structure of the data interface among the preset plurality of generic data interfaces. As described above, the first data interface cannot map the message into the data table without creating a new table structure, and then it can find out whether other data interfaces can map the message into the data table without creating a new table structure. The specific process comprises the following steps: judging whether the names of all the information segments are the same as the field names in the same existing table structure of a plurality of preset universal data interfaces, and if so, judging that a first universal data interface capable of generating a data table comprising all the information segments exists. Further, the existing table structure of the first generic data interface also includes other fields that are different from the information segment names.
If the first generic data interface exists, the first generic data interface is invoked and the message is saved as a data table, as described in element 50 above. And since the first universal data interface is judged to be suitable for processing the message, calling the first universal data interface to store the message into a data table, and thus realizing the message storage operation. Further, the data table mapped by the message can be stored in a table of a database, and also can be stored in a file. Preferably, the xml and json formats are stored in tables in a database, yml or other formats are stored in a file.
In one embodiment, the apparatus comprises:
The statistics unit is used for counting the second universal data interface with the largest called times from the preset plurality of universal data interfaces within the preset time before the current time;
And the interface marking unit is used for marking the second universal data interface as the first data interface.
As described above, setting the first data interface is achieved. The purpose of this embodiment is to find the most commonly used data interface as the first data interface, so as to achieve the purpose of minimizing the recall of other data interfaces. If the first data interface can satisfy the mapping that the message is a data table, then the message storage operation can be realized without calling other data interfaces again. The second generic data interface, which is called most frequently in a predetermined time, indicates that the existing table structure of the second generic data interface is most frequently used, and is suitable as the first data interface, and is accordingly marked as the first data interface.
In one embodiment, the data table determining unit 30 includes:
A first data interface accommodation judging subunit configured to judge whether all the pieces of information can be accommodated in a data table generated by an existing table structure of the first data interface;
A data table determination subunit, configured to determine that a data table including all the information segments can be generated if the data table can be accommodated in a data table generated by an existing table structure of the first data interface.
As described above, it is achieved that it is determined whether a data table comprising all the pieces of information can be generated by means of an existing table structure of the first data interface. If all the information segments can be nested in the existing table structure of the first data interface to generate a data table, it is indicated that a data table comprising all the information segments can be generated. The judging method for judging whether all the information segments are accommodated in the data table generated by the existing table structure of the first data interface comprises the following steps: judging whether the names of the information segments exist in the existing table structure, if yes, judging that all the information segments can be sleeved in the existing table structure of the first data interface, namely judging that a data table comprising all the information segments can be generated. Further, determining whether the field attribute of the existing table structure can accommodate the information segment is included. For example, whether the length of a field in the table structure is smaller than the length of the corresponding information segment is judged, and if not, the information segment can be accommodated.
In one embodiment, the first data interface accommodates a judgment subunit, including:
the field matching judging module is used for judging whether all the information segments are matched with the fields of the existing table structure of the first data interface;
And the data table judging module is used for judging that the data table can be accommodated in the data table generated by the existing table structure of the first data interface if the data table is matched.
As described above, it is achieved that a determination is made as to whether all of the pieces of information can be accommodated in a data table generated by an existing table structure of the first data interface. Wherein, the matching means that the name of the information segment is the same as the field name in the existing table structure of the first data interface. Further, the matching further includes: the properties of the information segment match field properties of an existing table structure of the first data interface, e.g. the length of the information segment is smaller than the length of the field, so that the field can accommodate the information segment.
In one embodiment, the apparatus comprises:
And the data table storage unit is used for storing the message into a data table through the first data interface if the data table comprising all the information segments can be generated.
As described above, the message is saved as a data table. If a data table can be generated that includes all the pieces of information, it indicates that the needs of the message save operation can be satisfied, so that the message can be saved directly as a data table without calling other data interfaces. Further, the data table mapped by the message can be stored in a table of a database, and also can be stored in a file. Preferably, the xml and json formats are stored in tables in a database, yml or other formats are stored in a file.
In one embodiment, the first universal data interface judging unit 40 includes:
A plurality of universal data interface judging sub-units, configured to judge whether all the information segments can be accommodated in a data table generated by a preset existing table structure of a plurality of universal data interfaces if the existing table structure of the first data interface is unable to generate a data table including all the information segments;
A first general data interface determination subunit configured to determine that there is a first general data interface capable of generating a data table including all the pieces of information if it can be accommodated in a data table generated by an existing table structure of a preset plurality of general data interfaces.
As described above, it is achieved that a determination is made as to whether or not there is a first generic data interface capable of generating a data table comprising all of the pieces of information. The first general data interface is a data interface capable of mapping the message into a data table without information loss and without creating a new table structure. The preset universal data interfaces comprise data interfaces with different existing table structures, so that the generation speed of a message data table is increased, and the required calculation force is reduced. The judging whether all the information segments can be accommodated in a data table generated by the preset existing table structure of a plurality of universal data interfaces specifically comprises the following steps: judging whether the names of the information segments exist in the existing table structure, if yes, judging that all the information segments can be sleeved into a data table generated by the existing table structure of the preset plurality of universal data interfaces, namely judging that the first universal data interface exists. Further, determining whether the field attribute of the existing table structure can accommodate the information segment is included. For example, whether the length of a field in the table structure is smaller than the length of the corresponding information segment is judged, and if not, the information segment can be accommodated.
In one embodiment, the apparatus comprises:
A second general data interface obtaining unit, configured to obtain, from a plurality of preset general data interfaces, a second general data interface capable of generating a data table including at most the information segments, if the first general data interface does not exist;
The second universal data interface calling unit is used for calling the second universal data interface and storing the message into a preliminary data table;
the information segment name judging unit is used for judging whether the information segment names lost by the preliminary data table relative to the message exist in a preset important information segment name list or not;
And the preliminary data table marking unit is used for marking the preliminary data table as a final data table if the name of the information segment lost by the preliminary data table relative to the message does not exist in a preset important information segment name list.
As described above, obtaining the final data table is achieved. If the first universal data interface does not exist, searching a data interface capable of mapping the message under the condition of minimum information loss from a plurality of preset universal data interfaces. The specific process comprises the following steps: and comparing field names of the plurality of existing table structures with the names of the information segments, finding out the existing table structure with the largest number of the same names, and marking the universal data interface corresponding to the table structure as a second universal data interface. Since the second generic data interface cannot map the message perfectly, the message can only be saved as a preliminary data table. Since the preliminary data table cannot store all the information segments of the message, there is necessarily a loss of information segments. If the lost information segment is not important (by judging whether the lost information segment name exists in the preset important information segment name list, if not, judging that the lost information segment name does not exist), the lost information segment is ignored, and the preliminary data table can be recorded as a final data table. Further, if the lost information segment is important (by judging whether the lost information segment name exists in the preset important information segment name list, if so, judging that the lost information segment name exists), the preliminary data table and the corresponding lost information segment are sent to a worker, and the data table is perfected according to a further instruction (such as completing the information segment) of the worker.
The message storage device based on the universal data interface adopts a preset first data interface to receive a message sent by a data provider; analyzing the message to obtain a plurality of information segments in the message; judging whether the existing table structure of the first data interface can generate a data table comprising all the information segments; if not, the universal data interface capable of generating the data table comprising all the information segments is called from a plurality of preset universal data interfaces, so that the waste of calculation force is avoided, and repeated codes are reduced.
Referring to fig. 3, in an embodiment of the present invention, there is further provided a computer device, which may be a server, and the internal structure of which may be as shown in the drawing. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the computer is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer programs, and a database. The memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The database of the computer equipment is used for storing data used by a message preservation method based on a general data interface. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program, when executed by a processor, implements a message preservation method based on a universal data interface.
The processor executes the message saving method based on the universal data interface, and the method comprises the following steps: receiving a message sent by a data provider by adopting a preset first data interface, wherein the message is composed of a plurality of information segments; analyzing the message to obtain a plurality of information segments in the message; judging whether a data table comprising all the information segments can be generated through the existing table structure of the first data interface; if the existing table structure of the first data interface can not generate the data table comprising all the information segments, judging whether a first universal data interface capable of generating the data table comprising all the information segments by using the existing table structure of the data interface exists in a plurality of preset universal data interfaces or not; and if the first universal data interface exists, calling the first universal data interface, and storing the message into a data table.
In one embodiment, the step of receiving, by using a preset first data interface, a message sent by a data provider, where the message includes, before the step of forming a plurality of information segments: counting the second universal data interface with the largest called times from the preset plurality of universal data interfaces within the preset time before the current time; the second generic data interface is denoted as the first data interface.
In one embodiment, the step of determining whether a data table including all the pieces of information can be generated by an existing table structure of the first data interface includes: judging whether all the information segments can be accommodated in a data table generated by the existing table structure of the first data interface; if it can be accommodated in a data table generated by an existing table structure of said first data interface, it is determined that a data table comprising all said pieces of information can be generated.
In one embodiment, the step of determining whether all the pieces of information can be accommodated in a data table generated by an existing table structure of the first data interface comprises: judging whether all the information segments are matched with the fields of the existing table structure of the first data interface; if there is a match, then the determination can be accommodated in a data table generated by an existing table structure of the first data interface.
In one embodiment, the step of determining whether the data table including all the information segments can be generated by the existing table structure of the first data interface includes: and if the data table comprising all the information segments can be generated, storing the message into the data table through the first data interface.
In one embodiment, if the existing table structure of the first data interface is not capable of generating the data table including all the information segments, the step of determining whether there is a first generic data interface capable of generating the data table including all the information segments using the existing table structure of the data interface among the preset plurality of generic data interfaces includes: if the existing table structure of the first data interface can not generate a data table comprising all the information segments, judging whether all the information segments can be accommodated in the data table generated by the preset existing table structures of a plurality of universal data interfaces; if the first universal data interface can be accommodated in a data table generated through the existing table structure of the preset plurality of universal data interfaces, the first universal data interface capable of generating the data table comprising all the information segments is judged.
In one embodiment, if the existing table structure of the first data interface is not capable of generating the data table including all the information segments, the step of determining whether there is a first generic data interface capable of generating the data table including all the information segments using the existing table structure of the data interface among the preset plurality of generic data interfaces includes: if the first universal data interface does not exist, a second universal data interface capable of generating a data table comprising the maximum information segments is obtained from a plurality of preset universal data interfaces; calling the second general data interface and storing the message into a preliminary data table; judging whether the name of the information segment lost by the preliminary data table relative to the message exists in a preset important information segment name list or not; and if the preliminary data table does not exist in the preset important information segment name list relative to the information segment names lost by the message, the preliminary data table is marked as a final data table.
It will be appreciated by persons skilled in the art that the structures shown in the drawings are only block diagrams of portions of structures that may be associated with the aspects of the application and are not intended to limit the scope of the computer apparatus to which the aspects of the application may be applied.
The computer equipment of the application adopts a preset first data interface to receive a message sent by a data provider; analyzing the message to obtain a plurality of information segments in the message; judging whether the existing table structure of the first data interface can generate a data table comprising all the information segments; if not, the universal data interface capable of generating the data table comprising all the information segments is called from a plurality of preset universal data interfaces, so that the waste of calculation force is avoided, and repeated codes are reduced.
An embodiment of the present application further provides a computer readable storage medium having a computer program stored thereon, which when executed by a processor, implements a method for storing a message based on a universal data interface, including the steps of: receiving a message sent by a data provider by adopting a preset first data interface, wherein the message is composed of a plurality of information segments; analyzing the message to obtain a plurality of information segments in the message; judging whether a data table comprising all the information segments can be generated through the existing table structure of the first data interface; if the existing table structure of the first data interface can not generate the data table comprising all the information segments, judging whether a first universal data interface capable of generating the data table comprising all the information segments by using the existing table structure of the data interface exists in a plurality of preset universal data interfaces or not; and if the first universal data interface exists, calling the first universal data interface, and storing the message into a data table.
In one embodiment, the step of receiving, by using a preset first data interface, a message sent by a data provider, where the message includes, before the step of forming a plurality of information segments: counting the second universal data interface with the largest called times from the preset plurality of universal data interfaces within the preset time before the current time; the second generic data interface is denoted as the first data interface.
In one embodiment, the step of determining whether a data table including all the pieces of information can be generated by an existing table structure of the first data interface includes: judging whether all the information segments can be accommodated in a data table generated by the existing table structure of the first data interface; if it can be accommodated in a data table generated by an existing table structure of said first data interface, it is determined that a data table comprising all said pieces of information can be generated.
In one embodiment, the step of determining whether all the pieces of information can be accommodated in a data table generated by an existing table structure of the first data interface comprises: judging whether all the information segments are matched with the fields of the existing table structure of the first data interface; if there is a match, then the determination can be accommodated in a data table generated by an existing table structure of the first data interface.
In one embodiment, the step of determining whether the data table including all the information segments can be generated by the existing table structure of the first data interface includes: and if the data table comprising all the information segments can be generated, storing the message into the data table through the first data interface.
In one embodiment, if the existing table structure of the first data interface is not capable of generating the data table including all the information segments, the step of determining whether there is a first generic data interface capable of generating the data table including all the information segments using the existing table structure of the data interface among the preset plurality of generic data interfaces includes: if the existing table structure of the first data interface can not generate a data table comprising all the information segments, judging whether all the information segments can be accommodated in the data table generated by the preset existing table structures of a plurality of universal data interfaces; if the first universal data interface can be accommodated in a data table generated through the existing table structure of the preset plurality of universal data interfaces, the first universal data interface capable of generating the data table comprising all the information segments is judged.
In one embodiment, if the existing table structure of the first data interface is not capable of generating the data table including all the information segments, the step of determining whether there is a first generic data interface capable of generating the data table including all the information segments using the existing table structure of the data interface among the preset plurality of generic data interfaces includes: if the first universal data interface does not exist, a second universal data interface capable of generating a data table comprising the maximum information segments is obtained from a plurality of preset universal data interfaces; calling the second general data interface and storing the message into a preliminary data table; judging whether the name of the information segment lost by the preliminary data table relative to the message exists in a preset important information segment name list or not; and if the preliminary data table does not exist in the preset important information segment name list relative to the information segment names lost by the message, the preliminary data table is marked as a final data table.
The computer readable storage medium of the application adopts a preset first data interface to receive a message sent by a data provider; analyzing the message to obtain a plurality of information segments in the message; judging whether the existing table structure of the first data interface can generate a data table comprising all the information segments; if not, the universal data interface capable of generating the data table comprising all the information segments is called from a plurality of preset universal data interfaces, so that the waste of calculation force is avoided, and repeated codes are reduced.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium provided by the present application and used in embodiments may include non-volatile and/or volatile memory. The nonvolatile memory can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual speed data rate SDRAM (SSRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (SYNCHLINK) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, apparatus, article, or method that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, apparatus, article, or method. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, apparatus, article, or method that comprises the element.
The foregoing description is only of the preferred embodiments of the present application and is not intended to limit the scope of the application, and all equivalent structures or equivalent processes using the descriptions and drawings of the present application or directly or indirectly applied to other related technical fields are included in the scope of the application.
Claims (5)
1. The message preservation method based on the universal data interface is characterized by comprising the following steps:
Receiving a message sent by a data provider by adopting a preset first data interface, wherein the message is composed of a plurality of information segments;
Analyzing the message to obtain a plurality of information segments in the message;
judging whether a data table comprising all the information segments can be generated through the existing table structure of the first data interface;
If the existing table structure of the first data interface can not generate the data table comprising all the information segments, judging whether a first universal data interface capable of generating the data table comprising all the information segments by using the existing table structure of the data interface exists in a plurality of preset universal data interfaces or not;
If the first universal data interface exists, calling the first universal data interface, and storing the message into a data table;
If the existing table structure of the first data interface is not capable of generating the data table including all the information segments, determining whether there is a first generic data interface capable of generating the data table including all the information segments using the existing table structure of the data interface among the preset plurality of generic data interfaces, including:
if the first universal data interface does not exist, a second universal data interface capable of generating a data table comprising the maximum information segments is obtained from a plurality of preset universal data interfaces;
Calling the second general data interface and storing the message into a preliminary data table;
Judging whether the name of the information segment lost by the preliminary data table relative to the message exists in a preset important information segment name list or not;
If the name of the information segment lost by the preliminary data table relative to the message does not exist in a preset important information segment name list, the preliminary data table is marked as a final data table;
the step of receiving a message sent by a data provider by using a preset first data interface, wherein the message comprises the following steps before the step of forming a plurality of information segments:
counting the third universal data interface with the largest called times from the preset plurality of universal data interfaces within the preset time before the current time;
marking the third universal data interface as the first data interface;
The step of determining whether a data table comprising all the pieces of information can be generated by means of an existing table structure of the first data interface, comprises:
Judging whether all the information segments can be accommodated in a data table generated by the existing table structure of the first data interface;
If it can be accommodated in a data table generated by an existing table structure of the first data interface, determining that a data table including all the pieces of information can be generated;
The step of determining whether all the pieces of information can be accommodated in a data table generated by an existing table structure of the first data interface, comprises:
Judging whether all the information segments are matched with the fields of the existing table structure of the first data interface;
If the data interfaces match, determining that the data interfaces can be accommodated in a data table generated by the existing table structure of the first data interface;
after the step of determining whether a data table comprising all the pieces of information can be generated by means of an existing table structure of the first data interface, it comprises:
and if the data table comprising all the information segments can be generated, storing the message into the data table through the first data interface.
2. The method for storing a message based on a universal data interface according to claim 1, wherein the step of determining whether there is a first universal data interface capable of generating a data table including all the information pieces using an existing table structure of a data interface among a plurality of preset universal data interfaces if the existing table structure of the first data interface is incapable of generating the data table including all the information pieces comprises:
if the existing table structure of the first data interface can not generate a data table comprising all the information segments, judging whether all the information segments can be accommodated in the data table generated by the preset existing table structures of a plurality of universal data interfaces;
If the first universal data interface can be accommodated in a data table generated through the existing table structure of the preset plurality of universal data interfaces, the first universal data interface capable of generating the data table comprising all the information segments is judged.
3. A message preservation device based on a universal data interface, comprising:
the message receiving unit is used for receiving a message sent by a data provider by adopting a preset first data interface, wherein the message consists of a plurality of information segments;
the analysis unit is used for analyzing the message and obtaining a plurality of information segments in the message;
a data table judging unit for judging whether the existing table structure through the first data interface can generate a data table including all the information segments;
A first general data interface judging unit, configured to judge whether a first general data interface capable of generating a data table including all the information segments using an existing table structure of a data interface exists among a plurality of preset general data interfaces if the data table including all the information segments cannot be generated by the existing table structure of the first data interface;
The message storage unit is used for calling the first universal data interface if the first universal data interface exists, and storing the message into a data table;
The device comprises:
A second general data interface obtaining unit, configured to obtain, from a plurality of preset general data interfaces, a second general data interface capable of generating a data table including at most the information segments, if the first general data interface does not exist;
The second universal data interface calling unit is used for calling the second universal data interface and storing the message into a preliminary data table;
the information segment name judging unit is used for judging whether the information segment names lost by the preliminary data table relative to the message exist in a preset important information segment name list or not;
the primary data table marking unit is used for marking the primary data table as a final data table if the primary data table does not exist in a preset important information segment name list relative to the information segment name lost by the message;
The statistics unit is used for counting the third universal data interface with the largest called times from the preset plurality of universal data interfaces within the preset time before the current time;
an interface marking unit, configured to mark the third universal data interface as the first data interface;
the data table judging unit includes:
A first data interface accommodation judging subunit configured to judge whether all the pieces of information can be accommodated in a data table generated by an existing table structure of the first data interface;
A data table determination subunit configured to determine that a data table including all the pieces of information can be generated if the data table can be accommodated in a data table generated by an existing table structure of the first data interface;
the first data interface accommodates a judging subunit including:
the field matching judging module is used for judging whether all the information segments are matched with the fields of the existing table structure of the first data interface;
a data table determining module for determining that the data table generated by the existing table structure of the first data interface can be accommodated if the data tables are matched;
The device comprises:
And the data table storage unit is used for storing the message into a data table through the first data interface if the data table comprising all the information segments can be generated.
4. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any one of claims 1 to 2 when the computer program is executed.
5. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 2.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910100489.2A CN109918433B (en) | 2019-01-31 | 2019-01-31 | Message storage method and device based on universal data interface and computer equipment |
| PCT/CN2019/119218 WO2020155784A1 (en) | 2019-01-31 | 2019-11-18 | General-purpose data interface-based message storage method and apparatus, and computer device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910100489.2A CN109918433B (en) | 2019-01-31 | 2019-01-31 | Message storage method and device based on universal data interface and computer equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109918433A CN109918433A (en) | 2019-06-21 |
| CN109918433B true CN109918433B (en) | 2024-05-07 |
Family
ID=66961259
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910100489.2A Active CN109918433B (en) | 2019-01-31 | 2019-01-31 | Message storage method and device based on universal data interface and computer equipment |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109918433B (en) |
| WO (1) | WO2020155784A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109918433B (en) * | 2019-01-31 | 2024-05-07 | 平安科技（深圳）有限公司 | Message storage method and device based on universal data interface and computer equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2814433A1 (en) * | 2013-03-15 | 2014-09-15 | Coreworx Inc. | System and method for interface management |
| CN105335310A (en) * | 2014-06-05 | 2016-02-17 | 阿里巴巴集团控股有限公司 | Interface defining method, and data transmission method and apparatus |
| US9613105B1 (en) * | 2013-12-05 | 2017-04-04 | Intuit Inc. | Streamlined data entry based on data relationships |
| CN108959537A (en) * | 2018-06-29 | 2018-12-07 | 新华三大数据技术有限公司 | Web service interface acquisition methods and device |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104216952A (en) * | 2014-08-20 | 2014-12-17 | 烽火通信科技股份有限公司 | Universal report generation method and universal report generation system based on XML (extensive markup language) technology |
| CN105787057B (en) * | 2016-02-29 | 2019-02-15 | 浪潮通用软件有限公司 | The autosynchronous implementation method of business datum between a kind of heterogeneous system |
| CN106557568B (en) * | 2016-11-14 | 2019-05-21 | 中国电子科技集团公司第二十八研究所 | The processing method of XML file format and the relational database conversion of pattern match |
| CN108268253B (en) * | 2017-05-05 | 2020-01-03 | 平安科技（深圳）有限公司 | Interface code generation method and terminal equipment |
| CN109918433B (en) * | 2019-01-31 | 2024-05-07 | 平安科技（深圳）有限公司 | Message storage method and device based on universal data interface and computer equipment |
-
2019
- 2019-01-31 CN CN201910100489.2A patent/CN109918433B/en active Active
- 2019-11-18 WO PCT/CN2019/119218 patent/WO2020155784A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2814433A1 (en) * | 2013-03-15 | 2014-09-15 | Coreworx Inc. | System and method for interface management |
| US9613105B1 (en) * | 2013-12-05 | 2017-04-04 | Intuit Inc. | Streamlined data entry based on data relationships |
| CN105335310A (en) * | 2014-06-05 | 2016-02-17 | 阿里巴巴集团控股有限公司 | Interface defining method, and data transmission method and apparatus |
| CN108959537A (en) * | 2018-06-29 | 2018-12-07 | 新华三大数据技术有限公司 | Web service interface acquisition methods and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109918433A (en) | 2019-06-21 |
| WO2020155784A1 (en) | 2020-08-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109474578B (en) | Message checking method, device, computer equipment and storage medium | |
| CN108804159B (en) | Javascript module loading method and preprocessing method and device thereof, and computer equipment | |
| CN110445636B (en) | Management platform-based micro-service early warning method and device and computer equipment | |
| CN109783742B (en) | Page jump method and device for development assistance and computer equipment | |
| CN104063401B (en) | The method and apparatus that a kind of webpage pattern address merges | |
| CN110704521A (en) | Interface data access method and system | |
| CN110855555B (en) | Mail sending method, device, equipment and computer readable storage medium | |
| CN109936624B (en) | Adaptation method and device for HTTP request message header and computer equipment | |
| CN110750222A (en) | Printing method, printing device, computer equipment and storage medium | |
| CN110765001A (en) | Modularized automatic test method and device for application system | |
| CN113157854B (en) | API sensitive data leakage detection method and system | |
| CN108959384B (en) | Webpage data acquisition method and device, computer equipment and storage medium | |
| CN110636106A (en) | Information pushing method and device, computer equipment and storage medium | |
| CN109918433B (en) | Message storage method and device based on universal data interface and computer equipment | |
| CN111143532B (en) | Dialogue unit access method, device, equipment and storage medium | |
| CN111224878B (en) | Route forwarding method and device, electronic equipment and storage medium | |
| CN112822286A (en) | Message pushing method and device | |
| CN106485520B (en) | Cross-channel communication control method and server | |
| CN111031063B (en) | Data transmission method and device based on family education machine | |
| EP2998885A1 (en) | Method and device for information search | |
| CN110321529B (en) | Frame text display method and device, computer equipment and storage medium | |
| CN109951549B (en) | Network page access method and device and computer readable storage medium | |
| CN110865943A (en) | Interface testing method and device, computer equipment and storage medium | |
| CN114429408B (en) | Method, device, equipment and system for checking configuration file of intelligent substation | |
| CN112672187B (en) | Page generation method and device, computer equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |