CN106815289A - Date storage method and device in a kind of transaction processing system - Google Patents

Abstract

The invention discloses a data storage method and device in a transaction processing system, which are used to solve the problems in the prior art that the transaction data volume is large, the data consistency is difficult to guarantee, and the data repeatability is high, including: obtaining data sets, The data set carries version information; for each transaction element in the data set, determine whether the transaction element exists in the data storage space; if the transaction element exists, compare whether the first data value is the same as the second data value; if they are the same, then The version information of the data set is added to the storage information corresponding to the second data value. With this technical solution, it is not necessary to repeatedly record the repeated data values of transaction elements, thereby reducing the repetition of stored transaction data and reducing the amount of stored transaction data. Furthermore, due to the reduction in the amount of stored transaction data, multi-system Data consistency among them is easier to guarantee.

Description

Data storage method and device in a transaction processing system

technical field

The invention relates to the field of computer technology, in particular to a data storage method and device in a transaction processing system.

Background technique

The online processing system is a very common system architecture in daily life, such as a typical financial online transaction system, taking the payment transaction as an example, which requires three parties: the transaction initiator, the bank (debit service) and the service provider (debit service) To participate, transaction data needs to be passed among the three parties. The transaction system needs to record and process the transaction data of the three parties, which is used to roll back (reverse) the transaction according to the intermediate step information when the transaction is abnormal.

Taking the three-party transaction as an example, currently the method shown in Figure 1 is mostly used for the management of data in the online system. FIG. 1 is a schematic diagram of a data storage method in the prior art provided by an embodiment of the present invention. As shown in FIG. 1 , a successful transaction requires the participation of the transaction initiator, the service provider and the bank. Numbers 1-6 in the figure are transaction steps, corresponding to each transaction step, there are six data sets including data set 1, data set 2, data set 3, data set 4, data set 5 and data set 6. When the transaction processing system receives the transaction request from the transaction initiator, it records the transaction data at this time as data set 1; then the transaction processing system processes the transaction data, records the processed transaction data as data set 2, and Send the processed transaction data to the bank, corresponding to step 2; after the bank receives the transaction data, process the transaction data and send it to the transaction processing system, that is, step 3; after the transaction processing system receives the transaction data, save it as data After set 3, process the transaction data, record the processed transaction data as data set 4, and send the transaction data at this time to the service provider, corresponding to step 4; after the service provider receives the transaction data, it The data is processed and sent to the transaction processing system, which corresponds to step 5; after the transaction processing system receives the transaction data, it records the transaction data as data set 5, processes the transaction data, and records the processed transaction data as data set 6, And send the processed transaction data to the transaction initiator, corresponding to step 6.

It can be seen from Figure 1 that in the existing multi-party transaction system, a data set needs to be recorded in the database for the data of each step in a transaction. For example, in a three-party transaction, two data sets need to be recorded for each party, so Three-party transactions need to record a total of six data sets. This data management method has the following deficiencies:

1. Large amount of transaction data

Since the data of each step in a transaction needs to be recorded separately, especially for multi-party transaction records, the generated data volume is relatively large. For a busy trading system, the number of transactions per day is as high as several million or higher, which puts a lot of pressure on the system database and storage.

2. Data consistency is difficult to guarantee

Since the information of a transaction records multiple transactions in the database, in order to ensure the integrity of a transaction, it is necessary to ensure that each related record must be complete. Now the system is multi-system backup, data synchronization is required between systems, and the unit of data synchronization is a piece of data. If a piece of data related to a transaction is lost during data synchronization, the integrity of the data will be destroyed.

3. High data repeatability

Some transaction data in a transaction data is repeated, and these repeated transaction data waste storage resources, and waste more memory to store these data during program operation.

To sum up, the existing data management methods in the online processing system have the problems of large amount of transaction data, difficulty in ensuring data consistency, and high data repeatability.

Contents of the invention

The present invention provides a data storage method and device in a transaction processing system, which are used to solve the problems in the prior art that there is a large amount of transaction data, difficult to ensure data consistency, and high data repeatability.

An embodiment of the present invention provides a data storage method in a transaction processing system, including:

Obtain the data set, the data set carries version information, and the version information corresponds to the transaction processing steps;

For each transaction element in the data set, perform the following steps:

Determine whether there is a transaction element in the data storage space;

If there is a transaction element, compare whether the first data value is the same as the second data value; the first data value is the data value corresponding to the transaction element in the data set, and the second data value is the data value corresponding to the transaction element in the data storage space;

If they are the same, the version information of the data set is added to the storage information corresponding to the second data value.

Optionally, also include:

If there is no transaction element in the data storage space, add a transaction element in the data storage space, and store the first data value and the transaction version information of the data set in the storage location corresponding to the transaction element, and the transaction version information of the data set belongs to the first Storage information for a data value.

Optionally, also include:

If the first data value is different from the second data value, the first data value and the transaction version information of the data set are stored in the storage location corresponding to the transaction element, and the transaction version information of the data set belongs to the storage information of the first data value.

Optionally, before judging whether there is a transaction element in the data storage space, it also includes:

Calculate the hash bucket (Hash bucket) value of the transaction element;

Determine whether there are transaction elements in the data storage space, including:

Find transaction elements with the same hash bucket value in the data storage space according to the Hash bucket value;

Find whether there is a transaction element from the transaction elements with the same hash bucket value.

An embodiment of the present invention provides a data reading method, which is applicable to a transaction processing system adopting the above data storage method, including:

Receive a data query request, which includes version information and transaction elements;

From the data storage space of the transaction processing system, query the data value of the version information corresponding to the transaction element;

Returns the data value of the version information corresponding to the transaction element.

An embodiment of the present invention provides a data storage device in a transaction processing system, including:

The collection module is used to obtain the data set, the data set carries version information, and the version information corresponds to the transaction processing steps;

A judging module, for each transaction element in the data set, to judge whether there is a transaction element in the data storage space;

The comparison module is used to compare whether the first data value and the second data value are the same when there is a transaction element in the data storage space; the first data value is the data value corresponding to the transaction element in the data set, and the second data value is in the data storage space The data value corresponding to the transaction element;

The storage module is configured to add the version information of the data set to the storage information corresponding to the second data value when the first data value of the transaction element is the same as the second data value.

Optionally, the storage module is also used to add a transaction element in the data storage space when there is no transaction element in the data storage space, and store the first data value and the transaction version information of the data set in the storage corresponding to the transaction element Location, the transaction version information of the data set belongs to the storage information of the first data value.

Optionally, the storage module is also used to store the first data value and the transaction version information of the data set in the storage location corresponding to the transaction element when the first data value is different from the second data value, and the transaction version information of the data set Storage information pertaining to the first data value.

Optionally, the judging module is also used to calculate the hash bucket (Hash bucket) value of the transaction element;

The judgment module is specifically used for:

Find transaction elements with the same hash bucket value in the data storage space according to the Hash bucket value;

Find whether there is a transaction element from the transaction elements with the same hash bucket value.

An embodiment of the present invention provides a data reading device, which is suitable for a transaction processing system using the above-mentioned data storage device, including:

The receiving module is used to receive a data query request, and the data query request includes version information and transaction elements;

A query module, configured to query the data value of the version information corresponding to the transaction element from the data storage space of the transaction processing system;

The return module is used to return the data value of the version information corresponding to the transaction element.

To sum up, the embodiments of the present invention provide a data storage method and device in a transaction processing system, including: acquiring a data set, the data set carries version information, and the version information corresponds to the transaction processing steps; for each data set in the data set A transaction element, perform the following steps: determine whether there is a transaction element in the data storage space; if there is a transaction element, compare whether the first data value of the transaction element is the same as the second data value; the first data value corresponds to the transaction element in the data set , the second data value is the data value corresponding to the transaction element in the data storage space; if they are the same, the version information of the data set is added to the storage information corresponding to the second data value. A transaction process contains multiple versions of data sets. For the same transaction element in different versions, if the data value of this transaction element has not changed, there is no need to repeatedly record the data value of this transaction element, but only need to increase Only one version record is enough, which reduces the repetition of stored transaction data and the amount of stored transaction data. Further, due to the reduction of stored transaction data, it is easier to ensure data consistency between multiple systems .

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings that need to be used in the description of the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present invention. For Those of ordinary skill in the art can also obtain other drawings based on these drawings without any creative effort.

FIG. 1 is a schematic diagram of a data storage method in the prior art provided by an embodiment of the present invention;

FIG. 2 is a schematic flowchart of a data storage method in a transaction processing system provided by an embodiment of the present invention;

FIG. 3 is a schematic diagram of a data storage structure provided by an embodiment of the present invention;

Fig. 4 is a flow chart of data storage provided by an embodiment of the present invention;

FIG. 5 is a schematic flow chart of a data reading method provided by an embodiment of the present invention;

Fig. 6 is a schematic structural diagram of a data storage device in a transaction processing system provided by an embodiment of the present invention;

Fig. 7 is a schematic structural diagram of a data reading device provided by the present invention.

detailed description

In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, rather than all embodiments . Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

Fig. 2 is a schematic flowchart of a data storage method in a transaction processing system provided by an embodiment of the present invention, as shown in Fig. 2 , including the following steps:

S201: Obtain a data set, the data set carries version information, and the version information corresponds to the transaction processing steps;

S202: For each transaction element in the data set, determine whether there is a transaction element in the data storage space;

S203: If there is a transaction element, compare whether the first data value is the same as the second data value; the first data value is the data value corresponding to the transaction element in the data set, and the second data value is the data value corresponding to the transaction element in the data storage space ;

S204: If they are the same, add the version information of the data set to the storage information corresponding to the second data value.

In the specific implementation process, the method shown in the embodiment of the present invention is not only applicable to two-party and three-party transactions, but also applicable to multi-party transactions with more than three parties involved. The data storage space stores the transaction data temporarily. When a complete transaction is confirmed to be correct, the storage space can delete the data records about this transaction. The data storage space can store the transaction data of multiple transactions at the same time, and the transaction data of these transactions are independent of each other and do not interfere with each other.

In the specific implementation process of step S201, a data set corresponds to a transaction data processing result, such as data set 1, data set 2, data set 3, data set 4, data set 5 and data set 6 in Figure 1, each is a data set. The data set carries version information, and the version information corresponds to the transaction processing steps. Data set 1 in Figure 1 corresponds to the first data processing result, that is, the transaction initiator generated the transaction data in data set 1, and data set 1 The version number corresponding to the version information is 1, and the data set 2 corresponds to the second processing result, that is, the transaction processing system generates the transaction data in the data set 2 from the processing result of the transaction data in the data set 1, and the data The version number corresponding to the version information of set 2 is 2.

In the specific implementation process of step S202, a data set is composed of multiple transaction elements and their relationships, such as transaction time, transaction amount, transaction account, transaction times, etc. Optionally, transaction elements can be based on actual application conditions and determined by experience. Optionally, for each transaction element, organize according to the format of data name (Key), data length (Len) and data value (Value), where the data name has a unique fixed relationship with the transaction element, such as the transaction element is the transaction amount, and its data name is Money. At this time, Money can only represent the transaction element of the transaction amount, and cannot represent other transaction elements. The data length indicates the data storage size corresponding to the transaction element. The data length can not only be used to calculate the space occupied by the stored data to allocate storage space more efficiently, but also important information that needs to be called when calling the data. The data value represents the specific content of the transaction element, for example, the data value of the transaction amount is 1000, 10, 233, etc., and for example, the data value of the transaction location is Shanghai, Beijing, Shenzhen, etc.

Optionally, when obtaining a data set, for each transaction element, calculate the hash bucket (Hash bucket) value of the transaction element; search the transaction element with the same hash bucket value in the data storage space according to the Hash bucket value; from Check whether there is a transaction element in the transaction element with the same hash bucket value. In the specific implementation process, a Hashbucket value may correspond to multiple transaction elements. Optionally, for each transaction element, when the Hash bucket value corresponding to the transaction calculation is found in the data storage space, then according to the data name from Check whether a transaction element with the same data name is included in the transaction element corresponding to the Hash bucket value. By looking up the Hash bucket value first, the number of comparisons in the lookup process can be greatly reduced, thereby speeding up the lookup. Optionally, it is also possible not to use the Hashbucket value search, that is, the Hash bucket is not introduced in the data storage process. During the data search, it is judged whether the transaction element exists in the data storage space by comparing the data name of the transaction element, but this The search speed of this method is greatly reduced compared with the method of searching with the help of Hash bucket values.

Optionally, for each transaction element, if the transaction element does not exist in the data storage space, add the transaction element in the data storage space, and store the first data value and the transaction version information of the data set in the transaction element Corresponding to the storage location, the transaction version information of the data set belongs to the storage information of the first data value. The fact that the transaction element does not exist in the data storage space indicates that the transaction element is a newly added transaction element in the data processing process. For a newly added transaction element, storage for the newly added transaction element should be added in the data storage space, and its storage information should include the data name, data value and version information of the transaction element, and optionally, the transaction The data length of the element. Optionally, the stored procedure is: calculate the Hash bucket value of this transaction element, judge whether there is a Hash bucket value identical to the Hash bucket value of this transaction element among the existing Hash bucket values, and if so, after this Hash bucket Add a new node, the data name of this node is the data name of the transaction element. If the Hash bucket value of the transaction element does not exist in the existing Hash bucket value in the HASH bucket, add a new bucket value in the HASH bucket.

In the specific implementation process of step S203, for each transaction element, if the transaction element exists in the data storage space, it is also necessary to compare whether the first data value and the second data value of the transaction element are the same, where the first The data value is the data value corresponding to the transaction element in the data set, and the second data value is the data value corresponding to the transaction element in the data storage space. For example, for data set 1, data set 2 and data set 3 in Figure 1, for the transaction amount, if the data value of the transaction amount in data set 2 is the first data value, then the data value of the transaction amount in data set 1 is the first Two data values; if the data value of the transaction amount in data set 3 is the first data value, then the data value of the transaction amount in data set 1 and data set 2 is the second data value, that is, the transaction in all versions before the current version The data values corresponding to the elements are all second data values, and the number of possible second data values is not limited to 1.

In the specific implementation process of step S204, for each transaction element, if the first data value and the second data value of the transaction element are the same, the version information of the data set is added to the storage information corresponding to the second data value. For the case where there are multiple second data values, the first data value and the second data value are the same here, which means that the first data value is the same as any second data value. If the first data value is the same as the second data value, the version information of the data set is added to the storage information corresponding to the second data value, for example, the first data value value3 is the same as the second data value value2, and the first data value value3 The corresponding version information is version 3, and the version information corresponding to the second data value value2 is version 2, then the version information version 3 is added to the version information corresponding to the second data value value2.

Optionally, for each transaction element, if the first data value of the transaction element is different from the second data value, the first data value and the transaction version information of the data set are stored in the storage location corresponding to the transaction element, and the data set The transaction version information of belongs to the storage information of the first data value. The storage location corresponding to the transaction element refers to the storage area divided according to the data name of the transaction element. If the first data value of the transaction element is different from the second data value, the first data value is added to the storage area corresponding to the data name of the transaction element. Data values and their corresponding transaction version information.

Fig. 3 is a kind of data storage structure schematic diagram that the embodiment of the present invention provides, as shown in Fig. 3, storage structure has included HASH bucket, and HASH bucket adopts the mode storage data node (item) of record hash value, after each node [v1], [v2], and [v3] represent the version information recorded in the node, which are the first version corresponding to dataset 1, the second version corresponding to dataset 2, and the third version corresponding to dataset 3, respectively. The horizontal chain of the HASH linked list indicates nodes with different data names with the same Hash bucket value, and the vertical linked list indicates nodes with the same data name but different data values. In the data storage process, only the first data value and the second data value of the transaction element A new node will only appear when the data value is different or a new transaction element appears. In the specific storage process, when a transaction element cannot be found in the storage space, that is, there is no node for this transaction element in the HASH bucket shown in Figure 3, the Hash bucket value of the transaction element is calculated to determine the existing Hash Whether the bucket value has the same Hash bucket value as the Hash bucket value of the transaction element, if so, add a new node in the horizontal chain after the Hash bucket, and the data name of this node is the data name of the transaction element. If the Hash bucket value of the transaction element does not exist in the existing Hash bucket value in the HASH bucket, add a new bucket value linked list in the HASH bucket, as shown in Figure 3, add bucket[n+1]. Optionally, as shown in FIG. 3 , in addition to the HASH bucket, the storage structure may also include a version bitmap, a version list, the number of used nodes, the number of idle nodes, and the location of idle nodes. Among them, the version bitmap is a flag bit used for auxiliary operations, which can be used for version filtering. The version list is used to store the existing version numbers of the current data set. For the storage structure shown in Figure 3, the version list should contain three versions 1, 2, and 3. The number of used nodes records the number of used nodes. The number of idle nodes records the number of idle nodes. The free node location record is the linked list of unused free nodes. It should be pointed out that the storage mode of the node side is the main content of the embodiment of the present invention, and the hash bucket is an optimization of the node side. The version bitmap, version list, number of used nodes, number of idle nodes and idle node positions are all is optional content.

Fig. 4 is a flow chart of data storage provided by an embodiment of the present invention, as shown in Fig. 4, including the following steps:

S401: Obtain a data set;

S402: Extract a transaction element in the data set;

S403: Determine whether the transaction element exists in the data storage space; if yes, proceed to step S404, if not, proceed to step S408;

S404: Compare whether the first data value and the second data value of the transaction element are the same; if yes, proceed to step S405, if not, proceed to step S409;

S405: Add version information of the data set to storage information corresponding to the second data value;

S406: Determine whether all transaction elements have been stored; if yes, continue to step S407, if not, return to step S402;

S407: the storage is completed;

S408: store the transaction element;

S409: Store the first data value and the transaction version information of the data set in a storage location corresponding to the transaction element.

Fig. 5 is a schematic flow chart of a data reading method provided by an embodiment of the present invention, as shown in Fig. 5, including the following steps:

S501: Receive a data query request, where the data query request includes version information and transaction elements;

S502: Query the data value of the version information corresponding to the transaction element from the data storage space of the transaction processing system;

S503: Return the data value of the version information corresponding to the transaction element.

In the specific implementation process, the embodiment of the present invention is applicable to the data stored in the transaction system data storage method provided by the present invention. For example, when it is necessary to roll back to the second step of the transaction, the query needs to extract the second version of data corresponding to dataset 2 from the data storage space. The query request includes a request to query the second version of data. From the data storage space, the query version information is each data value and its data name of the second version. Optionally, the data length corresponding to the data value can also be extracted. Finally, when returning the data value of the version information corresponding to the transaction element, it will be returned in the format of the combination of data name, data length and data value. Optionally, for the transaction data stored according to the storage method shown in this embodiment, it is also possible to extract the data value when the specified transaction element corresponds to a different version, such as specifying to extract the transaction amount element, according to the data name of the transaction amount Money from the data The data value of each version corresponding to the Money data name is extracted from the storage space, and optionally returned in the format of the combination of the data name, data length and data value.

To sum up, the embodiment of the present invention provides a data storage method in a transaction processing system, including: obtaining a data set, the data set carries version information, and the version information corresponds to the transaction processing steps; for each transaction in the data set element, perform the following steps: determine whether there is a transaction element in the data storage space; if there is a transaction element, compare whether the first data value and the second data value of the transaction element are the same; the first data value is the data corresponding to the transaction element in the data set value, the second data value is the data value corresponding to the transaction element in the data storage space; if they are the same, the version information of the data set is added to the storage information corresponding to the second data value. A transaction process contains multiple versions of data sets. For the same transaction element in different versions, if the data value of this transaction element has not changed, there is no need to repeatedly record the data value of this transaction element, but only need to increase Only one version record is enough, which reduces the repetition of stored transaction data and the amount of stored transaction data. Further, due to the reduction of stored transaction data, it is easier to ensure data consistency between multiple systems .

Based on the same technical concept, an embodiment of the present invention also provides a data storage device in a transaction processing system, and the data storage device can execute the above method embodiment. Fig. 6 is a schematic structural diagram of a data storage device in a transaction processing system provided by an embodiment of the present invention. As shown in Fig. 6, the data storage device 600 includes: an acquisition module 601, a judgment module 602, a comparison module 603 and a storage module 604, in:

The collection module 601 is used to obtain a data set, the data set carries version information, and the version information corresponds to the transaction processing steps;

Judgment module 602, for each transaction element in the data set, to determine whether there is a transaction element in the data storage space;

The comparison module 603 is used to compare whether the first data value and the second data value are the same when there is a transaction element in the data storage space; the first data value is the data value corresponding to the transaction element in the data set, and the second data value is the data storage space The data value corresponding to the transaction element in ;

The storage module 604 is configured to add the version information of the data set to the storage information corresponding to the second data value when the first data value of the transaction element is the same as the second data value.

Optionally, the storage module 604 is also configured to add a transaction element in the data storage space when there is no transaction element in the data storage space, and store the first data value and the transaction version information of the data set in the transaction element corresponding to The storage location, the transaction version information of the data set belongs to the storage information of the first data value.

Optionally, the storage module 604 is further configured to store the first data value and the transaction version information of the data set in the storage location corresponding to the transaction element when the first data value is different from the second data value, and the transaction version information of the data set The information belongs to the stored information of the first data value.

Optionally, the judging module 602 is also used to calculate the hash bucket (Hash bucket) value of the transaction element;

Judgment module 602, specifically for:

Find transaction elements with the same hash bucket value in the data storage space according to the Hash bucket value;

Find whether there is a transaction element from the transaction elements with the same hash bucket value.

The embodiment of the present invention also provides a data reading device, which is suitable for a transaction processing system using the above-mentioned data storage device. Fig. 7 is a schematic structural diagram of a data reading device provided by the present invention. As shown in Fig. 7, the reading device 700 includes: a receiving module 701, a query module 702 and a returning module 703, wherein:

A receiving module 701, configured to receive a data query request, where the data query request includes version information and transaction elements;

A query module 702, configured to query the data value of the version information corresponding to the transaction element from the data storage space of the transaction processing system;

Returning module 703, configured to return the data value of the version information corresponding to the transaction element.

To sum up, the embodiments of the present invention provide a data storage method and device in a transaction processing system, including: acquiring a data set, the data set carries version information, and the version information corresponds to the transaction processing steps; for each data set in the data set A transaction element, perform the following steps: determine whether there is a transaction element in the data storage space; if there is a transaction element, compare whether the first data value of the transaction element is the same as the second data value; the first data value corresponds to the transaction element in the data set , the second data value is the data value corresponding to the transaction element in the data storage space; if they are the same, the version information of the data set is added to the storage information corresponding to the second data value. A transaction process contains multiple versions of data sets. For the same transaction element in different versions, if the data value of this transaction element has not changed, there is no need to repeatedly record the data value of this transaction element, but only need to increase Only one version record is enough, which reduces the repetition of stored transaction data and the amount of stored transaction data. Further, due to the reduction of stored transaction data, it is easier to ensure data consistency between multiple systems .

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It should be understood that each procedure and/or block in the flowchart and/or block diagram, and a combination of procedures and/or blocks in the flowchart and/or block diagram can be realized by computer program instructions. These computer program instructions may be provided to a general purpose computer, special purpose computer, embedded processor, or processor of other programmable data processing equipment to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing equipment produce a An apparatus for realizing the functions specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.

These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to operate in a specific manner, such that the instructions stored in the computer-readable memory produce an article of manufacture comprising instruction means, the instructions The device realizes the function specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.

These computer program instructions can also be loaded onto a computer or other programmable data processing device, causing a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby The instructions provide steps for implementing the functions specified in the flow chart or blocks of the flowchart and/or the block or blocks of the block diagrams.

While preferred embodiments of the invention have been described, additional changes and modifications to these embodiments can be made by those skilled in the art once the basic inventive concept is appreciated. Therefore, it is intended that the appended claims be construed to cover the preferred embodiment as well as all changes and modifications which fall within the scope of the invention.

Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalent technologies, the present invention also intends to include these modifications and variations.

Claims (10)

1. the date storage method in a kind of transaction processing system, it is characterised in that including：

Data set is obtained, version information is carried in the data set, the version information is corresponding with transaction processing procedure；

For each traded elements in the data set, following steps are performed：

Judge to whether there is the traded elements in data space；

If there are the traded elements, compare the first data value whether identical with the second data value；First data value is The corresponding data value of traded elements described in the data set, second data value is to be handed over described in the data space The corresponding data value of easy element；

If identical, the version information of the data set is increased in the corresponding storage information of second data value.

2. the method for claim 1, it is characterised in that also include：

If not existing the traded elements in the data space, the transaction is added in the data space Element, and the transaction version information of first data value and the data set is stored into storage corresponding to the traded elements Position, the transaction version information of the data set belongs to the storage information of first data value.

3. the method for claim 1, it is characterised in that also include：

If first data value is different from second data value, by the transaction of first data value and the data set Version information stores storage location corresponding to the traded elements, and the transaction version information of the data set belongs to described first The storage information of data value.

4. the method as described in any one of claims 1 to 3, it is characterised in that judge in data space with the presence or absence of institute Before stating traded elements, also include：

Calculate the Hash bucket Hash bucket values of the traded elements；

Judge to whether there is the traded elements in data space, including：

Traded elements with identical Hash bucket value are searched in the data space according to the Hash bucket values；

Search whether there are the traded elements from the traded elements with identical Hash bucket value.

5. a kind of method for reading data, it is characterised in that be applicable for use with the data as described in any one of Claims 1-4 and deposit The transaction processing system of method for storing, including：

Data inquiry request is received, the data inquiry request includes version information and traded elements；

From the data space of the transaction processing system, the number of the corresponding version information of the traded elements is inquired about According to value；

Return to the data value of the corresponding version information of the traded elements.

6. the data storage device in a kind of transaction processing system, it is characterised in that including：

Acquisition module, for obtaining data set, carries version information in the data set, the version information is walked with trading processing It is rapid corresponding；

Judge module, for for each traded elements in the data set, judging to whether there is in data space The traded elements；

Comparison module, for when the data space has the traded elements, comparing the first data value and the second number It is whether identical according to being worth；First data value is the corresponding data value of traded elements described in the data set, second number It is the corresponding data value of traded elements described in the data space according to value；

Memory module, for when the first data value of the traded elements is identical with the second data value, in second data Being worth in corresponding storage information increases the version information of the data set.

7. device as claimed in claim 6, it is characterised in that including：

The memory module, is additionally operable to, when not existing the traded elements in the data space, be deposited in the data Storage adds the traded elements in space, and the transaction version information of first data value and the data set is stored to institute The corresponding storage location of traded elements is stated, the transaction version information of the data set belongs to the storage letter of first data value Breath.

8. device as claimed in claim 6, it is characterised in that including：

The memory module, is additionally operable to when first data value is different from second data value, by first data The transaction version information of value and the data set stores storage location corresponding to the traded elements, the transaction of the data set Version information belongs to the storage information of first data value.

9. the device as described in any one of claim 6 to 8, it is characterised in that including：

The judge module, is additionally operable to calculate the Hash bucket Hash bucket values of the traded elements；

The judge module, specifically for：

Traded elements with identical Hash bucket value are searched in the data space according to the Hash bucket values；

Search whether there are the traded elements from the traded elements with identical Hash bucket value.

10. a kind of digital independent device, it is characterised in that be applicable for use with the data as described in any one of claim 6 to 9 and deposit The transaction processing system of storage device, including：

Receiver module, for receiving data inquiry request, the data inquiry request includes version information and traded elements；

Enquiry module, for from the data space of the transaction processing system, inquiring about the corresponding institute of the traded elements State the data value of version information；

Return to module, the data value for returning to the corresponding version information of the traded elements.