CN102193975A - Method for realizing transaction committing mechanism in online transaction of graphic database - Google Patents
Method for realizing transaction committing mechanism in online transaction of graphic database Download PDFInfo
- Publication number
- CN102193975A CN102193975A CN 201110072872 CN201110072872A CN102193975A CN 102193975 A CN102193975 A CN 102193975A CN 201110072872 CN201110072872 CN 201110072872 CN 201110072872 A CN201110072872 A CN 201110072872A CN 102193975 A CN102193975 A CN 102193975A
- Authority
- CN
- China
- Prior art keywords
- value
- affairs
- record
- row
- graphic
- 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
Images
Abstract
The invention relates to a method for realizing a transaction committing mechanism in an online transaction of a graphic database. The method comprises the following steps of: (1) calling an API (Application Program Interface) of graphic data by using a client program and transmitting a transaction number to be committed; (2) checking whether the transaction exists; (3) checking whether the transaction is overdue; (4) checking whether the transaction is committed; (5) checking whether the transaction rolls back; (6) checking whether the transaction is locked; (7) marking a transaction committing state; (8) deleting a data record locked by the transaction; (9) updating a dirty data state; and (10) deleting the transaction record. The invention provides a simple and reliable data transaction committing mechanism, the committing operation has an indivisible 'atomic operation' characteristic, and a third state does not occur between a committing state and a non-committing state. The data operation of the method has optional breakpoint continuity, and data updating can be continually executed by restarting a system after sudden execution interruption from the start of data updating to any completion time point until updating is completed after the transaction committing operation is called.
Description
Technical field
The present invention relates to the implementation method of affairs submission mechanism in a kind of graphic data base online transaction.
Background technology
Usually in Database Systems, affairs are discrete unit of work.For example, a db transaction can be to revise a user's the account's balance or the write operation of stock item.Online transaction processing system is the variation of the status of the data that link to each other with affairs of acquisition process and shared data bank and other file in real time.In Transaction Processing, affairs are carried out immediately.It is simple carrying out affairs under sole user, single database environment, and this is because do not have collision problem or to demand synchronous between database.Under a distributed environment, write operation often takes place on a plurality of database servers concurrently.Such concurrent transaction is handled needs " rollback " mechanism, under the situation that guarantees thrashing in write operation, still guarantees the integrality of database.Affairs or affirmation together, or abandon.If one or more system responses relevant with affairs are inconsistent, this means that fault may appear in system or communication, thereby will abandon affairs.As can be seen, when a plurality of users attempt to change simultaneously same of data, collision problem has just appearred.
Summary of the invention
In order to address the above problem, the present invention proposes the implementation method of affairs submission mechanism in a kind of graphic data base online transaction, to realize the submission mechanism of affairs.
The technical solution used in the present invention is as follows:
Affairs are submitted the implementation method of mechanism in a kind of graphic data base online transaction, it is characterized in that:
Transaction Processing is divided into three layers from top to bottom:
The superiors are the API that is exposed to the external call program;
The middle layer is an affairs logic control layer, be divided into synchronization zone and asynchronous district by class of operation, the synchronization zone means can only have an operation to carry out at one time, other operate in to enter and all are in waiting status between the synchronization zone, this mechanism utilizes the thread synchronization lockout feature of Java language to realize, the operation in asynchronous district is then unrestricted, all can carry out at any time;
Orlop in DataSet, is preserved the status information of online transaction self for the DataSet operation level of abstraction of storage data, and the transaction status attribute information of data;
The status data of online transaction in the graphic data base is stored in name is called among the data set DataSet of graphic_db_tx_def, the data structure of this DataSet is as follows:
Each Node all has a data set DataSet in graphic data base, default built-in following two row among this DataSet:
With Relation relation between Node and the Node is described, each Relation all has title, source Node, a target Node that the overall situation is unique, by the direction of source Node to target Node, be referred to as forward, be referred to as oppositely to the direction of initial Node by target Node, the definition information of each Relation is kept at name is called among the DataSet of graphic_db_relation_def, the data structure of this DataSet is as follows:
| The row title | Data type | Explanation |
| relation_id | Number | The ID that the overall situation is unique |
| name | String | Be used to preserve the title of Relation |
| source_node | Number | The ID of source Node |
| target_node | Number | The ID of target Node |
Data among two Node that connect by Relation can connect, and the link information of all data is kept at name is called among the DataSet of graphic_db_relation_record_def, and the data structure of this DataSet is as follows:
Carry out following steps:
1) API of client program calls graph data carries out the submit operation of affairs, when calling API, imports the affairs numbering tx_no that will submit to into;
2) check whether affairs exist, do not withdraw from if do not exist then, otherwise the step below continuing;
3) check whether affairs are out of date, then withdraw from as if expired, otherwise the step below continuing;
4) check whether affairs are submitted to, then withdraw from if submit to, otherwise the step below continuing;
5) check whether rollback of affairs, then withdraw from as if rollback, otherwise the step below continuing;
6) check whether affairs are locked, then withdraw from as if locked, otherwise the step below continuing;
7) mark affairs submit state;
8) data recording of deletion affairs locking;
9) change dirty data state;
10) delete transaction journal, so far finish the submit operation of affairs.
Further:
In described step 2) in, check that the method whether affairs exist is: the DataSet that reads graphic_db_tx_def by name, the record that the tx_no value of importing among the value of searching tx_no row and the API equates if write down existence, then means this online transaction of existence in the current graphic data base.
In described step 3), check whether method out of date is affairs: the DataSet that reads graphic_db_tx_def by name, the record that the tx_no value of importing among the value of searching tx_no row and the API equates, check the value of is_timeout row in this record, if value means then that for-1 this online transaction does not have expired in current graphic data base.
In described step 4), check that the method whether affairs have been submitted to is: the DataSet that reads graphic_db_tx_def by name, the record that the tx_no value of importing among the value of searching tx_no row and the API equates, check the value of is_commit row in this record, if value means then that for-1 this online transaction is not submitted in current graphic data base.
In described step 5), check affairs whether the method for mark rollback be: the record that the tx_no value of importing among the value of searching the tx_no row and the API equates, check the value of is_rollback row in this record, if value means then that for-1 this online transaction does not have rollback in current graphic data base.
In described step 6), check whether blocked method is affairs: the DataSet that reads graphic_db_tx_def by name, the record that the tx_no value of importing among the value of searching tx_no row and the API equates, check the value of processing row in this record, if value means then that for-1 these affairs are not labeled locking in current graphic data base.
In described step 7), the method for mark affairs submit state is: the record that the tx_no value of importing among the inquiry graphic_db_tx_def, the value of searching tx_no row and API equates, write down value that is_commit is listed as with this and be changed to 1.
In described step 8), the method of the data recording of deletion affairs locking is: inquiry graphic_db_tx_def, the record that the tx_no value of importing among the value of searching tx_no row and the API equates, read the record in the associate_node row of this record, obtain the nodename that is associated in the current transaction operation, search successively then in each associated nodes data _ value of tx_no row equates with current transaction journal tx_no column mean, and _ dirty train value is-1 data recording, with the physics deletion from DataSet of these records; Inquiry graphic_db_relation_record_def, the tx_no value of searching in the data _ importing among the value of tx_no row and the API equates, and _ the dirty train value is-1 record, these write down from DataSet physics deletes.
In described step 9), the method of change dirty data state is: inquiry graphic_db_tx_def, the record that the tx_no value of importing among the value of searching tx_no row and the API equates, read the record in the associate_node row of this record, obtain the nodename that is associated in the current transaction operation, the tx_no value of searching successively then in each associated nodes data _ importing among the value of tx_no row and the API equates, and _ dirty train value is 1 data recording, with these records _ value of tx_no row is made as null, the value that is listed as of general _ dirty is made as-1 simultaneously; Inquiry graphic_db_relation_record_def, the tx_no value of searching in the data _ importing among the value of tx_no row and the API equates, and _ dirty train value is-1 record, with these records _ value of tx_no row is made as null, the value with the dirty row is made as-1 simultaneously.
In described step 10), the method for deletion transaction journal is: Query Name is among the DataSet of graphic_db_tx_def, and the record that the tx_no value of importing among the value of searching tx_no row and the API equates is with this record deletion.
The present invention has the following advantages:
1. the invention provides a kind of simple, data transactions is submitted mechanism to reliably, characteristic that submit operation has indivisible " atomic operation " is being submitted to and not between the submit state, the third state can not occurred.
2. data manipulation of the present invention has any breakpoint continuation, after the affairs submit operation calls, begins to carry out interruption to the accident of the random time point of finishing in Data Update, all can finish until renewal continuing to carry out after the start-up system once more.
Description of drawings
Fig. 1 is the framework of graphic data base;
Fig. 2 is the graph of a relation between the node;
Fig. 3 is the storage modes of data in DataSet;
Fig. 4 is the figure that quotes between the node;
Fig. 5 is the Transaction Processing flow process;
The structure of Fig. 6 Transaction Processing;
Fig. 7 submits the treatment scheme of machine-processed implementation method to for affairs.
Embodiment
The present invention proposes the implementation method of affairs submission mechanism in a kind of graphic data base online transaction, describe in detail below in conjunction with accompanying drawing.
The graphic data base general introduction
The framework of graphic data base of the present invention can be divided into three layers from top to bottom.As shown in Figure 1, the superiors are the tissue and the realization of various conceptual objects in the graph data.The middle layer is abstract data physical store interface layer, is several data sets DataSet with the data abstraction of physical store.Bottom is that physical store realizes layer, realizes by existing storage engines by program, such as: traditional relational database, XML file or the like.
DataSet (data set)
DataSet is the logic storage unit of data in the graphic data base, the logical definition of data in the graphic data base and database self all is stored among the DataSet, DataSet is an abstract interface, and the realization procedure stores that real data can be by following the DataSet interface is in the file of relational database, XML or user-defined format.Each DataSet is made up of unique title and several row (Column) of the overall situation.Following two kinds of data types are supported in tabulation among the DataSet:
| Type | Explanation |
| String | Be used to preserve the descriptor of Textuality |
| Number | Be used to preserve integer, floating number digital information, or be used for preserving Boolean information, represent true with 1, represent false. with-1 |
Table 1
Node (node)
Node is the logical block of storage data in the graphic data base, in graphic data base, each record entity can abstractly be Node all, such as when explaining an applications of computer network system, port in the switch, the network interface card of PC server, CPU, produce the manufacturer of accessory, we provide the client of service for it, user in the system, authority or the like, each Node has a title that the overall situation is unique, its distinctive attributes with some, be used for recording configuration information, for example: with respect to the client of our service, we are with its called after Customer, and it has following attribute: contractedAmount (contract total value), industry (affiliated industry), name (customer name), description (description) etc.In the present invention, the attribute of Node can be the data of following type.
Table 2
The definition information of each Node all is kept at name and is called among the DataSet of graphic_db_node_def, and the data structure of this DataSet is as follows:
| The row title | Data type | Explanation |
| ?node_id | Number | The ID that the overall situation is unique |
| ?name | String | Be used to preserve the title of Node |
Table 3
Among each Node defined attribute information be kept at the name be called among the DataSet of graphic_db_node_attr_def, the data structure of this DataSet is as follows:
Table 4
Be directed to the definition of Node, similar following two tables of the DataSet of physical store:
Table 5
Table 6
The data message of each Node is kept among the DataSet of the same name with it, supposes that we have a name to be called the Node of Customer, and this Node has following attribute:
| Property Name | Data type | Explanation |
| RID | String | Database is built-in |
| name | String | Customer name |
| contractedAmount | Number | Contract value |
| industry | Reference | Affiliated industry |
| description | String | Client's descriptor |
Table 7
Then the DataSet structure of this Node correspondence is:
Table 8
The similar following table of the DataSet of physical store:
Table 9
RID (Record ID, Record ID)
In graphic data base, each Node can have a name to be called the attribute of RID, and the RID value that is stored in each the bar data among the Node all is that the overall situation is unique, is recorded in sign in the graphic data base as this.The data type of RID is the String type.Each Node all contains this attribute.The RID form is: Node title+underscore+increase progressively numeral, a typical R ID numerical value is similar to following form: Industry_109.
Relation (relation)
The entity of each category information all can be abstract is Node, in real world applications, usually needs these Node by certain logical organization, and Relation is used for describing the membership credentials between Node and the Node.Suppose the now existing Node:Customer that represent client, representative system user's Node:SysUser, in real world, our sales force can become a user in the system, and be responsible for some clients sale, reach communication work.Therefore, we Relation that can set up a SysUserServeCustomer by name between SysUser and Customer explains relation between the two.We explain this relation with Fig. 2, and Relation is used to describe the special object that concerns between Node and the Node.Each Relation all has a title that the overall situation is unique, a source Node, a target Node.By the direction of source Node to target Node, we are referred to as forward, and we are referred to as oppositely to the direction of initial Node by target Node.
The definition information of each Relation all is kept at name and is called among the DataSet of graphic_db_relation_def, and the data structure of this DataSet is as follows:
| The row title | Data type | Explanation |
| ?relation_id | Number | The ID that the overall situation is unique |
| ?name | String | Be used to preserve the title of Relation |
| ?source_node | Number | The ID of source Node |
| ?target_node | Number | The ID of target Node |
Table 10
Be directed to the definition of Relation, the similar following table of the DataSet of physical store:
Table 11
According to the definition of Relation, the data among two Node that connect by Relation can connect.The link information of all data is kept at name and is called among the DataSet of graphic_db_relation_record_def, and the data structure of this DataSet is as follows:
Table 12
In application scenarios, the similar following table of the DataSet of its physical store:
Table 13
Reference (quoting)
In graphic data base was abstract, some Node commonly used can have relation with other most of Node, and these Node data volumes commonly used are very limited and can not change substantially, such as: country, province, city etc.If adopt the mode of Relation to explain, then need and other Node between the big magnitude relation set up, this maintenance to the later stage will cause certain difficulty.Under this kind situation, can consider to adopt the form of Reference to explain relation.A Node quotes another one Node by the attribute that it had, and realizes in form at it, and is largely similar with the Foreign Key (external key) of RDBMS (relational database).That preserve in the Dictionary attribute of a certain record is the RID of data recording among the another one Node.Node---the Customer that we discussed before considering has this attribute of (industry) industry, supposes that in our application scenarios, the quantity of industry is very limited, and can often not change.Then can quote certain bar record among this Node of Industry with the mode of Reference attribute.The storage mode of data in DataSet as shown in Figure 3.
We dot the Reference between the Node in the present invention, to be different from Relation, see Fig. 4.
Online transaction and non-online transaction
The operation of data can be divided in the graphic data base: " online transaction data manipulation " and " non-online transaction data manipulation ".Online transaction data manipulation steps in sequence is: create online transaction, carry out online transaction data manipulation (this operation can repeat repeatedly in an online transaction), submit to online transaction that operation is come into force or rollback online transaction abort operation.See shown in Figure 5.But not the online transaction data manipulation is not controlled by affairs, directly calls graphic data base API and gets final product, and sees shown in Figure 6.
As shown in Figure 7, Transaction Processing of the present invention is divided into three layers from top to bottom:
The superiors are the API that is exposed to the external call program.
The middle layer is an affairs logic control layer, be divided into synchronization zone and asynchronous district by class of operation, the synchronization zone means can only have an operation to carry out at one time, and other operate in to enter and all are in waiting status between the synchronization zone, and this mechanism utilizes the thread synchronization lockout feature of Java language to realize.The operation in asynchronous district is then unrestricted, all can carry out at any time.
Orlop in DataSet, is preserved the status information of online transaction self for the DataSet operation level of abstraction of storage data, and the transaction status attribute information of data.
In graphic data base, the status data of online transaction is stored in name and is called among the DataSet of graphic_db_tx_def, and the data structure of this DataSet is as follows:
Table 14
Each Node all has a corresponding DataSet of the same name in graphic data base, and the Relation information between the data is kept at name and is called among the DataSet of graphic_db_relation_record_def.All default built-in following two row among these DataSet:
Table 15
Affairs are submitted the design and the realization of mechanism to
Affairs are submitted machine-processed flow process to as shown in Figure 7:
(1) API of client program calls graph data carries out the submit operation of affairs, when calling API, imports following parameter into:
Tx_no: the affairs numbering that will submit to.
In following step, to set forth for convenient, the tx_no parameter value that our supposition is imported into is 123abc
(2) check whether affairs exist.Read the DataSet of graphic_db_tx_def by name, the value of searching the tx_no row is the record of 123abc, if record exists, then mean and have numbering 123abc online transaction in the current graphic data base, continue to carry out ensuing logic, otherwise, directly withdraw from.
(3) check whether affairs are out of date.Read the DataSet of graphic_db_tx_def by name, the value of searching the tx_no row is the record of 123abc, the value of is_timeout row in the inspection record, if value is for-1, mean that then numbering 123abc online transaction does not have expired in current graphic data base, continue to carry out ensuing logic, otherwise, directly withdraw from.
(4) check whether affairs are submitted to.Read the DataSet of graphic_db_tx_def by name, the value of searching the tx_no row is the record of 123abc, the value of is_commit row in the inspection record, if value is for-1, mean that then numbering 123abc online transaction is not still submitted in current graphic data base, continue to carry out ensuing logic, otherwise, directly withdraw from.
(5) check whether rollback of affairs.Read the DataSet of graphic_db_tx_def by name, the value of searching the tx_no row is the record of 123abc, the value of is_rollback row in the inspection record, if value is for-1, mean that then numbering 123abc online transaction does not have rollback in current graphic data base, continue to carry out ensuing logic, otherwise, directly withdraw from.
(6) check whether affairs are locked.Read the DataSet of graphic_db_tx_def by name, the value of searching the tx_no row is the record of 123abc, the value of processing row in the inspection record, if value is for-1, mean that then numbering 123abc online transaction is not carried out data processing in current graphic data base, can continue to carry out ensuing logic, otherwise, directly withdraw from.
(7) mark affairs submit state.Inquiry graphic_db_tx_def, the value of searching the tx_no row is the record of 123abc, the value that this record is_commit is listed as is changed to 1, and is as follows:
| tx_no | is_commit | is_rollback | is_timeout | Start_time | ?associate_node | processing |
| 123abc | 1 | -1 | -1 | 1291739802000 | ?Customer，Contrac | -1 |
Table 16
(8) data recording of deletion affairs locking.
A. inquire about graphic_db_tx_def, the value of searching the tx_no row is the record of 123abc.Read the record in the associate_node row of this record, obtain the nodename that is associated in the current transaction operation, search successively then in each associated nodes data _ value of tx_no row is 123abc, and _ the dirty train value is-1 data recording.With the physics deletion from DataSet of these records.
B. inquire about graphic_db_relation_record_def, search in the data _ value of tx_no row is 123abc, and _ the dirty train value is-1 record.These records are deleted from DataSet.
(9) change dirty data state.
A. inquire about graphic_db_tx_def, the value of searching the tx_no row is the record of 123abc.Read the record in the associate_node row of this record, obtain the nodename that is associated in the current transaction operation, search successively then in each associated nodes data _ value of tx_no row is 123abc, and _ the dirty train value is 1 data recording.With these records _ value of tx_no row is made as null, and simultaneously the value of dirty row is made as-1.
B. inquire about graphic_db_relation_record_def, search in the data _ value of tx_no row is 123abc, and _ the dirty train value is-1 record.With these records _ value of tx_no row is made as null, and the value that is listed as of general _ dirty is made as-1 simultaneously.
(10) deletion transaction journal.Query Name is among the DataSet of graphic_db_tx_def, and the value of searching the tx_no row is the record of 123abc, with this record deletion.Finish the submit operation of affairs.
Claims (10)
1. affairs are submitted the implementation method of mechanism in the graphic data base online transaction, it is characterized in that:
Transaction Processing is divided into three layers from top to bottom:
The superiors are the API that is exposed to the external call program;
The middle layer is an affairs logic control layer, be divided into synchronization zone and asynchronous district by class of operation, the synchronization zone means can only have an operation to carry out at one time, other operate in to enter and all are in waiting status between the synchronization zone, this mechanism utilizes the thread synchronization lockout feature of Java language to realize, the operation in asynchronous district is then unrestricted, all can carry out at any time;
Orlop in DataSet, is preserved the status information of online transaction self for the DataSet operation level of abstraction of storage data, and the transaction status attribute information of data;
The status data of online transaction in the graphic data base is stored in name is called among the data set DataSet of graphic_db_tx_def, the data structure of this DataSet is as follows:
Each Node all has a data set DataSet in graphic data base, default built-in following two row among this DataSet:
With Relation relation between Node and the Node is described, each Relation all has title, source Node, a target Node that the overall situation is unique, by the direction of source Node to target Node, be referred to as forward, be referred to as oppositely to the direction of initial Node by target Node, the definition information of each Relation is kept at name is called among the DataSet of graphic_db_relation_def, the data structure of this DataSet is as follows:
Data among two Node that connect by Relation can connect, and the link information of all data is kept at name is called among the DataSet of graphic_db_relation_record_def, and the data structure of this DataSet is as follows:
Carry out following steps:
1) API of client program calls graph data carries out the submit operation of affairs, when calling API, imports the affairs numbering tx_no that will submit to into;
2) check whether affairs exist, do not withdraw from if do not exist then, otherwise the step below continuing;
3) check whether affairs are out of date, then withdraw from as if expired, otherwise the step below continuing;
4) check whether affairs are submitted to, then withdraw from if submit to, otherwise the step below continuing;
5) check whether rollback of affairs, then withdraw from as if rollback, otherwise the step below continuing;
6) check whether affairs are locked, then withdraw from as if locked, otherwise the step below continuing;
7) mark affairs submit state;
8) data recording of deletion affairs locking;
9) change dirty data state;
10) delete transaction journal, so far finish the submit operation of affairs.
2. affairs are submitted the implementation method of mechanism in the graphic data base online transaction as claimed in claim 1, it is characterized in that:
In described step 2) in, check that the method whether affairs exist is: the DataSet that reads graphic_db_tx_def by name, the record that the tx_no value of importing among the value of searching tx_no row and the API equates if write down existence, then means this online transaction of existence in the current graphic data base.
3. affairs are submitted the implementation method of mechanism in the graphic data base online transaction as claimed in claim 1, it is characterized in that:
In described step 3), check whether method out of date is affairs: the DataSet that reads graphic_db_tx_def by name, the record that the tx_no value of importing among the value of searching tx_no row and the API equates, check the value of is_timeout row in this record, if value means then that for-1 this online transaction does not have expired in current graphic data base.
4. affairs are submitted the implementation method of mechanism in the graphic data base online transaction as claimed in claim 1, it is characterized in that:
In described step 4), check that the method whether affairs have been submitted to is: the DataSet that reads graphic_db_tx_def by name, the record that the tx_no value of importing among the value of searching tx_no row and the API equates, check the value of is_commit row in this record, if value means then that for-1 this online transaction is not submitted in current graphic data base.
5. affairs are submitted the implementation method of mechanism in the graphic data base online transaction as claimed in claim 1, it is characterized in that:
In described step 5), check affairs whether the method for mark rollback be: the record that the tx_no value of importing among the value of searching the tx_no row and the API equates, check the value of is_rollback row in this record, if value means then that for-1 this online transaction does not have rollback in current graphic data base.
6. affairs are submitted the implementation method of mechanism in the graphic data base online transaction as claimed in claim 1, it is characterized in that:
In described step 6), check whether blocked method is affairs: the DataSet that reads graphic_db_tx_def by name, the record that the tx_no value of importing among the value of searching tx_no row and the API equates, check the value of processing row in this record, if value means then that for-1 these affairs are not labeled locking in current graphic data base.
7. affairs are submitted the implementation method of mechanism in the graphic data base online transaction as claimed in claim 1, it is characterized in that:
In described step 7), the method for mark affairs submit state is: the record that the tx_no value of importing among the inquiry graphic_db_tx_def, the value of searching tx_no row and API equates, write down value that is_commit is listed as with this and be changed to 1.
8. affairs are submitted the implementation method of mechanism in the graphic data base online transaction as claimed in claim 1, it is characterized in that:
In described step 8), the method for the data recording of deletion affairs locking is:
Inquiry graphic_db_tx_def, the record that the tx_no value of importing among the value of searching tx_no row and the API equates, read the record in the associate_node row of this record, obtain the nodename that is associated in the current transaction operation, search successively then in each associated nodes data _ value of tx_no row equates with current transaction journal tx_no column mean, and _ dirty train value is-1 data recording, with the physics deletion from DataSet of these records;
Inquiry graphic_db_relation_record_def, the tx_no value of searching in the data _ importing among the value of tx_no row and the API equates, and _ the dirty train value is-1 record, these write down from DataSet physics deletes.
9. affairs are submitted the implementation method of mechanism in the graphic data base online transaction as claimed in claim 1, it is characterized in that:
In described step 9), the method for change dirty data state is:
Inquiry graphic_db_tx_def, the record that the tx_no value of importing among the value of searching tx_no row and the API equates, read the record in the associate_node row of this record, obtain the nodename that is associated in the current transaction operation, the tx_no value of searching successively then in each associated nodes data _ importing among the value of tx_no row and the API equates, and _ dirty train value is 1 data recording, with these records _ value of tx_no row is made as null, the value with the dirty row is made as-1 simultaneously;
Inquiry graphic_db_relation_record_def, the tx_no value of searching in the data _ importing among the value of tx_no row and the API equates, and _ dirty train value is-1 record, with these records _ value of tx_no row is made as null, the value that is listed as of general _ dirty is made as-1 simultaneously.
10. affairs are submitted the implementation method of mechanism in the graphic data base online transaction as claimed in claim 1, it is characterized in that:
In described step 10), the method for deletion transaction journal is: Query Name is among the DataSet of graphic_db_tx_def, and the record that the tx_no value of importing among the value of searching tx_no row and the API equates is with this record deletion.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110072872 CN102193975B (en) | 2011-03-25 | 2011-03-25 | Method for realizing transaction committing mechanism in online transaction of graphic database |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110072872 CN102193975B (en) | 2011-03-25 | 2011-03-25 | Method for realizing transaction committing mechanism in online transaction of graphic database |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102193975A true CN102193975A (en) | 2011-09-21 |
| CN102193975B CN102193975B (en) | 2013-01-02 |
Family
ID=44602045
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110072872 Active CN102193975B (en) | 2011-03-25 | 2011-03-25 | Method for realizing transaction committing mechanism in online transaction of graphic database |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102193975B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103455923A (en) * | 2012-05-30 | 2013-12-18 | 冲电气工业株式会社 | Accounting input system and accounting input method |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9465832B1 (en) | 2016-02-04 | 2016-10-11 | International Business Machines Corporation | Efficiently committing large transactions in a graph database |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6178425B1 (en) * | 1997-02-26 | 2001-01-23 | Siebel Systems, Inc. | Method of determining the visibility to a remote database client of a plurality of database transactions using simplified visibility rules |
| CN1790397A (en) * | 2005-12-28 | 2006-06-21 | 浙江工业大学 | Third party logistics data processing method based on online analysis |
| CN101122852A (en) * | 2006-08-08 | 2008-02-13 | 华为技术有限公司 | On-line business processing system middleware package method |
| CN101566986A (en) * | 2008-04-21 | 2009-10-28 | 阿里巴巴集团控股有限公司 | Method and device for processing data in online business processing |
-
2011
- 2011-03-25 CN CN 201110072872 patent/CN102193975B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6178425B1 (en) * | 1997-02-26 | 2001-01-23 | Siebel Systems, Inc. | Method of determining the visibility to a remote database client of a plurality of database transactions using simplified visibility rules |
| CN1790397A (en) * | 2005-12-28 | 2006-06-21 | 浙江工业大学 | Third party logistics data processing method based on online analysis |
| CN101122852A (en) * | 2006-08-08 | 2008-02-13 | 华为技术有限公司 | On-line business processing system middleware package method |
| CN101566986A (en) * | 2008-04-21 | 2009-10-28 | 阿里巴巴集团控股有限公司 | Method and device for processing data in online business processing |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103455923A (en) * | 2012-05-30 | 2013-12-18 | 冲电气工业株式会社 | Accounting input system and accounting input method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102193975B (en) | 2013-01-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8296317B2 (en) | Searchable object network | |
| US8375010B2 (en) | Method of integrating applications with a network service application by creating new records in a relationship field | |
| US20050108276A1 (en) | Methods and system for dynamic database content persistence and information management | |
| CN111522631B (en) | Distributed transaction processing method, device, server and medium | |
| US9852174B2 (en) | Reducing update conflicts when maintaining views | |
| Dipina Damodaran et al. | Performance evaluation of MySQL and MongoDB databases | |
| US9509769B2 (en) | Reflecting data modification requests in an offline environment | |
| CN105144162A (en) | Integration database framework | |
| CN102193986B (en) | Method of implementing online transaction in graphic database | |
| CN102193975B (en) | Method for realizing transaction committing mechanism in online transaction of graphic database | |
| CN102193979B (en) | Control method for inquiring data from offline transaction of graphic database | |
| US20110087709A1 (en) | Methods and system for dynamic database content persistence and information management | |
| KR20220100971A (en) | Method and system for converting database applications into blockchain applications | |
| CN102193981B (en) | Method for realizing transaction expiration mechanism in online transaction of graphic database | |
| CN101799822A (en) | Method for modeling layered network knowledge model and method for establishing knowledge warehouse system | |
| WO2015043166A1 (en) | Method and system for automatic management of dynamically allocated memory in a computing unit | |
| CN102193989B (en) | Graphic database-based online transaction processing system and data insertion method | |
| CN102193976B (en) | Method for implementing transaction rollback mechanism in online transaction of graphic database | |
| CN102193982B (en) | Method for controlling search data in graphic database online transaction | |
| CN102193977B (en) | Method for increasing node data relation in off-line transactions of graphic database | |
| CN102193978B (en) | Control method of deleting data in offline transaction of pattern database | |
| CN102193980B (en) | Control method for inserting data into offline transaction of graphic database | |
| CN102193985B (en) | Method for canceling node data relation in graphical database offline transaction | |
| CN102193984B (en) | Control method for modifying data in non-online transaction of graphic database | |
| CN114168685B (en) | Novel database architecture based on blockchain system and operation method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Free format text: FORMER OWNER: BEIJING CLOUDEX SOFTWARE SERVICES CO., LTD. Effective date: 20121022 Owner name: BEIJING CENTURY BROADBAND INTERNET DATA CENTER CO. Free format text: FORMER OWNER: BEIJING BANYANO DATA CENTER SOLUTIONS LTD. Effective date: 20121022 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20121022 Address after: 100015 No. 3, building 5, building 1, Jiuxianqiao East Road, Chaoyang District, Beijing Applicant after: Beijing Century Broadband Internet Data Center Co., Ltd. Address before: 100015 No. 3, building 5, building 1, Jiuxianqiao East Road, Chaoyang District, Beijing Applicant before: Beijing BANYANO Data Center Solutions Ltd. Applicant before: Beijing CloudEx Software Service Co., Ltd. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |