CN116433388B - Data storage resource partitioning method, device, electronic equipment and computer medium - Google Patents
Data storage resource partitioning method, device, electronic equipment and computer medium Download PDFInfo
- Publication number
- CN116433388B CN116433388B CN202310681141.3A CN202310681141A CN116433388B CN 116433388 B CN116433388 B CN 116433388B CN 202310681141 A CN202310681141 A CN 202310681141A CN 116433388 B CN116433388 B CN 116433388B
- Authority
- CN
- China
- Prior art keywords
- information
- storage
- value
- storage resource
- value information
- 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
- 238000013500 data storage Methods 0.000 title claims abstract description 78
- 238000000638 solvent extraction Methods 0.000 title claims abstract description 42
- 238000000034 method Methods 0.000 title claims abstract description 32
- 230000004044 response Effects 0.000 claims abstract description 24
- 238000005192 partition Methods 0.000 claims description 13
- 238000004590 computer program Methods 0.000 claims description 11
- 238000012545 processing Methods 0.000 claims description 10
- 238000012217 deletion Methods 0.000 description 14
- 230000037430 deletion Effects 0.000 description 14
- 238000013524 data verification Methods 0.000 description 11
- 238000010586 diagram Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000005538 encapsulation Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000004904 shortening Methods 0.000 description 1
- 230000002123 temporal effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/06—Asset management; Financial planning or analysis
-
- 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/24—Querying
- G06F16/242—Query formulation
- G06F16/2433—Query languages
-
- 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)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- Operations Research (AREA)
- General Business, Economics & Management (AREA)
- Economics (AREA)
- Game Theory and Decision Science (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the disclosure discloses a data storage resource partitioning method, a data storage resource partitioning device, electronic equipment and a computer medium. One embodiment of the method comprises the following steps: acquiring a first value information sequence corresponding to a first information node in a preset time period, and acquiring a second value information sequence corresponding to a second information node in the preset time period; generating first data storage resource division information corresponding to the first information node according to the first valence information sequence; generating second data storage resource division information corresponding to the second information node according to the second value information sequence; executing storage resource division operation according to the first data storage resource division information and the second data storage resource division information; and in response to receiving the value information table storage task corresponding to the target information node, performing the value information table storage task. According to the embodiment, the computing resources can be reasonably distributed, so that the shortage of the computing resources of part of computing nodes is avoided, and the timeliness of node data computing is ensured.
Description
Technical Field
Embodiments of the present disclosure relate to the field of computer technology, and in particular, to a method, an apparatus, an electronic device, and a computer medium for partitioning data storage resources.
Background
When the investment analysis system analyzes the investment portfolio, the investment portfolio related transaction flow, warehouse holding cost, market information and other data are required to be stored for calculating and analyzing various indexes of the investment portfolio. Company investment management, different investment strategies are realized by different investment combinations, so that the system needs to store data of a plurality of investment computing nodes, and each computing node calculates various indexes to consume computing resources of the system. Currently, for allocation and data storage of computing resources of different computing nodes, the following methods are generally adopted: and averagely distributing the computing resources and storing the data in the value data table one by one.
However, with the above-described method, there are often the following technical problems:
firstly, computing resources are distributed evenly, so that the computing resources of partial computing nodes are insufficient, and node data computing delay is caused easily;
secondly, data in the value data table are stored one by one, which may result in incomplete data storage, lower storage efficiency and larger storage resource consumption.
Thirdly, data in the value data table are stored one by one, so that the storage time is long.
The above information disclosed in this background section is only for enhancement of understanding of the background of the inventive concept and, therefore, may contain information that does not form the prior art that is already known to those of ordinary skill in the art in this country.
Disclosure of Invention
The disclosure is in part intended to introduce concepts in a simplified form that are further described below in the detailed description. The disclosure is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Some embodiments of the present disclosure propose data storage resource partitioning methods, apparatus, electronic devices, and computer readable media to address one or more of the technical problems mentioned in the background section above.
In a first aspect, some embodiments of the present disclosure provide a method of data storage resource partitioning, the method comprising: acquiring a first value information sequence corresponding to a first information node in a preset time period, and acquiring a second value information sequence corresponding to a second information node in the preset time period; generating first data storage resource division information corresponding to the first information node according to the first value information sequence; generating second data storage resource division information corresponding to the second information node according to the second value information sequence; executing storage resource division operation according to the first data storage resource division information and the second data storage resource division information; in response to receiving a value information table storage task corresponding to a target information node, executing the value information table storage task to generate information to be stored of a value information table, wherein the value information table corresponding to the value information table storage task has an association relationship with a sub-value information table set; selecting a target sub-value information table group from the sub-value information table set according to the information to be stored in the value information table; generating an information reading result set according to the information to be stored in the value information table and the target sub-value information table group; and generating storage information corresponding to the value information table and the target sub-value information table group according to the information reading result set, wherein the storage information represents information whether to store in a database or not.
In a second aspect, some embodiments of the present disclosure provide a data storage resource partitioning apparatus, the apparatus comprising: the acquisition unit is configured to acquire a first value information sequence corresponding to a first information node in a preset time period and acquire a second value information sequence corresponding to a second information node in the preset time period; a first generation unit configured to generate first data storage resource division information corresponding to the first information node, based on the first value information sequence; a second generation unit configured to generate second data storage resource division information corresponding to the second information node based on the second value information sequence; a first execution unit configured to execute a storage resource division operation according to the first data storage resource division information and the second data storage resource division information; the second execution unit is configured to respond to receiving a value information table storage task corresponding to a target information node, execute the value information table storage task to generate information to be stored of a value information table, wherein the value information table corresponding to the value information table storage task has an association relationship with a sub value information table set; a selecting unit configured to select a target sub-value information table group from the sub-value information table set according to information to be stored in the value information table; a third generation unit configured to generate an information reading result set according to the information to be stored in the value information table and the target sub-value information table group; and a fourth generation unit configured to generate storage information corresponding to the value information table and the target sub-value information table group according to the information reading result set, wherein the storage information characterizes information whether to store in a database.
In a third aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; a storage device having one or more programs stored thereon, which when executed by one or more processors causes the one or more processors to implement the method described in any of the implementations of the first aspect above.
In a fourth aspect, some embodiments of the present disclosure provide a computer readable medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the method described in any of the implementations of the first aspect above.
The above embodiments of the present disclosure have the following advantageous effects: according to the data storage resource partitioning method of some embodiments of the present disclosure, computing resources can be allocated reasonably, so as to avoid insufficient computing resources of some computing nodes, and ensure timeliness of node data computation. Specifically, the reason for causing the node data calculation delay is that: the average allocation of computing resources is likely to result in insufficient computing resources for some computing nodes. Based on this, in the data storage resource partitioning method of some embodiments of the present disclosure, first, a first value information sequence corresponding to a first information node in a preset time period is obtained, and a second value information sequence corresponding to a second information node in the preset time period is obtained. Thus, data support is provided for computing resources required for the first information node and the second information node. And secondly, generating first data storage resource division information corresponding to the first information node according to the first value information sequence. Thereby, data support is provided for computing resources required for the first information node. And then, generating second data storage resource division information corresponding to the second information node according to the second value information sequence. Thereby providing data support for computing resources required for the second information node. And then, executing storage resource division operation according to the first data storage resource division information and the second data storage resource division information. Therefore, the computing resources can be reasonably distributed, so that the shortage of the computing resources of part of computing nodes is avoided, and the timeliness of the node data computation is ensured. Then, in response to receiving the value information table storage task corresponding to the target information node, the value information table storage task is executed to generate information to be stored in the value information table. And the value information table corresponding to the value information table storage task has an association relationship with the sub value information table set. Thereby facilitating the storage of critical information in the target information node. Then, according to the information to be stored in the value information table, selecting a target sub-value information table group from the sub-value information table set; and generating an information reading result set according to the information to be stored in the value information table and the target sub-value information table group. Therefore, the data storage condition can be known through the information reading result set, and the integrity of the stored data is ensured. And finally, generating storage information corresponding to the value information table and the target sub-value information table group according to the information reading result set. Wherein the stored information characterizes information whether to store to a database. Therefore, the data in the value information table and the target sub-value information tables can be stored by utilizing the generation and the reading of the information, so that the integrity of data storage is improved.
Drawings
The above and other features, advantages, and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. The same or similar reference numbers will be used throughout the drawings to refer to the same or like elements. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale.
FIG. 1 is a flow chart of some embodiments of a data storage resource partitioning method according to the present disclosure;
FIG. 2 is a schematic diagram of the structure of some embodiments of a data storage resource partitioning apparatus according to the present disclosure;
fig. 3 is a schematic structural diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.
It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings. Embodiments of the present disclosure and features of embodiments may be combined with each other without conflict.
It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.
It should be noted that references to "one", "a plurality" and "a plurality" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be understood as "one or more" unless the context clearly indicates otherwise.
The names of messages or information interacted between the various devices in the embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
FIG. 1 illustrates a flow 100 of some embodiments of a data storage resource partitioning method according to the present disclosure. The data storage resource partitioning method comprises the following steps:
Step 101, acquiring a first value information sequence corresponding to a first information node in a preset time period, and acquiring a second value information sequence corresponding to a second information node in the preset time period.
In some embodiments, an execution body (for example, a computing device) of the data storage resource partitioning method may obtain, from a terminal, a first value information sequence corresponding to a first information node in a preset time period and obtain a second value information sequence corresponding to a second information node in the preset time period through a wired connection manner or a wireless connection manner. The time granularity of the preset time period may be one day. One time granularity corresponds to one first value information. One temporal granularity corresponds to one second value information. One first value information corresponds to one second value information. The first value information may be net asset value information for the first inode on the current day. The first information node may be a computing node that invests a certain stock/securities. For example, the first inode may be a computing device of a user. The second information node may be a computing node that invests in a certain stock/securities. For example, the second inode may be a computing device of a user. The second value information may be net asset value information for the day of the second inode. For example, the first value information may be "number 1, net value of asset 10000 yuan, net inflow of funds 0 yuan". The second value information may be "number 1, net asset value 12000, net funds inflow 0". For another example, the first value information may include: date, equity, share, equity inflow, equity, etc. The second value information may include: date, equity, share, equity inflow, equity, etc.
It should be noted that the first information node and the second information node may be any two information nodes. In addition, the first inode and the second inode may further include a plurality of sub inodes. Alternatively, other information nodes (such as third information node, fourth information node …) may be included to participate in the allocation of the storage resources, which is not specifically limited herein.
Step 102, generating first data storage resource division information corresponding to the first information node according to the first value information sequence.
In some embodiments, the execution body may generate first data storage resource partition information corresponding to the first information node according to the first value information sequence.
In practice, first, the execution body may determine, as the storage resource partitioning parameter, a sum of the net inflow of each funds included in the first value information sequence. And then, in response to determining that the storage resource dividing parameter is greater than zero, determining a parameter interval corresponding to the storage resource dividing parameter. And determining the storage resource partition information corresponding to the parameter interval as first data storage resource partition information. Here, each parameter interval corresponds to a storage resource partition information. The parameter interval and the storage resource dividing information are preset. The storage resource partitioning information may represent adding or subtracting a certain value of storage resource (database) to the first information node.
And step 103, generating second data storage resource division information corresponding to the second information node according to the second value information sequence.
In some embodiments, the executing entity may generate second data storage resource partition information corresponding to the second information node according to the second value information sequence.
In practice, first, the execution body may determine, as the second storage resource partitioning parameter, a sum of the respective net inflow funds included in the second value information sequence. And then, in response to determining that the second storage resource partition parameter is greater than zero, determining a parameter interval corresponding to the storage resource partition parameter. And determining the storage resource partition information corresponding to the parameter interval as second data storage resource partition information. Here, each second parameter interval corresponds to a storage resource partition information. The parameter interval and the storage resource dividing information are preset. The storage resource partitioning information may represent adding or subtracting a certain value of storage resource (database) to the second information node.
And 104, executing storage resource division operation according to the first data storage resource division information and the second data storage resource division information.
In some embodiments, the executing body may execute the storage resource partitioning operation according to the first data storage resource partitioning information and the second data storage resource partitioning information.
In practice, first, the executing body may increase or decrease the database corresponding to the first information node according to the first data storage resource partition information. And then, the execution body can increase or decrease the database corresponding to the second information node according to the second data storage resource division information.
And step 105, in response to receiving the value information table storage task corresponding to the target information node, executing the value information table storage task to generate information to be stored in the value information table.
In some embodiments, the executing entity may execute the value information table storing task in response to receiving the value information table storing task of the corresponding target information node, so as to generate information to be stored in the value information table. And the value information table corresponding to the value information table storage task has an association relationship with the sub value information table set. The value information table stores the task information of the corresponding value information table. The target information node is a first information node or a second information node. The value information table may store task information of tasks. The value information table may be a data table composed of a plurality of value information including date, equity value, share, equity inflow, equity units, etc. The value information table storage task may be a task of archiving and storing data in the value information table. The information to be stored in the value information table may be data in the value information table to be stored. For example, the information to be stored in the value information table may be data from a certain date to a preset date in the value information table. The value information table storage task may include the steps of: the first step is to obtain the information to be stored in the value information table corresponding to the task information for storing the value information table by utilizing SQL (Structured Query Language ) sentences. And step two, storing the information to be stored in the value information table into a target database. The sub value information table set may be an information table set having a field association relationship with the value information table. The field association relationship may include a plurality of association relationships. The association relationship may be a table association relationship between the value information table and the child value information table in the child value information table set. The table association relationship may be a relationship in which a primary key value of the value information table is identical to or corresponds to an external key value of the child value information table.
In practice, the executing body may execute the value information table storing task by the following steps to generate information to be stored in the value information table:
first, a value information table storage sentence corresponding to the value information table storage task information is generated. The above-described value information table storing sentence may be a sentence that extracts data to be stored in the value information table. For example, the value information table storage statement may be an SQL statement. First, the table field content corresponding to the value information table storage task information is determined. The table field content may be the content of the information to be stored in the value information table. The table field content may include, but is not limited to, at least one of: database information, table names, storage time periods and field association relations. The database information may be information of a database from which information to be stored is extracted. For example, the database may be a relational database. Then, a main table archive statement is generated from the table field contents.
And step two, determining a storage database corresponding to the value information table storage task information. The storage database may be a database for performing the value information table storage task. A random allocation algorithm may be utilized to determine a storage database corresponding to the value information table storage task information.
And thirdly, controlling the storage database to analyze the value information table storage statement to obtain information to be stored in the value information table.
And 106, selecting a target sub-value information table group from the sub-value information table set according to the information to be stored in the value information table.
In some embodiments, the executing entity may select a target set of sub-value information tables from the set of sub-value information tables according to information to be stored in the value information table. And determining an associated field in the value information table. Next, an attribute field of the associated field is determined. And then, sub-table information corresponding to the attribute field is screened out from each sub-value information table in the sub-value information table set and used as target sub-table information, and a target sub-table information group is obtained. And finally, storing the target sub-value information group in a target sub-value information table form to obtain a target sub-value information table group.
And step 107, generating an information reading result set according to the information to be stored in the value information table and the target sub-value information table group.
In some embodiments, the executing entity may generate an information reading result set according to the information to be stored in the value information table and the target sub-value information table set.
In practice, the execution subject may generate the information reading result set by:
generating target sub-value storage information corresponding to each target sub-value information table in the target sub-value information table group to obtain a target sub-value storage information group. The target sub-value storage information may represent information of a target sub-value information table storage task. The target sub-value information table storage task may be a task of storing data in the target sub-value information table. The sub-table archiving task may comprise the steps of: and acquiring the sub-value storage data corresponding to the target sub-value storage information by utilizing the SQL sentence. And a second step of storing the sub-value storage data into a target database.
And combining the value information table storage task information corresponding to the value information table storage task with the target sub-value storage information to form a storage information set.
Third, for each stored information in the stored information set, the following processing steps are performed:
and a first processing step of generating a stored message group corresponding to the stored information.
Here, the first processing step may include:
1. And determining a storage database corresponding to the storage information in response to determining that the storage information is the target sub-value storage information. First, a sub-storage identifier corresponding to the storage information is determined. Wherein the child storage identification may be identification information characterizing the target child value storage. Next, the number of target sub-value stored information included in the target sub-value stored information group is determined as the sub-value stored information number. Then, it is determined whether the ratio of the sub value storage information amount to the target amount is a target ratio. The target ratio may be any integer. The target number may refer to the number of individual storage databases set. And finally, determining a storage database corresponding to the sub-storage identification in response to determining that the ratio of the sub-value storage information quantity to the target quantity is a target ratio. That is, one of the set storage databases may be randomly selected as the storage database corresponding to the child storage identifier.
2. And controlling the storage database to execute the target sub-value storage task corresponding to the storage information to obtain the sub-value storage data corresponding to the target sub-value storage information.
3. And carrying out data splitting on the sub-value storage data to obtain a split value storage data set. Each of the split value storage data in the split value storage data set may be storage data including a preset data amount. The execution main body can split the data of the sub-value storage data according to the preset data quantity to obtain a split value storage data set.
4. And generating a storage message corresponding to each split value storage data in the split value storage data set to obtain a storage message group. And carrying out data encapsulation on the split value storage data to generate encapsulated value storage data serving as a storage message.
The related matters in the steps 1-4 are taken as an invention point of the embodiment of the disclosure, and the technical problem three mentioned in the background art is solved, wherein the storage time is longer. Factors that lead to longer storage times tend to be as follows: and storing the data in the value data table one by one. If the above factors are solved, the effect of shortening the storage time can be achieved. To achieve this effect, first, in response to determining that the storage information is the target child value storage information, a storage database to which the storage information corresponds is determined. And then, controlling the storage database to execute a target sub-value storage task corresponding to the storage information to obtain sub-value storage data corresponding to the target sub-value storage information. And then, carrying out data splitting on the sub-value storage data to obtain a split value storage data set. And finally, generating a storage message corresponding to each split value storage data in the split value storage data set to obtain a storage message group. Therefore, the data volume of the stored message is ensured, so that the load on a database can be reduced, the storage efficiency of the data to be stored is improved, the range of storage failure is controlled, and the data volume and the storage time of the re-storage are reduced.
And a second processing step of reading the stored message group to generate an information reading result group.
Fourth, each generated information reading result is combined into an information reading result set.
And step 108, generating storage information corresponding to the value information table and the target sub-value information table group according to the information reading result set.
In some embodiments, the executing entity may generate the stored information corresponding to the value information table and the target sub-value information table set according to the information reading result set. Wherein the stored information characterizes information whether to store to a database. The stored information may include information read results that characterize a failure to store and information read results that characterize a success to store.
In practice, the executing entity may generate the stored information corresponding to the value information table and the target sub-value information table set by:
in response to determining that the information reading result set has information reading results representing storage failure, determining at least one information reading result representing storage failure.
Second, for each information reading result of the at least one information reading result, executing the following re-reading steps according to the stored message corresponding to the information reading result:
And a first reading step, determining the corresponding reading times of the stored message.
And a second reading step, namely re-reading the storage message corresponding to the information reading result to obtain an information re-reading result.
And a third reading step, namely, responding to the fact that the information re-reading result represents that the storage is successful, and the reading times are larger than or equal to the preset execution times, and sending the storage information to a preset terminal. The preset terminal may be a terminal that receives a storage message indicating a storage failure.
And thirdly, responding to the fact that the information re-reading result represents storage failure, and the reading times are smaller than the preset execution times, and re-executing the re-reading step.
The above-mentioned related matters serve as an invention point of the embodiments of the present disclosure, and solve the second technical problem mentioned in the background art, namely "causing larger consumption of storage resources". Factors that cause large consumption of storage resources are often as follows: data in the value data table is stored one by one, which may result in incomplete data storage and lower storage efficiency. If the above factors are solved, the effect of reducing the consumption of storage resources can be achieved. To achieve this, first, in response to determining that there is an information reading result that characterizes a storage failure in the above-described information reading result set, at least one information reading result that characterizes the storage failure is determined. Therefore, the data storage condition can be known through the information reading result set, the information reading result representing the storage failure can be conveniently stored again, and the integrity of the data is ensured. Then, for each of the at least one information reading result, performing the following re-reading step according to the stored message corresponding to the information reading result: determining the corresponding reading times of the stored message; re-reading the storage message corresponding to the information reading result to obtain an information re-reading result; and responding to the fact that the information re-reading result represents successful storage, and the reading times are greater than or equal to the preset execution times, and sending the storage information to a preset terminal. And finally, responding to the fact that the information re-reading result represents storage failure, and the reading times are smaller than the preset execution times, and executing the re-reading step again. Therefore, the data in the value information table and the plurality of sub-value information tables can be stored by utilizing the generation and the reading of the storage information, so that the integrity and the efficiency of the data storage are improved, and the consumption of storage resources is reduced.
Optionally, in response to determining that the stored information is information characterizing the value information table to be stored information and the corresponding at least one sub-value stored data to be stored to the target database, for each of the information reading results in the information reading result set, performing the following message reading steps:
and the first step, data verification is carried out on the information to be stored corresponding to the information reading result, and a first data verification result is obtained.
In practice, the first step described above may comprise the sub-steps of:
and a first substep, splicing the information to be stored according to a preset polynomial to obtain spliced information to be stored. The predetermined polynomial may be a polynomial for checking information to be stored. The predetermined polynomial may be a predetermined polynomial expressed in binary form with a coefficient of 1 or 0. Firstly, the information to be stored is expressed in a binary form, and binary information to be stored is obtained. Then, the preset polynomial is expressed in a binary form, and a binary polynomial is obtained. And finally, splicing the binary information to be stored and the binary polynomial to obtain spliced information. And finally, analyzing the splicing information to obtain the splicing information to be stored.
And a second sub-step, performing data verification on the spliced information to be stored to obtain a first data verification result. Firstly, binary representation is carried out on the information to be spliced and stored to obtain binary information to be spliced and stored. And performing modulo-two operation on the binary splicing information to be stored and the preset polynomial to obtain a first data verification result.
And a second step of acquiring stored information for the information reading result. Wherein the stored information may be data already stored in the target database. The stored information may be data of a value information table already stored in the target database, or may be data of a target sub-value information table already stored in the target database.
And thirdly, performing data verification on the stored information to obtain a second data verification result. Wherein the second data verification result characterizes whether the stored information is complete. And when the second data verification result represents that the stored information is incomplete, indicating that the information to be stored has errors in the storage process.
And step four, generating deletion information corresponding to the information to be stored in response to the fact that the first data verification result is the same as the second data verification result. The deletion message may be a message indicating that the information to be stored corresponding to the information reading result is deleted from the database.
And fifthly, reading the deleted information to obtain a deleted information reading result. The deletion information reading result may indicate whether the deletion from the database was successful.
Optionally, table deletion information corresponding to the value information table and the target sub-value information table group is generated according to the obtained respective deletion information reading results.
In some embodiments, the executing entity may generate table deletion information corresponding to the value information table and the target sub-value information table set according to the obtained respective deletion information reading results. Wherein the table deletion information is information characterizing whether the value information table to be stored information and the at least one child value storage data are deleted from a database. First, it is determined whether each of the obtained deletion information read results characterizes deletion success. And then, in response to determining that each deletion information reading result in the deletion information reading results represents successful deletion, obtaining a message that the value information table and the target sub-value information table group are successfully deleted from the database. And finally, responding to the fact that the deleting information reading results representing deleting failure exist in the deleting information reading results, and obtaining a message that the information to be stored corresponding to the deleting information reading results representing deleting failure is not successfully deleted from the database.
With further reference to FIG. 2, as an implementation of the method illustrated in the above figures, the present disclosure provides some embodiments of a data storage resource partitioning apparatus, corresponding to those illustrated in FIG. 1, which may find particular application in a variety of electronic devices.
As shown in fig. 2, the data storage resource partitioning apparatus 200 of some embodiments includes: an acquisition unit 201, a first generation unit 202, a second generation unit 203, a first execution unit 204, a second execution unit 205, a selection unit 206, a third generation unit 207, and a third generation unit 208. The acquiring unit 201 is configured to acquire a first value information sequence corresponding to a first information node in a preset time period and acquire a second value information sequence corresponding to a second information node in the preset time period; a first generating unit 202 configured to generate first data storage resource division information corresponding to the first information node according to the first value information sequence; a second generating unit 203 configured to generate second data storage resource division information corresponding to the second information node according to the second value information sequence; a first execution unit 204 configured to execute a storage resource division operation according to the first data storage resource division information and the second data storage resource division information; a second execution unit 205 configured to execute the value information table storage task in response to receiving the value information table storage task corresponding to the target information node, so as to generate information to be stored in the value information table, wherein the value information table corresponding to the value information table storage task has an association relationship with the sub-value information table set; a selecting unit 206 configured to select a target sub-value information table group from the sub-value information table set according to the information to be stored in the value information table; a third generating unit 207 configured to generate an information reading result set according to the information to be stored in the value information table and the target sub-value information table group; a fourth generating unit 208 configured to generate storage information corresponding to the value information table and the target sub-value information table group according to the information reading result set, wherein the storage information characterizes information whether to store in a database.
It will be appreciated that the elements described in the data storage resource partitioning apparatus 200 correspond to the various steps in the method described with reference to fig. 1. Thus, the operations, features and advantages described above with respect to the method are equally applicable to the data storage resource partitioning apparatus 200 and the units contained therein, and are not described herein.
Referring now to fig. 3, a schematic diagram of an electronic device 300 (e.g., a computing device) suitable for use in implementing some embodiments of the present disclosure is shown. The electronic devices in some embodiments of the present disclosure may include, but are not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), car terminals (e.g., car navigation terminals), and the like, as well as stationary terminals such as digital TVs, desktop computers, and the like. The electronic device shown in fig. 3 is merely an example and should not impose any limitations on the functionality and scope of use of embodiments of the present disclosure.
As shown in fig. 3, the electronic device 300 may include a processing means 301 (e.g., a central processing unit, a graphics processor, etc.) that may perform various suitable actions and processes in accordance with a program stored in a Read Only Memory (ROM) 302 or a program loaded from a storage means 308 into a Random Access Memory (RAM) 303. In the RAM 303, various programs and data required for the operation of the electronic apparatus 300 are also stored. The processing device 301, the ROM 302, and the RAM 303 are connected to each other via a bus 304. An input/output (I/O) interface 305 is also connected to bus 304.
In general, the following devices may be connected to the I/O interface 305: input devices 306 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 307 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 308 including, for example, magnetic tape, hard disk, etc.; and communication means 309. The communication means 309 may allow the electronic device 300 to communicate with other devices wirelessly or by wire to exchange data. While fig. 3 shows an electronic device 300 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead. Each block shown in fig. 3 may represent one device or a plurality of devices as needed.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such embodiments, the computer program may be downloaded and installed from a network via communications device 309, or from storage device 308, or from ROM 302. The above-described functions defined in the methods of some embodiments of the present disclosure are performed when the computer program is executed by the processing means 301.
It should be noted that, the computer readable medium described in some embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In some embodiments of the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, however, the computer-readable signal medium may comprise a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
In some implementations, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (Hyper Text Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.
The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring a first value information sequence corresponding to a first information node in a preset time period, and acquiring a second value information sequence corresponding to a second information node in the preset time period; generating first data storage resource division information corresponding to the first information node according to the first value information sequence; generating second data storage resource division information corresponding to the second information node according to the second value information sequence; executing storage resource division operation according to the first data storage resource division information and the second data storage resource division information; in response to receiving a value information table storage task corresponding to a target information node, executing the value information table storage task to generate information to be stored of a value information table, wherein the value information table corresponding to the value information table storage task has an association relationship with a sub-value information table set; selecting a target sub-value information table group from the sub-value information table set according to the information to be stored in the value information table; generating an information reading result set according to the information to be stored in the value information table and the target sub-value information table group; and generating storage information corresponding to the value information table and the target sub-value information table group according to the information reading result set, wherein the storage information represents information whether to store in a database or not.
Computer program code for carrying out operations for some embodiments of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in some embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. The described units may also be provided in a processor, for example, described as: a processor comprising: the device comprises an acquisition unit, a first generation unit, a second generation unit, a first execution unit, a second execution unit, a selection unit, a third generation unit and a third generation unit. The names of the units are not limited to the unit itself in some cases, for example, the acquisition unit may also be described as "a unit for acquiring a first value information sequence corresponding to a first information node in a preset time period and acquiring a second value information sequence corresponding to a second information node in the preset time period".
The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.
The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above technical features, but encompasses other technical features formed by any combination of the above technical features or their equivalents without departing from the spirit of the invention. Such as the above-described features, are mutually substituted with (but not limited to) the features having similar functions disclosed in the embodiments of the present disclosure.
Claims (6)
1. A data storage resource partitioning method, comprising:
acquiring a first value information sequence corresponding to a first information node in a preset time period, and acquiring a second value information sequence corresponding to a second information node in the preset time period;
generating first data storage resource division information corresponding to the first information node according to the first value information sequence;
wherein generating first data storage resource partition information corresponding to the first information node includes:
determining the sum of all the net inflow of funds included in the first value information sequence as a storage resource dividing parameter;
Determining a parameter interval corresponding to the storage resource partitioning parameter in response to determining that the storage resource partitioning parameter is greater than zero;
determining storage resource division information corresponding to the parameter intervals as first data storage resource division information, wherein each parameter interval corresponds to one storage resource division information, the parameter intervals and the storage resource division information are preset, and the storage resource division information indicates that a certain number of storage resources are added or reduced to a first information node;
generating second data storage resource division information corresponding to the second information node according to the second value information sequence;
wherein generating second data storage resource partitioning information corresponding to the second information node comprises:
determining a sum of the net inflow of each fund included in the second value information sequence as a second storage resource partitioning parameter;
determining a parameter interval corresponding to the storage resource partitioning parameter in response to determining that the second storage resource partitioning parameter is greater than zero;
determining storage resource division information corresponding to the parameter intervals as second data storage resource division information, wherein each second parameter interval corresponds to storage resource division information, the parameter intervals and the storage resource division information are preset, and the storage resource division information represents adding or subtracting a certain value of storage resource to a second information node;
Executing storage resource division operation according to the first data storage resource division information and the second data storage resource division information;
in response to receiving a value information table storage task corresponding to a target information node, executing the value information table storage task to generate information to be stored of a value information table, wherein the value information table corresponding to the value information table storage task has an association relationship with a sub-value information table set, and the target information node is a first information node or a second information node;
selecting a target sub-value information table group from the sub-value information table set according to the information to be stored in the value information table;
generating an information reading result set according to the information to be stored in the value information table and the target sub-value information table group;
wherein generating an information reading result set according to the information to be stored in the value information table and the target sub-value information table group comprises:
generating target sub-value storage information corresponding to each target sub-value information table in the target sub-value information table group to obtain a target sub-value storage information group;
combining the value information table storage task information corresponding to the value information table storage task with the target sub-value storage information to form a storage information set;
For each stored information in the set of stored information, performing the following processing steps:
generating a storage message group corresponding to the storage information;
reading the stored message group to generate an information reading result group;
combining the generated information reading results into an information reading result set;
and generating storage information corresponding to the value information table and the target sub-value information table group according to the information reading result set, wherein the storage information represents information whether to be stored in a database or not.
2. The method of claim 1, wherein the generating the stored message group corresponding to the stored information comprises:
determining a storage database corresponding to the storage information in response to determining that the storage information is target sub-value storage information;
controlling the storage database to execute a target sub-value storage task corresponding to the storage information to obtain sub-value storage data corresponding to the target sub-value storage information;
carrying out data splitting on the sub-value storage data to obtain a split value storage data set;
and generating a storage message corresponding to each split value storage data in the split value storage data set to obtain a storage message group.
3. The method of claim 1, wherein the performing the value information table storage task to generate value information table to store information comprises:
generating a value information table storage statement corresponding to the value information table storage task information;
determining a storage database corresponding to the value information table storage task information;
and controlling the storage database to analyze the value information table storage statement to obtain information to be stored in the value information table.
4. A data storage resource partitioning apparatus, comprising:
the acquisition unit is configured to acquire a first value information sequence corresponding to a first information node in a preset time period and acquire a second value information sequence corresponding to a second information node in the preset time period;
a first generation unit configured to generate first data storage resource division information corresponding to the first information node according to the first value information sequence; the first generation unit is further configured to:
determining the sum of all the net inflow of funds included in the first value information sequence as a storage resource dividing parameter;
determining a parameter interval corresponding to the storage resource partitioning parameter in response to determining that the storage resource partitioning parameter is greater than zero;
Determining storage resource division information corresponding to the parameter intervals as first data storage resource division information, wherein each parameter interval corresponds to one storage resource division information, the parameter intervals and the storage resource division information are preset, and the storage resource division information indicates that a certain number of storage resources are added or reduced to a first information node;
a second generation unit configured to generate second data storage resource partition information corresponding to the second information node according to the second value information sequence; the second generation unit is further configured to:
determining a sum of the net inflow of each fund included in the second value information sequence as a second storage resource partitioning parameter;
determining a parameter interval corresponding to the storage resource partitioning parameter in response to determining that the second storage resource partitioning parameter is greater than zero;
determining storage resource division information corresponding to the parameter intervals as second data storage resource division information, wherein each second parameter interval corresponds to storage resource division information, the parameter intervals and the storage resource division information are preset, and the storage resource division information represents adding or subtracting a certain value of storage resource to a second information node;
A first execution unit configured to execute a storage resource partitioning operation according to the first data storage resource partitioning information and the second data storage resource partitioning information;
the second execution unit is configured to execute the value information table storage task in response to receiving the value information table storage task corresponding to the target information node to generate information to be stored of the value information table, wherein the value information table corresponding to the value information table storage task has an association relationship with the sub-value information table set, and the target information node is the first information node or the second information node;
a selecting unit configured to select a target sub-value information table group from the sub-value information table set according to information to be stored in the value information table;
a third generating unit configured to generate an information reading result set according to the information to be stored in the value information table and the target sub-value information table group; the third generation unit is further configured to:
generating target sub-value storage information corresponding to each target sub-value information table in the target sub-value information table group to obtain a target sub-value storage information group;
combining the value information table storage task information corresponding to the value information table storage task with the target sub-value storage information to form a storage information set;
For each stored information in the set of stored information, performing the following processing steps:
generating a storage message group corresponding to the storage information;
reading the stored message group to generate an information reading result group;
combining the generated information reading results into an information reading result set;
and a fourth generation unit configured to generate storage information corresponding to the value information table and the target sub-value information table group according to the information reading result set, wherein the storage information characterizes information whether to store to a database.
5. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon,
when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-3.
6. A computer readable medium having stored thereon a computer program, wherein the computer program, when executed by a processor, implements the method of any of claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310681141.3A CN116433388B (en) | 2023-06-09 | 2023-06-09 | Data storage resource partitioning method, device, electronic equipment and computer medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310681141.3A CN116433388B (en) | 2023-06-09 | 2023-06-09 | Data storage resource partitioning method, device, electronic equipment and computer medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116433388A CN116433388A (en) | 2023-07-14 |
| CN116433388B true CN116433388B (en) | 2023-09-12 |
Family
ID=87081761
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310681141.3A Active CN116433388B (en) | 2023-06-09 | 2023-06-09 | Data storage resource partitioning method, device, electronic equipment and computer medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116433388B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116629984B (en) * | 2023-07-24 | 2024-02-06 | 中信证券股份有限公司 | Product information recommendation method, device, equipment and medium based on embedded model |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2646661A1 (en) * | 2008-11-18 | 2010-05-18 | Gilbert Laconi | System, apparatus and method for determining resource use and availability |
| CN111694672A (en) * | 2020-06-12 | 2020-09-22 | 北京字节跳动网络技术有限公司 | Resource allocation method, task submission method, device, electronic equipment and medium |
| CN112969079A (en) * | 2021-03-24 | 2021-06-15 | 广州虎牙科技有限公司 | Anchor resource allocation method and device, computer equipment and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107104992B (en) * | 2016-02-19 | 2019-11-22 | 杭州海康威视数字技术股份有限公司 | A kind of the storage resource distribution method and device of video cloud storage |
| US10970309B2 (en) * | 2019-06-05 | 2021-04-06 | Advanced New Technologies Co., Ltd. | Data storage method and apparatus |
-
2023
- 2023-06-09 CN CN202310681141.3A patent/CN116433388B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2646661A1 (en) * | 2008-11-18 | 2010-05-18 | Gilbert Laconi | System, apparatus and method for determining resource use and availability |
| CN111694672A (en) * | 2020-06-12 | 2020-09-22 | 北京字节跳动网络技术有限公司 | Resource allocation method, task submission method, device, electronic equipment and medium |
| CN112969079A (en) * | 2021-03-24 | 2021-06-15 | 广州虎牙科技有限公司 | Anchor resource allocation method and device, computer equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 云计算信息共享平台数据服务安全实现策略;王鹏;;舰船科学技术(02);第150-152页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116433388A (en) | 2023-07-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111125107A (en) | Data processing method, device, electronic equipment and medium | |
| CN111857720B (en) | User interface state information generation method and device, electronic equipment and medium | |
| CN116433388B (en) | Data storage resource partitioning method, device, electronic equipment and computer medium | |
| CN111950857A (en) | Index system management method and device based on service indexes and electronic equipment | |
| CN112102043B (en) | Item recommendation page generation method and device, electronic equipment and readable medium | |
| CN113190517A (en) | Data integration method and device, electronic equipment and computer readable medium | |
| CN112035256A (en) | Resource allocation method, device, electronic equipment and medium | |
| CN113807056B (en) | Document name sequence error correction method, device and equipment | |
| CN112100211B (en) | Data storage method, apparatus, electronic device, and computer readable medium | |
| CN113760927A (en) | Data processing method and device, electronic equipment and computer readable medium | |
| CN111338621A (en) | Data display method and device, electronic equipment and computer readable medium | |
| CN116483808B (en) | Data migration method, device, electronic equipment and computer readable medium | |
| CN111930704B (en) | Service alarm equipment control method, device, equipment and computer readable medium | |
| CN116703263B (en) | Power equipment distribution method, device, electronic equipment and computer readable medium | |
| CN114040014B (en) | Content pushing method, device, electronic equipment and computer readable storage medium | |
| CN116467178B (en) | Database detection method, apparatus, electronic device and computer readable medium | |
| CN116541421B (en) | Address query information generation method and device, electronic equipment and computer medium | |
| CN116932225B (en) | Micro-service resource scheduling method, micro-service resource scheduling device, electronic equipment and computer readable medium | |
| CN116431523B (en) | Test data management method, device, equipment and storage medium | |
| CN117807167A (en) | Database table copying method, apparatus, electronic device and computer readable medium | |
| CN113986959A (en) | Logistics information acquisition method and device, electronic equipment and computer readable medium | |
| CN113779315A (en) | Information generation method and device, electronic equipment and computer readable medium | |
| CN116627900A (en) | Data archiving method, device, electronic equipment, medium and program product | |
| CN116841989A (en) | Lightweight enterprise data center system based on artificial intelligence and construction method | |
| CN117290579A (en) | Information generating method, apparatus, electronic device, computer readable medium, and program product |
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 |