CN112115153A - Data processing method, device, equipment and storage medium - Google Patents
Data processing method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN112115153A CN112115153A CN202010996249.8A CN202010996249A CN112115153A CN 112115153 A CN112115153 A CN 112115153A CN 202010996249 A CN202010996249 A CN 202010996249A CN 112115153 A CN112115153 A CN 112115153A
- Authority
- CN
- China
- Prior art keywords
- field
- record
- target
- formula
- level
- 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.)
- Granted
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 18
- 238000013507 mapping Methods 0.000 claims abstract description 54
- 238000000034 method Methods 0.000 claims abstract description 23
- 238000012545 processing Methods 0.000 claims abstract description 21
- 230000001419 dependent effect Effects 0.000 claims description 21
- 238000004590 computer program Methods 0.000 claims description 9
- 238000012916 structural analysis Methods 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 7
- 230000003287 optical effect Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000000470 constituent Substances 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Images
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/23—Updating
-
- 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/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the disclosure discloses a data processing method, a data processing device, data processing equipment and a storage medium. The method comprises the following steps: according to a target field with a field value changed in the first record, gradually inquiring the mapping relation between a lower field and a higher field in a formula association table to obtain at least one dependency chain of the target field; the dependency chain is used for describing a step-by-step field dependency relationship between a target field and a target formula field containing the target field; according to the first record and the dependency chain, gradually inquiring the mapping relation between a lower record and a higher record in the record association table, and acquiring second records corresponding to each target formula field; and updating each second record according to the updated field value of the target field. The embodiment of the disclosure can adaptively update the records of the formula field when the records of the target field forming the formula field are updated.
Description
Technical Field
The embodiments of the present disclosure relate to the field of data processing technologies, and in particular, to a data processing method, apparatus, device, and storage medium.
Background
Currently, in an Application Platform as a Service (APaaS) system, an object may have a plurality of fields, each having a type attribute. An instance of an object is referred to as an object record, and the object record is generally data that is acquired by a user through an interface during actual use. In some usage scenarios, the values of some formula fields that are retrieved by the user are determined by the values of other fields together. For example, in a scene of sending an express, the detailed address may be formed by splicing fields such as a country, a city, a street, a cell, and the like.
The prior art has the following defects: when the object record of a certain field of the formula field is modified, the object record of the formula field composed by the field cannot be modified correspondingly in real time.
BRIEF SUMMARY OF THE PRESENT DISCLOSURE
The embodiment of the disclosure provides a data processing method, a data processing device, a data processing apparatus, and a storage medium, so as to implement adaptive update on a record of a formula field when the record of a target field constituting the formula field is updated.
In a first aspect, an embodiment of the present disclosure provides a data processing method, including:
according to a target field with a field value changed in the first record, gradually inquiring the mapping relation between a lower field and a higher field in a formula association table to obtain at least one dependency chain of the target field;
the dependency chain is used for describing a step-by-step field dependency relationship between a target field and a target formula field containing the target field;
according to the first record and the dependency chain, gradually inquiring the mapping relation between a lower record and a higher record in the record association table, and acquiring second records corresponding to each target formula field;
and updating each second record according to the updated field value of the target field.
Further, according to a target field in the first record, where a field value is changed, a mapping relationship between a lower field and a higher field in a formula association table is queried step by step, and at least one dependency chain of the target field is obtained, including:
inquiring a formula association table, acquiring all data table items taking the target field as a lower-level field, and extracting a higher-level field in each data table item as a higher-level dependent field of the target field;
searching new upper level dependent fields step by taking each upper level dependent field as a new lower level field until a top level formula field in a data table item is searched;
and generating at least one dependency chain of the target field according to each upper-level dependency field extracted step by step.
Further, according to the first record and the dependency chain, the mapping relationship between the lower record and the upper record in the record association table is queried step by step, and the second record corresponding to each target formula field is obtained, including:
and inquiring the upper-level records in the record association table step by taking the first record as the starting point of the lower-level record and the first field in each dependency chain as the starting point of the lower-level field until the record corresponding to the formula field is inquired for each dependency chain, and taking each inquired record as a second record.
Further, with the first record as a starting point of the lower-level record and the first field in each dependency chain as a starting point of the lower-level field, querying the upper-level record in the record association table step by step until the record corresponding to the formula field is queried for each dependency chain, including:
acquiring a first record as a current subordinate record, and acquiring a first field in a currently processed target dependency chain as a current subordinate field;
inquiring a record association table to obtain a current superior record corresponding to the combination of the current inferior record and the current inferior field;
if the current lower field is not the last field of the target dependency chain, the current upper record is used as a new current lower record;
after the next field of the current subordinate field is obtained in the target dependency chain and used as a new current subordinate field, returning to execute the query record association table, and obtaining the operation of the current superior record corresponding to the combination of the current subordinate record and the current subordinate field;
and if the current lower-level field is the second last-bit field of the target dependency chain, taking the current upper-level record as a record corresponding to the formula field.
Further, before the step of querying a mapping relationship between a lower field and an upper field in the formula association table step by step according to a target field in the first record, where a field value is changed, and obtaining at least one dependency chain of the target field, the method further includes:
acquiring at least one formula configured in advance, wherein the formula is used for defining a formula field;
carrying out structural analysis on the target formula to obtain the dependency relationship between the field of the target formula and each component field of the target formula;
and establishing a formula association table according to the obtained at least one dependency relationship.
Further, after the formula association table is established, the method further includes:
acquiring a current record, and determining a lower-level field associated with the current record by inquiring a formula association table;
acquiring a subordinate record corresponding to the subordinate field, and establishing a mapping relation between the subordinate record and the current record;
and generating a record association table according to the mapping relation among the records.
Further, updating each second record according to the updated field value of the target field, including:
and recalculating the field value of the target formula field according to the updated field value of the target field, and updating the field value of the target formula field in each second record according to the calculation result.
In a second aspect, an embodiment of the present disclosure further provides a data processing apparatus, including:
the dependency chain acquisition module is used for inquiring the mapping relation between a lower-level field and a higher-level field in the formula association table step by step according to a target field with a changed field value in the first record to acquire at least one dependency chain of the target field;
the dependency chain is used for describing a step-by-step field dependency relationship between a target field and a target formula field containing the target field;
the record acquisition module is used for inquiring the mapping relation between the lower-level record and the upper-level record in the record association table step by step according to the first record and the dependency chain, and acquiring second records corresponding to each target formula field;
and the record updating module is used for updating each second record according to the updated field value of the target field.
In a third aspect, an embodiment of the present disclosure further provides an electronic device, including:
one or more processors;
a memory for storing one or more programs;
when the one or more programs are executed by the one or more processors, the one or more processors implement the data processing method according to the embodiment of the present disclosure.
In a fourth aspect, the disclosed embodiments also provide a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements a data processing method according to the disclosed embodiments.
According to the technical scheme of the embodiment, according to a target field with a changed field value in a first record, the mapping relation between a lower field and a higher field in a formula association table is inquired step by step, and at least one dependency chain of the target field is obtained; the dependency chain is used for describing a step-by-step field dependency relationship between a target field and a target formula field containing the target field; then, according to the first record and the dependency chain, the mapping relation between a lower record and a higher record in the record association table is inquired step by step, and second records corresponding to each target formula field are obtained; and updating each second record according to the field value of the updated target field, so that the problem that the records of the formula field formed by a field cannot be correspondingly modified when the records of the field are modified in the prior art is solved, and the records of the formula field can be adaptively updated when the records of the target field formed by the formula field are updated.
Drawings
FIG. 1 is a flow chart of a data processing method in an embodiment of the present disclosure;
FIG. 2 is a flow chart of a method of data processing in another embodiment of the present disclosure;
FIG. 3 is a flow chart of a method of data processing in another embodiment of the present disclosure;
FIG. 4 is a schematic diagram of a dependency tree in another embodiment of the present disclosure;
FIG. 5 is a schematic structural diagram of a data processing apparatus according to another embodiment of the present disclosure;
fig. 6 is a schematic structural diagram of an electronic device in another embodiment of the present disclosure.
Detailed Description
The present disclosure is described in further detail below with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the disclosure and are not limiting of the disclosure. It should be further noted that, for the convenience of description, only some of the structures relevant to the present disclosure are shown in the drawings, not all of them.
Fig. 1 is a flowchart of a data processing method in an embodiment of the present disclosure, which is applicable to a case where a record of a formula field is adaptively updated according to an updated record of a component field of the formula field, and the method may be executed by a data processing apparatus, which may be implemented in software and/or hardware, and may be configured in an electronic device, such as a terminal device. As shown in fig. 1, the method specifically includes the following steps:
and step 110, according to the target field with the changed field value in the first record, gradually inquiring the mapping relation between the lower field and the upper field in the formula association table, and acquiring at least one dependency chain of the target field.
The dependency chain is used for describing a level-by-level field dependency relationship between the target field and a target formula field containing the target field.
In the embodiment of the present disclosure, one object may have a plurality of fields, and accordingly, each record of the object may include a plurality of fields and field values. For example, an employee record for an employee object may include a number of fields for the employee's name, employee number, department name, contact, and specific address. The first record refers to a record modified by a user, and the target field refers to a field specifically modified by the user in the first record, for example, if the user modifies the wage item in the record of employee B from 5000 to 7000, the record of employee B is the first record, and the wage item is the target field.
In the embodiment of the present disclosure, the formula association table is used to represent the upper and lower level mapping relationship between each formula field and each constituent field constituting the formula field. For example, if the type of the field F is an object F, a field a is located under the object F, the type of the field a is an object a, and a field b is located under the object a, the field F is an upper field of the field a, the field a is an upper field of the field b, and accordingly, the field a is a lower field of the field F and the field b is a lower field of the field a.
In the embodiment of the present disclosure, when a field value of a target field in a first record is modified by a user, in order to find a formula field affected by the target field and determine a record corresponding to each formula field and needing adaptive modification, a formula association table needs to be queried step by step according to the target field to obtain at least one dependency chain of the target field, that is, at least one field path from the target field to the target formula field including the target field is obtained, so as to find a record to be updated corresponding to the target formula field according to the field path.
And step 120, according to the first record and the dependency chain, gradually inquiring the mapping relation between the lower record and the upper record in the record association table, and acquiring a second record corresponding to each target formula field.
In the embodiment of the present disclosure, the record association table is used to represent a mapping relationship between records, and each row in the table includes a current record name, an object name corresponding to the current record, a lower field associated with the current record, and an associated record corresponding to the lower field. According to the step-by-step field dependency relationship between the target field and the target formula field embodied by the dependency chain, the records associated with the first record can be screened step by step from the plurality of records in the record association table, and finally the second record to be updated corresponding to the target formula field is found.
And step 130, updating each second record according to the updated field value of the target field.
In the embodiment of the present disclosure, after the second record is found, the value of the formula field affected by the target field may be correspondingly calculated by using the updated value of the target field, and then each second record is updated according to the new value of the formula field, thereby implementing the linked update of the records.
According to the technical scheme of the embodiment, according to a target field with a changed field value in a first record, the mapping relation between a lower field and a higher field in a formula association table is inquired step by step, and at least one dependency chain of the target field is obtained; the dependency chain is used for describing a step-by-step field dependency relationship between a target field and a target formula field containing the target field; then, according to the first record and the dependency chain, the mapping relation between a lower record and a higher record in the record association table is inquired step by step, and second records corresponding to each target formula field are obtained; and updating each second record according to the field value of the updated target field, so that the problem that the records of the formula field formed by a field cannot be correspondingly modified when the records of the field are modified in the prior art is solved, and the records of the formula field can be adaptively updated when the records of the target field formed by the formula field are updated.
Fig. 2 is a flow chart of a data processing method in another embodiment of the present disclosure, which may be combined with various alternatives in the above embodiments. Specifically, referring to fig. 2, the method may include the steps of:
The dependency chain is used for describing a level-by-level field dependency relationship between the target field and a target formula field containing the target field.
Optionally, the step of querying, step by step, a mapping relationship between a lower field and a higher field in a formula association table according to a target field in the first record, where the field value is changed, to obtain at least one dependency chain of the target field may include: inquiring a formula association table, acquiring all data table items taking the target field as a lower-level field, and extracting a higher-level field in each data table item as a higher-level dependent field of the target field; searching new upper level dependent fields step by taking each upper level dependent field as a new lower level field until a top level formula field in a data table item is searched; and generating at least one dependency chain of the target field according to each upper-level dependency field extracted step by step.
In the embodiment of the present disclosure, different records to be updated may be found according to different dependency chains, and in order to find all dependency chains of a target field, all data table items using the target field as a lower-level field need to be searched in a formula association table, and then according to a top-level mapping relationship between fields in the data table items, a higher-level field is extracted from each data table item as a higher-level dependency field of the target field. Aiming at each superior dependency field, judging whether the current processed superior dependency field is a top formula field in the data table items, if not, taking the current processed superior dependency field as a new inferior field, searching all data table items corresponding to the new inferior field in a formula association table, and finding a plurality of new superior dependency fields of the new inferior field through each data table item; and if the upper level dependent fields are top level formula fields in the data table items, generating at least one dependent chain of the target fields according to the upper level dependent fields extracted step by step according to the extraction sequence of the upper level dependent fields.
In the embodiment of the disclosure, according to the step-by-step field dependency relationship between the target field and the target formula field embodied by the dependency chain, the record associated with the first record can be screened step by step from the plurality of records in the record association table, and finally the record to be updated corresponding to the target formula field is found.
Optionally, step by step, according to the first record and the dependency chain, querying a mapping relationship between a lower record and a higher record in the record association table, and obtaining a second record corresponding to each target formula field, may include: and inquiring the upper-level records in the record association table step by taking the first record as the starting point of the lower-level record and the first field in each dependency chain as the starting point of the lower-level field until the record corresponding to the formula field is inquired for each dependency chain, and taking each inquired record as a second record.
In the embodiment of the disclosure, after obtaining at least one dependency chain in which a target formula field is found from a target field, a first record is used as a lower-level record for querying a lowest level of a record association table, a first field in each dependency chain is used as a lower-level field of the lowest level corresponding to the lower-level record, according to the first record and the first field in each dependency chain, the record association table is queried to find an upper-level record associated with the first record, and a new upper-level record is continuously found from top to top on the basis of each upper-level record until a top-level record corresponding to the target formula field is found, and each top-level record is used as a second record to be modified corresponding to the target formula field.
Optionally, with the first record as a starting point of the lower-level record and the first field in each dependency chain as a starting point of the lower-level field, querying the upper-level record in the record association table step by step until the record corresponding to the formula field is queried for each dependency chain, which may include: acquiring a first record as a current subordinate record, and acquiring a first field in a currently processed target dependency chain as a current subordinate field; inquiring a record association table to obtain a current superior record corresponding to the combination of the current inferior record and the current inferior field; if the current lower field is not the last field of the target dependency chain, the current upper record is used as a new current lower record; after the next field of the current subordinate field is obtained in the target dependency chain and used as a new current subordinate field, returning to execute the query record association table, and obtaining the operation of the current superior record corresponding to the combination of the current subordinate record and the current subordinate field; and if the current lower-level field is the second last-bit field of the target dependency chain, taking the current upper-level record as a record corresponding to the formula field.
In the embodiment of the present disclosure, the query is a process of finding the associated higher-level record step by step according to the lower-level record and the lower-level field corresponding to the lower-level record. Specifically, an entry mark dependency chain is selected from at least one dependency chain, a first record is used as a current subordinate record, a first field in a currently processed target dependency chain is used as a current subordinate field corresponding to the current subordinate record, the current subordinate record and the current subordinate field are used as query conditions, a record association table is queried, and a current superior record corresponding to the combination of the current subordinate record and the current subordinate field is found. Judging whether the current lower field is the second last field of the target dependency chain, if so, indicating that the upper field of the current lower field is a formula field, namely, the found current upper record is the record to be updated corresponding to the formula field; if not, the current higher-level field is not a formula field, and the higher-level record of the current higher-level record needs to be continuously inquired, at this time, the current higher-level record is used as a new current lower-level record, the next field of the current lower-level field in the target dependency chain is used as a new current lower-level field, the operation of inquiring the record association table is returned and executed by taking the current lower-level record and the current lower-level field as inquiry conditions until the current lower-level field is the second last field of the target dependency chain, and the current higher-level record at this time is used as a record corresponding to the formula field.
And step 230, updating each second record according to the updated field value of the target field.
Optionally, updating each second record according to the updated field value of the target field may include: and recalculating the field value of the target formula field according to the updated field value of the target field, and updating the field value of the target formula field in each second record according to the calculation result.
In the embodiment of the present disclosure, after the second record corresponding to the target formula field is obtained, the updated field value of the target field is substituted into the calculation formula of the target formula field to obtain the updated field value of the target formula field, and then the original field value of the target formula field in each second record is replaced by the updated field value of the target formula field, so as to update each second record.
According to the technical scheme of the embodiment, according to a target field with a changed field value in a first record, the mapping relation between a lower field and a higher field in a formula association table is inquired step by step, and at least one dependency chain of the target field is obtained; the dependency chain is used for describing a step-by-step field dependency relationship between a target field and a target formula field containing the target field; then, according to the first record and the dependency chain, the mapping relation between a lower record and a higher record in the record association table is inquired step by step, and second records corresponding to each target formula field are obtained; and updating each second record according to the field value of the updated target field, so that the problem that the records of the formula field formed by a field cannot be correspondingly modified when the records of the field are modified in the prior art is solved, and the records of the formula field can be adaptively updated when the records of the target field formed by the formula field are updated.
Fig. 3 is a flow chart of a data processing method in another embodiment of the present disclosure, which may be combined with various alternatives in the above embodiments. Specifically, referring to fig. 3, the method may include the steps of:
and step 310, establishing a formula association table and a record association table in advance.
Optionally, establishing the formula association table may include: acquiring at least one formula configured in advance, wherein the formula is used for defining a formula field; carrying out structural analysis on the target formula to obtain the dependency relationship between the field of the target formula and each component field of the target formula; and establishing a formula association table according to the obtained at least one dependency relationship.
In the embodiment of the disclosure, a plurality of different formulas set by a user according to requirements can be obtained, and each formula is used for defining different formula fields. And aiming at the target formula, performing structural analysis on the target formula to determine which component fields are included in the target formula field defined by the target formula and the field dependency relationship between the target formula field and each component field, and then establishing a formula association table according to the field dependency relationship corresponding to each formula to show which fields are respectively influenced by each formula field.
For example, assuming that the formula f is obtained as a.b.c.d + a.c.1. d + a.d1.c2, and the formula f1 is obtained as c3+ d, the formula defining the formula field f is taken as an example, and the dependency corresponding to the formula field f is obtained. For the formula f ═ a.b.c.d + a.b.c.1.d + a.d1.c2, f is a formula field, a and f belong to the same field under one record, and the object types of the fields a, b, c and d are objA, objB, objC and objD, respectively. By performing structural analysis on the formula, a dependency tree structure as shown in fig. 4 can be obtained, and according to the dependency tree structure, the field f is composed of fields a, b, c, d, c1, d1 and c2, and the field a is a dependent upper field of the field b and the field d1, the field b is a dependent upper field of the field c and the field c1, the fields c and c1 are dependent upper fields of the field d, and the field d1 is a dependent upper field of the field c 2.
Illustratively, according to the obtained field dependencies corresponding to the formulas f and f1, a formula association table may be established as shown below, and the dependencies included in the dependency tree are stored by the formula association table, so that when a certain field in the record is modified, the formula field and the dependency chain corresponding to the field may be found according to the dependency field entry in the table.
It should be noted that although the same dependency field may appear multiple times in the formula association table, the records that it can affect will eventually be different due to the different positions in the dependency tree structure.
Formula association table
| Dependent ID | Formula field | Dependency field | Upper level field ID |
| 1 | f | a | 0 |
| 2 | f | b | 1 |
| 3 | f | c | 2 |
| 4 | f | d | 3 |
| 5 | f | c1 | 2 |
| 6 | f | d | 5 |
| 7 | f | d1 | 1 |
| 8 | f | c2 | 7 |
| 9 | f1 | c3 | 0 |
| 10 | f1 | d | 9 |
In the embodiment of the present disclosure, data in the formula association table is metadata, the metadata is equivalent to a template used for creating records, and the records are runtime data obtained after values of the metadata are taken, so that although the formula association table can be queried to find out the formula fields affected by the updated fields, it is actually impossible to determine which records are to-be-updated records corresponding to the found formula fields, and therefore, a record association table needs to be created to represent association relationships between the records and the fields, so that the records to be updated can be found according to the metadata and the modified records.
Optionally, after the formula association table is established, the method may further include: acquiring a current record, and determining a lower-level field associated with the current record by inquiring a formula association table; acquiring a subordinate record corresponding to the subordinate field, and establishing a mapping relation between the subordinate record and the current record; and generating a record association table according to the mapping relation among the records.
In the embodiment of the present disclosure, each newly created record needs to find the lower level field associated therewith by querying the formula association table, for example, for the current record recordC, the corresponding object is objC, and the lower level field associated therewith can be known to include the fields d and d1 by querying the formula association table. And acquiring the lower records corresponding to the lower fields respectively, and establishing a mapping relationship between the lower records and the current record, for example, if the field d corresponds to the lower record recordD, the recordD is the lower record of the recordC, and a mapping relationship can be established between the recordC and the field d and the recordD. And generating a record association table according to the mapping relation among the records, and continuously adding a new mapping relation into the record association table.
Illustratively, taking the above formula field f and the formula association table as an example, the following record association table may be established. In the record association table, the lower field associated with the record recordF of the object obj includes a field a, the field a corresponds to a record recordA of the objA type, the lower field associated with the record recordA of the object objA includes a field b, the field b corresponds to a record recordB of the objB type, and so on.
Record association table
| Primary key ID | Recording | Object | Association field | Association record |
| 1 | recordA | objA | b | recordB |
| 2 | recordB | objB | c | recordC |
| 3 | recordC | objC | d | recordD |
| 4 | recordB | objB | c1 | recordC |
| 5 | recordF | obj | a | recordA |
And step 320, according to the target field with the changed field value in the first record, gradually inquiring the mapping relation between the lower field and the upper field in the formula association table, and obtaining at least one dependency chain of the target field.
In the embodiment of the disclosure, when a user modifies a first record, a target field with a changed field value in the first record is determined, and a formula association table is queried step by step according to the target field, so as to obtain at least one dependency chain capable of finding a target formula field affected by the target field.
For example, assuming that the first record is a recordC and the target field is a field d in the recordC, the formula association table is queried according to the dependency field being equal to d, and the data table entries with dependency IDs of 4, 6, and 10 corresponding to the target field are obtained, where the formula field corresponding to the field d in the data table entries with dependency IDs of 4 and 6 is f, and the formula field corresponding to the field d in the data table entry with dependency ID of 10 is f 1. Taking a data table entry with a dependency ID of 4 as an example, extracting a higher level field ID of 3 from the data table entry, that is, the higher level dependency field of the field d is a field c corresponding to the dependency ID 3, because the higher level field ID corresponding to the field is not equal to 0, the higher level dependency field c of the field d is not a top level formula field in the data table entry, and it is necessary to continuously extract the higher level dependency field of the field c in the formula association table until the higher level field ID corresponding to the field a is extracted to be equal to 0, and determine that the higher level dependency field of the field a is a formula field f, so as to obtain a dependency chain c- > b- > a- > f of the field d. Correspondingly, for the data table entry with the dependency ID of 6, the dependency chain c1- > b- > a- > f can be finally obtained through progressive query.
In the embodiment of the disclosure, one dependency chain is selected from at least one dependency chain in sequence as a currently processed target dependency chain, when a record corresponding to a formula field affected by a target field is found according to the target dependency chain, the target dependency chain is updated, and a record corresponding to the formula field is continuously selected according to a new target dependency chain.
In the embodiment of the present disclosure, after the first record is used as the current subordinate record for querying the record association table, and the first field in the currently processed target dependency chain is used as the current subordinate field corresponding to the current subordinate record, the record association table may be queried by using the current subordinate record and the current subordinate field as query conditions, and a current superior record corresponding to a combination of the current subordinate record and the current subordinate field, that is, a superior record associated with the first record, is found. There may be a plurality of current upper level records.
For example, assume that the target dependency chain is c- > b- > a- > f, the field c is the current lower level field, the recordC is the current lower level record, the association field is equal to c, the association record is equal to recordC as the query condition, the record association table is queried to find the current upper level record recordB, i.e. the upper level record of the recordC is recordB.
And 360, taking the current superior record as a new current inferior record, acquiring the next field of the current inferior field in the target dependency chain as a new current inferior field, and returning to execute the step 340.
In the embodiment of the present disclosure, if the current lower field is not the last field of the target dependency chain, it indicates that the upper field of the current lower field is not the formula field, and the upper records of each current upper record need to be continuously queried. At this time, each current upper record is respectively used as a new current lower record, the next field of the current lower field in the target dependency chain is used as a new current lower field, and the operation of inquiring the record association table by taking the current lower record and the current lower field as inquiry conditions is returned to be executed until the current lower field is the second last field of the target dependency chain.
Illustratively, since field c is not the second last field in the target dependency chain, it is necessary to continue querying the upper record of recordB. And taking the recordB as the current subordinate record, taking the next field b of the field c as the current subordinate field, returning and executing the operation of inquiring the record association table by taking the association field equal to b and the association record equal to the recordB as the inquiry condition until the current subordinate field is the second last field a in the target dependency chain. At this time, the current upper record recordF is a second record corresponding to the formula field f.
In the embodiment of the present disclosure, if the current lower field is the last field of the target dependency chain, it indicates that the upper field of the current lower field is the formula field, that is, the current upper record found at this time is the record to be updated corresponding to the formula field.
And 380, updating each second record according to the updated field value of the target field.
Exemplarily, after finding the second record recordF, the current field value of the field d is substituted into the formula f ═ a.b.c.d + a.d1.c2, the field value y of the formula field f is recalculated, and the original field value x of the formula field f in the recordF is replaced by y, so that the recordF is adaptively updated along with the update of the field d in the recordC.
It should be noted that, when the formula field can be adaptively updated in real time along with the updating of the component fields, the problem that the search cannot be performed due to a large number of records to be updated when the search is performed according to the formula field can be solved, and the records corresponding to the formula field are adaptively updated in time according to the updating condition of the target field, so that the formula field supports the screening of the search condition.
According to the technical scheme of the embodiment, according to a target field with a changed field value in a first record, the mapping relation between a lower field and a higher field in a formula association table is inquired step by step, and at least one dependency chain of the target field is obtained; the dependency chain is used for describing a step-by-step field dependency relationship between a target field and a target formula field containing the target field; then, according to the first record and the dependency chain, the mapping relation between a lower record and a higher record in the record association table is inquired step by step, and second records corresponding to each target formula field are obtained; and updating each second record according to the field value of the updated target field, so that the problem that the records of the formula field formed by a field cannot be correspondingly modified when the records of the field are modified in the prior art is solved, and the records of the formula field can be adaptively updated when the records of the target field formed by the formula field are updated.
Fig. 5 is a schematic structural diagram of a data processing apparatus in another embodiment of the present disclosure, and the embodiment of the present disclosure is applicable to a case where a record of a formula field is adaptively updated according to an updated record of a component field of the formula field. The apparatus may be implemented in software and/or hardware, and may be generally integrated in an electronic device providing data processing function, such as a terminal device. As shown in fig. 5, the data processing apparatus includes:
a dependency chain obtaining module 510, configured to query, step by step, a mapping relationship between a lower field and a higher field in the formula association table according to a target field in the first record, where a field value is changed, and obtain at least one dependency chain of the target field;
the dependency chain is used for describing a step-by-step field dependency relationship between a target field and a target formula field containing the target field;
a record obtaining module 520, configured to query, step by step, a mapping relationship between a lower record and a higher record in the record association table according to the first record and the dependency chain, and obtain second records corresponding to each target formula field;
and a record updating module 530, configured to update each second record according to the updated field value of the target field.
According to the technical scheme of the embodiment, according to a target field with a changed field value in a first record, the mapping relation between a lower field and a higher field in a formula association table is inquired step by step, and at least one dependency chain of the target field is obtained; the dependency chain is used for describing a step-by-step field dependency relationship between a target field and a target formula field containing the target field; then, according to the first record and the dependency chain, the mapping relation between a lower record and a higher record in the record association table is inquired step by step, and second records corresponding to each target formula field are obtained; and updating each second record according to the field value of the updated target field, so that the problem that the records of the formula field formed by a field cannot be correspondingly modified when the records of the field are modified in the prior art is solved, and the records of the formula field can be adaptively updated when the records of the target field formed by the formula field are updated.
Further, the dependency chain obtaining module 510 is specifically configured to: inquiring a formula association table, acquiring all data table items taking the target field as a lower-level field, and extracting a higher-level field in each data table item as a higher-level dependent field of the target field; searching new upper level dependent fields step by taking each upper level dependent field as a new lower level field until a top level formula field in a data table item is searched; and generating at least one dependency chain of the target field according to each upper-level dependency field extracted step by step.
Further, the record obtaining module 520 is specifically configured to: and inquiring the upper-level records in the record association table step by taking the first record as the starting point of the lower-level record and the first field in each dependency chain as the starting point of the lower-level field until the record corresponding to the formula field is inquired for each dependency chain, and taking each inquired record as a second record.
Further, the record obtaining module 520 is specifically configured to: acquiring a first record as a current subordinate record, and acquiring a first field in a currently processed target dependency chain as a current subordinate field; inquiring a record association table to obtain a current superior record corresponding to the combination of the current inferior record and the current inferior field; if the current lower field is not the last field of the target dependency chain, the current upper record is used as a new current lower record; after the next field of the current subordinate field is obtained in the target dependency chain and used as a new current subordinate field, returning to execute the query record association table, and obtaining the operation of the current superior record corresponding to the combination of the current subordinate record and the current subordinate field; and if the current lower-level field is the second last-bit field of the target dependency chain, taking the current upper-level record as a record corresponding to the formula field.
Further, the method also comprises the following steps: the table building module is used for inquiring the mapping relation between a lower-level field and a higher-level field in the formula association table step by step according to a target field with a changed field value in the first record and acquiring at least one pre-configured formula before acquiring at least one dependency chain of the target field, wherein the formula is used for defining a formula field; carrying out structural analysis on the target formula to obtain the dependency relationship between the field of the target formula and each component field of the target formula; and establishing a formula association table according to the obtained at least one dependency relationship.
Further, the table building module is further configured to: after a formula association table is established, acquiring a current record, and determining a lower-level field associated with the current record by inquiring the formula association table; acquiring a subordinate record corresponding to the subordinate field, and establishing a mapping relation between the subordinate record and the current record; and generating a record association table according to the mapping relation among the records.
Further, the record updating module 530 is specifically configured to: and recalculating the field value of the target formula field according to the updated field value of the target field, and updating the field value of the target formula field in each second record according to the calculation result.
The data processing apparatus provided by the embodiment of the present disclosure and the data processing method provided by the embodiment of the present disclosure belong to the same inventive concept, and technical details that are not described in detail in the embodiment of the present disclosure may be referred to the above embodiment, and the data processing apparatus provided by the embodiment of the present disclosure and the data processing method provided by the above embodiment have the same beneficial effects.
Another embodiment of the present disclosure provides an electronic device, and referring to fig. 6 below, a schematic structural diagram of an electronic device (e.g., a terminal device) 600 suitable for implementing an embodiment of the present disclosure is shown. The electronic devices in the 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), in-vehicle terminals (e.g., car navigation terminals), and the like, and fixed terminals such as digital TVs, desktop computers, and the like. The device shown in fig. 6 is only an example and should not bring any limitation to the function and use range of the embodiments of the present disclosure.
As shown in fig. 6, the apparatus 600 may include a processing device (e.g., central processing unit, graphics processor, etc.) 601 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage device 606 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the apparatus 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
Generally, the following devices may be connected to the I/O interface 605: input devices 606 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 607 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 606 including, for example, magnetic tape, hard disk, etc.; and a communication device 609. The communication means 609 may allow the device 600 to communicate with other devices wirelessly or by wire to exchange data. While fig. 6 illustrates an apparatus 600 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a non-transitory computer readable medium, the computer program containing program code for performing the method illustrated by the flow chart. In such embodiments, the computer program may be downloaded and installed from a network through the communication device 609, or installed from the storage device 606, or installed from the ROM 602. The computer program, when executed by the processing device 601, performs the above-described functions defined in the data processing method of the embodiment of the present disclosure.
Another embodiment of the present disclosure also provides a computer readable storage medium, which may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination 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 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 contrast, in the present disclosure, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. 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, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
The computer readable medium may be embodied in the apparatus; or may be separate and not incorporated into the device.
The computer readable medium carries one or more programs which, when executed by the apparatus, cause the apparatus to: according to a target field with a field value changed in the first record, gradually inquiring the mapping relation between a lower field and a higher field in a formula association table to obtain at least one dependency chain of the target field; the dependency chain is used for describing a step-by-step field dependency relationship between a target field and a target formula field containing the target field; according to the first record and the dependency chain, gradually inquiring the mapping relation between a lower record and a higher record in the record association table, and acquiring second records corresponding to each target formula field; and updating each second record according to the updated field value of the target field.
Computer program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including but not limited to 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 type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart 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 the embodiments of the present disclosure may be implemented by software or hardware. For example, the record obtaining module may be further described as a module that obtains a second record corresponding to each target formula field by querying a mapping relationship between a lower record and an upper record in the record association table step by step according to the first record and the dependency chain.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other embodiments in which any combination of the features described above or their equivalents does not depart from the spirit of the disclosure. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.
Further, while operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limitations on the scope of the disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
Claims (10)
1. A data processing method, comprising:
according to a target field with a field value changed in the first record, gradually inquiring the mapping relation between a lower field and a higher field in a formula association table to obtain at least one dependency chain of the target field;
the dependency chain is used for describing a step-by-step field dependency relationship between a target field and a target formula field containing the target field;
according to the first record and the dependency chain, gradually inquiring the mapping relation between a lower record and a higher record in the record association table, and acquiring second records corresponding to each target formula field;
and updating each second record according to the updated field value of the target field.
2. The method of claim 1, wherein the step of querying a mapping relationship between a lower field and an upper field in the formula association table step by step according to a target field in the first record, where a field value is changed, to obtain at least one dependency chain of the target field comprises:
inquiring a formula association table, acquiring all data table items taking the target field as a lower-level field, and extracting a higher-level field in each data table item as a higher-level dependent field of the target field;
searching new upper level dependent fields step by taking each upper level dependent field as a new lower level field until a top level formula field in a data table item is searched;
and generating at least one dependency chain of the target field according to each superior dependency field extracted step by step.
3. The method according to claim 1, wherein the step of querying a mapping relationship between a lower record and an upper record in the record association table step by step according to the first record and the dependency chain to obtain a second record corresponding to each field of the target formula includes:
and querying the upper-level records in the record association table step by taking the first record as the starting point of the lower-level record and the first field in each dependency chain as the starting point of the lower-level field until the record corresponding to the formula field is queried for each dependency chain, and taking each queried record as the second record.
4. The method of claim 3, wherein the step-by-step querying the upper level records in the record association table with the first record as the starting point of the lower level record and the first field in each dependency chain as the starting point of the lower level field until the record corresponding to the formula field is queried for each dependency chain comprises:
acquiring a first record as a current subordinate record, and acquiring a first field in a currently processed target dependency chain as a current subordinate field;
inquiring a record association table to obtain a current superior record corresponding to the combination of the current inferior record and the current inferior field;
if the current lower field is not the last field of the target dependency chain, the current upper record is used as a new current lower record;
after the next field of the current subordinate field is obtained in the target dependency chain and used as a new current subordinate field, returning to execute the query record association table, and obtaining the operation of the current superior record corresponding to the combination of the current subordinate record and the current subordinate field;
and if the current lower-level field is the second last-bit field of the target dependency chain, taking the current upper-level record as a record corresponding to the formula field.
5. The method of claim 1, wherein before the step of querying a mapping relationship between a lower field and an upper field in the formula association table step by step according to a target field in the first record where a field value change occurs, and obtaining at least one dependency chain of the target field, the method further comprises:
obtaining at least one formula configured in advance, wherein the formula is used for defining a formula field;
carrying out structural analysis on a target formula to obtain a dependency relationship between a field of the target formula and each component field of the target formula;
and establishing a formula association table according to the obtained at least one dependency relationship.
6. The method of claim 5, after establishing the formula association table, further comprising:
acquiring a current record, and determining a lower field associated with the current record by inquiring a formula association table;
acquiring a subordinate record corresponding to the subordinate field, and establishing a mapping relation between the subordinate record and the current record;
and generating a record association table according to the mapping relation among the records.
7. The method according to any one of claims 1 to 6, wherein updating each second record according to the field value of the updated target field comprises:
and recalculating the field value of the target formula field according to the updated field value of the target field, and updating the field value of the target formula field in each second record according to the calculation result.
8. A data processing apparatus, comprising:
the dependency chain acquisition module is used for inquiring the mapping relation between a lower-level field and a higher-level field in the formula association table step by step according to a target field with a changed field value in the first record to acquire at least one dependency chain of the target field;
the dependency chain is used for describing a step-by-step field dependency relationship between a target field and a target formula field containing the target field;
the record acquisition module is used for inquiring the mapping relation between the lower-level record and the upper-level record in the record association table step by step according to the first record and the dependency chain, and acquiring second records corresponding to each target formula field;
and the record updating module is used for updating each second record according to the updated field value of the target field.
9. An electronic device, comprising:
one or more processors;
a memory for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement a data processing method as claimed in any one of claims 1-7.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the data processing method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010996249.8A CN112115153B (en) | 2020-09-21 | 2020-09-21 | Data processing method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010996249.8A CN112115153B (en) | 2020-09-21 | 2020-09-21 | Data processing method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112115153A true CN112115153A (en) | 2020-12-22 |
| CN112115153B CN112115153B (en) | 2024-07-02 |
Family
ID=73801509
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010996249.8A Active CN112115153B (en) | 2020-09-21 | 2020-09-21 | Data processing method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112115153B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112862579A (en) * | 2021-01-21 | 2021-05-28 | 金蝶软件（中国）有限公司 | Material detail data adjusting method and related equipment thereof |
| CN113220528A (en) * | 2021-05-13 | 2021-08-06 | 网宿科技股份有限公司 | Resource object management method, electronic device and storage medium |
| CN113377785A (en) * | 2021-08-16 | 2021-09-10 | 宜科(天津)电子有限公司 | Industrial data processing system |
| CN113779160A (en) * | 2021-08-24 | 2021-12-10 | 北京元年科技股份有限公司 | Method and device for acquiring data of multidimensional database |
| CN114925060A (en) * | 2021-10-12 | 2022-08-19 | 北京沃东天骏信息技术有限公司 | Processing method and device for network relationship of index system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101243365A (en) * | 2005-08-09 | 2008-08-13 | 微软公司 | Server-side project manager |
| US20120023314A1 (en) * | 2010-07-21 | 2012-01-26 | Crum Matthew M | Paired execution scheduling of dependent micro-operations |
| CN106970788A (en) * | 2017-02-24 | 2017-07-21 | 中国人民解放军海军大连舰艇学院 | A kind of object dependency relation based on tense finds method and system |
| CN107833637A (en) * | 2017-06-19 | 2018-03-23 | 平安医疗健康管理股份有限公司 | Medicine regular record update method, device, computer equipment and medium |
| CN110347672A (en) * | 2019-05-27 | 2019-10-18 | 深圳壹账通智能科技有限公司 | Verification method and device, the electronic equipment and storage medium of tables of data related update |
| CN110781373A (en) * | 2019-10-29 | 2020-02-11 | 北京字节跳动网络技术有限公司 | List updating method and device, readable medium and electronic equipment |
| CN111158593A (en) * | 2019-12-26 | 2020-05-15 | 浪潮(北京)电子信息产业有限公司 | Multi-snapshot dependency relationship processing method and device and related components |
-
2020
- 2020-09-21 CN CN202010996249.8A patent/CN112115153B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101243365A (en) * | 2005-08-09 | 2008-08-13 | 微软公司 | Server-side project manager |
| US20120023314A1 (en) * | 2010-07-21 | 2012-01-26 | Crum Matthew M | Paired execution scheduling of dependent micro-operations |
| CN106970788A (en) * | 2017-02-24 | 2017-07-21 | 中国人民解放军海军大连舰艇学院 | A kind of object dependency relation based on tense finds method and system |
| CN107833637A (en) * | 2017-06-19 | 2018-03-23 | 平安医疗健康管理股份有限公司 | Medicine regular record update method, device, computer equipment and medium |
| CN110347672A (en) * | 2019-05-27 | 2019-10-18 | 深圳壹账通智能科技有限公司 | Verification method and device, the electronic equipment and storage medium of tables of data related update |
| CN110781373A (en) * | 2019-10-29 | 2020-02-11 | 北京字节跳动网络技术有限公司 | List updating method and device, readable medium and electronic equipment |
| CN111158593A (en) * | 2019-12-26 | 2020-05-15 | 浪潮(北京)电子信息产业有限公司 | Multi-snapshot dependency relationship processing method and device and related components |
Non-Patent Citations (2)
| Title |
|---|
| KEVIN CORDER 等: "Solving vertex cover via ising model on a neuromorphic processor", 《2018 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS》, pages 1 - 2 * |
| 戴华珍 等: "嵌入式实时数据库面向方面的Qos探讨", 《科技信息》, no. 6, pages 249 - 252 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112862579A (en) * | 2021-01-21 | 2021-05-28 | 金蝶软件（中国）有限公司 | Material detail data adjusting method and related equipment thereof |
| CN113220528A (en) * | 2021-05-13 | 2021-08-06 | 网宿科技股份有限公司 | Resource object management method, electronic device and storage medium |
| CN113377785A (en) * | 2021-08-16 | 2021-09-10 | 宜科(天津)电子有限公司 | Industrial data processing system |
| CN113779160A (en) * | 2021-08-24 | 2021-12-10 | 北京元年科技股份有限公司 | Method and device for acquiring data of multidimensional database |
| CN114925060A (en) * | 2021-10-12 | 2022-08-19 | 北京沃东天骏信息技术有限公司 | Processing method and device for network relationship of index system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112115153B (en) | 2024-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112115153B (en) | Data processing method, device, equipment and storage medium | |
| CN109471838B (en) | Directory document operation method and device, electronic equipment and readable storage medium | |
| CN115757400B (en) | Data table processing method, device, electronic equipment and computer readable medium | |
| CN110781658B (en) | Resume analysis method, resume analysis device, electronic equipment and storage medium | |
| CN111950857A (en) | Index system management method and device based on service indexes and electronic equipment | |
| CN111241823A (en) | Dependency configuration management method and device, electronic equipment and storage medium | |
| CN111241137B (en) | Data processing method, device, electronic equipment and storage medium | |
| CN111124541A (en) | Configuration file generation method, device, equipment and medium | |
| CN112650521B (en) | Software development kit SDK thermal restoration method and device and electronic equipment | |
| CN111625232B (en) | Method and device for generating application program installation package, readable medium and electronic equipment | |
| CN117557394A (en) | Intelligent account checking method, system, equipment and storage medium | |
| CN116644089A (en) | Query statement generation method, device, equipment and storage medium | |
| CN111026629A (en) | Method and device for automatically generating test script | |
| CN111552469B (en) | File processing method and device in application engineering and electronic equipment | |
| CN110413603B (en) | Method and device for determining repeated data, electronic equipment and computer storage medium | |
| CN110442403B (en) | Method, device, electronic equipment and medium for calling functional component | |
| CN111240657A (en) | Method and device for generating SDK and electronic equipment | |
| CN110598133A (en) | Method, apparatus, electronic device, and computer-readable storage medium for determining an order of search items | |
| CN116450666B (en) | PBOM updating method, device and storage medium | |
| CN114116517B (en) | Front-end item analysis method and device, medium and electronic equipment | |
| CN113918164B (en) | Method and device for generating application program package, readable medium and electronic equipment | |
| CN112084003B (en) | Method, device, medium and electronic equipment for isolating data | |
| CN111209479B (en) | Object pushing method and device | |
| CN111857879B (en) | Data processing method, device, electronic equipment and computer readable medium | |
| CN114040014B (en) | Content pushing method, device, electronic equipment and computer 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 |