WO2016101528A1

WO2016101528A1 - Method and device for processing data in memory database

Info

Publication number: WO2016101528A1
Application number: PCT/CN2015/080111
Authority: WO
Inventors: 吴冬林; 曹义; 王刚
Original assignee: 中兴通讯股份有限公司
Priority date: 2014-12-26
Filing date: 2015-05-28
Publication date: 2016-06-30
Also published as: CN105786939A

Abstract

A method and device for processing data in a memory database. The method comprises: a temporary physical space is created when the new data is inserted into a first database; if the memory database needs to be optimized, then the identification of the first database is set in the temporary physical space, and the new data is written into the temporary physical space; if the keywords in the new data match with the index information of the first database and the index information of a second database, and the data content of the new data stored in the temporary physical space is the same with the data content in the second database which corresponds to the keywords in the new data, then the new data stored in the temporary physical space is deleted, and the identification of the data content which is stored in the second database and corresponds to the keywords in the new data is set to be a combined identification; the relationship between the keywords in the new data and the physical space address of the data content which corresponds to the keywords in the new data and is stored in the second database, is generated and saved into the index information of the first database.

Description

Data processing method and device for in-memory database

Technical field

This paper relates to the field of in-memory database technology, and in particular to a data processing method and device for an in-memory database.

Background technique

An in-memory database is a database that stores data in memory and can be directly manipulated, including data model definitions, data content itself, indexes, and so on.

At present, when the platform implements a certain function, it is necessary to create two database tables and database r with the same user table definition. The c library is used to store the pre-processed data when the user is configured, and the r-c library is used to store the submitted configuration data. The operation flow is as follows: first check the legality of the operation in the c library, modify the c library data after checking, the user then submits the operation, and overwrites the old data in the r library with the new data in the c library. After the operation is completed, the c library The same data exists in the r library. This method occupies more memory, and when other projects use the platform, due to the tight hardware memory resources, the database needs to occupy as little memory as possible.

Summary of the invention

The embodiment of the invention provides a data processing method and device for an in-memory database, the main purpose of which is to reduce the space occupied by the in-memory database.

In order to achieve the above objectives, the following technical solutions are adopted:

A data processing method for an in-memory database, comprising:

Create a temporary physical space when inserting new data in the first database;

If the in-memory database needs to be optimized, setting an identifier of the first database in the temporary physical space, and writing the new data into the temporary physical space;

If the keywords in the new data match the index information of the first database and the index information of the second database, and the data content of the new data stored in the temporary physical space and the new data If the data content of the second database corresponding to the keyword in the same is the same, the deletion is performed. The new data stored in the temporary physical space, the identifier of the data content corresponding to the keyword in the new data stored in the second database is set as a merge identifier;

Generating a correspondence between a keyword in the new data and a physical space address of the data content corresponding to the keyword in the new data stored in the second database, and storing an index in the first database Information.

Optionally, deleting the new data stored in the temporary physical space, and setting the identifier of the data content corresponding to the keyword in the new data to the merged identifier in the second database, the method further includes:

Obtaining a keyword in the new data, and matching the index information of the first database and the index information of the second database;

If the keywords in the new data match the index information of the first database and the index information of the second database, determine the data content and the content of the new data stored in the temporary physical space. Whether the data content of the second database corresponding to the keyword in the new data is the same;

If the same is the same, the step of deleting the new data stored in the temporary physical space and setting the identifier of the data content corresponding to the keyword in the new data stored in the second database as a merged identifier is performed.

Optionally, after the new physical data is inserted in the first database, after the temporary physical space is created, the method further includes:

Determining whether the in-memory database needs to be optimized;

If the in-memory database does not need to be optimized, the new data is written into the temporary physical space, the keywords in the new data are acquired, and the index information of the first database is matched; if matched, the generated The correspondence between the keyword in the new data and the temporary physical space address is saved in the index information of the first database, and the information of the successful insertion is returned; if not, the temporary physical space is deleted. The stored new data returns information that the insertion failed.

Optionally, after the keyword in the new data is acquired and matched with the index information of the first database and the index information of the second database, the method further includes:

If the keyword in the new data does not match the index information of the first database, delete The temporary physical space stores the new data, and returns information of the insertion failure;

If the keyword in the new data matches the index information of the first database but does not match the index information of the second database, generating a keyword in the new data and the temporary physical space address The correspondence between the two is stored in the index information of the first database.

Optionally, after determining whether the data content of the new data stored in the temporary physical space and the data content in the second database that are corresponding to the keywords in the new data are the same, the method further includes:

Generating a keyword in the new data and the temporary if the data content of the new data stored in the temporary physical space is different from the data content in the second database corresponding to the keyword in the new data Corresponding relationships between physical space addresses are stored in the first database index information.

Optionally, the method further includes:

When modifying the first data of the first database, determining whether the in-memory database has an optimization;

Obtaining an identifier of the first data if the in-memory database is optimized;

If the identifier of the first data is a merge identifier, modifying the merge identifier to an identifier of the first database;

Creating a new physical space, writing data content of the first data into the new physical space, and setting an identifier of the second database in the new physical space, generating the first data Updating the index information of the second database by the correspondence between the keyword and the new physical space address;

Creating a new temporary physical space, and storing the modified data of the first data in the new temporary physical space;

When the keyword in the first data is modified, determining whether the keyword in the modified data of the first data matches the index information of the first database, and if yes, modifying the first data Writing data to the physical space of the first data in the first database, and generating a keyword in the modified data of the first data and a physical space address of the first data in the first database Corresponding relationship between the index information of the first database is updated, and the modified data of the first data stored in the new temporary physical space is deleted.

Optionally, after obtaining the identifier of the first data, the method further includes:

If the identifier of the first data is the identifier of the second database, returning information that fails to modify the first data;

If the identifier of the first data is the identifier of the first database, create a new temporary physical space, and store the modified data of the first data in the new temporary physical space;

When the keyword in the first data is modified, determining whether the keyword in the modified data of the first data matches the index information of the first database, and if yes, modifying the first data Writing data to the physical space of the first data in the first database, and generating a keyword in the modified data of the first data and a physical space address of the first data in the first database Corresponding relationship between the first database, and the modification data of the first data stored in the new temporary physical space.

Optionally, after the deleting the modified data of the first data stored in the new temporary physical space, the method further includes:

Determining whether the modified data of the first data has the same data content in the second database;

If the same data content exists, delete the same data content in the second database, and generate a keyword in the modified data of the first data and a physicality of the first data in the first database Corresponding relationship between the spatial addresses, updating index information of the second database, and setting an identifier of the data content of the modified data of the first data as a merge identifier.

Optionally, the method further includes:

Determining whether the in-memory database has an optimization when deleting the second data of the first database;

And if the identifier of the second data is optimized, and the identifier of the second data is the merge identifier, the identifier of the second data is modified to an identifier of the second database;

The index information related to the second data of the first database is deleted.

Optionally, the method further includes:

Deleting the second data in the first database and deleting the second data and the second data in the first database when the second data of the first database is deleted Index information about the data;

If the in-memory database is optimized and the identifier of the second data is an identifier of the first database, deleting the second data in the first database, and deleting the first database and the second data Index information about the data;

If the in-memory database is optimized and the identifier of the second data is an identifier of the second database, the information that the deletion fails is returned.

Optionally, the method further includes:

Moving the cursor to the first record when looking up the record of the first database;

Sending information of the first record if the identifier of the first record is an identifier of the first database or a merge identifier;

If the identifier of the first record is the identifier of the second database, the cursor is moved to the next record.

A data processing device for an in-memory database, comprising:

a first creating unit, configured to create a temporary physical space when inserting new data in the first database;

a first setting unit, configured to set an identifier of the first database in the temporary physical space if the in-memory database needs to be optimized, and write the new data into the temporary physical space;

a first deleting unit, configured to: if the keyword in the new data matches the index information of the first database and the index information of the second database, and the data of the new data stored in the temporary physical space And the content is the same as the data content of the second database corresponding to the keyword in the new data, deleting the new data stored in the temporary physical space, and storing the new data in the second database The identifier of the data content corresponding to the keyword in the keyword is set as the merge identifier;

a first generating unit configured to generate a correspondence between a keyword in the new data and a physical space address of a data content corresponding to a keyword stored in the second data in the second database, and save the The index information of the first database.

Optionally, the device further includes:

a first acquiring unit, configured to acquire a keyword in the new data, and match the index information of the first database and the index information of the second database;

a first determining unit, configured to determine, if the keyword in the new data matches the index information of the first database and the index information of the second database, the new storage in the temporary physical space Whether the data content of the data is the same as the data content of the second database corresponding to the keyword in the new data;

The first deleting unit performs the deleting the new data stored in the temporary physical space when the determination result of the first determining unit is the same, and storing the new data in the second database. The identifier of the data content corresponding to the keyword is set to the operation of merging the identifier.

Optionally, the device further includes:

a second determining unit, configured to determine whether the in-memory database needs to be optimized after the temporary physical space is created when the first setting unit inserts new data in the first database;

a writing unit, configured to write the new data into the temporary physical space if the judgment result of the second determining unit is that the in-memory database does not need to be optimized; and acquire a keyword in the new data And matching the index information of the first database; if matching, generating a correspondence between the keyword in the new data and the temporary physical space address, and saving in the index information of the first database Returning the information of the successful insertion; if not, deleting the new data stored in the temporary physical space, and returning the information of the insertion failure.

Optionally, the device further includes:

a second deleting unit, configured to delete the new data stored in the temporary physical space if the keyword in the new data does not match the index information of the first database, and return information that the insertion fails;

a second generating unit, configured to generate a keyword in the new data if the keyword in the new data matches the index information of the first database but does not match the index information of the second database The correspondence relationship with the temporary physical space address is stored in the index information of the first database.

Optionally, the device further includes:

a third generation unit, configured to: if the determination result of the second determination unit is the temporary physics Generating the data content of the new data stored in the space and the data content in the second database corresponding to the keyword in the new data, generating a keyword between the new data and the temporary physical space address The corresponding relationship is saved in the index information of the first database.

Optionally, the device further includes:

a third determining unit, configured to determine whether the memory database exists to be optimized when the first data of the first database is modified;

a second obtaining unit, configured to acquire an identifier of the first data if a result of the determining by the third determining unit is that the in-memory database is optimized;

a first modifying unit, configured to: if the identifier of the first data is a merge identifier, modify the merge identifier to an identifier of the first database;

a second creating unit, configured to create a new physical space, write data content of the first data into the new physical space, and set an identifier of the second database in the new physical space to generate Updating a mapping relationship between the keyword in the first data and the new physical space address, and updating index information of the second database;

a storage unit, configured to create a new temporary physical space, and store the modified data of the first data in the new temporary physical space;

a fourth generating unit, configured to determine, when the keyword in the first data is modified, whether a keyword in the modified data of the first data matches an index information of the first database, and if yes, Transmitting the modified data of the first data into a physical space of the first data in the first database, and generating a keyword in the modified data of the first data and a location of the first data Determining a correspondence between physical space addresses in the first database, updating index information of the first database; and deleting modification data of the first data stored in the new temporary physical space.

Optionally, the device further includes:

Returning to the unit, if the identifier of the first data is the identifier of the second database, returning information that fails to modify the first data;

a third creating unit, configured to: if the identifier of the first data is an identifier of the first database, create a new temporary physical space, and store the modified data of the first data in the new temporary physical space Medium

a fifth generating unit, configured to determine, when the keyword in the first data is modified, whether a keyword in the modified data of the first data matches an index information of the first database, and if yes, Transmitting the modified data of the first data into a physical space of the first data in the first database, and generating a keyword in the modified data of the first data and a location of the first data Determining a correspondence between physical space addresses in the first database, updating index information of the first database; and deleting modification data of the first data stored in the new temporary physical space.

Optionally, the device further includes:

a fourth determining unit, configured to determine, after deleting the modified data of the first data stored in the new temporary physical space, whether the modified data of the first data has the same data content in the second database ;

a sixth generating unit, configured to delete the same data content in the second database and generate the modified data in the first data if the determination result of the fourth determining unit is that the same data content exists Updating the correspondence between the keyword and the physical space address of the first data in the first database, updating the index information of the second database, and identifying the data content of the modified data of the first data Set to merge ID.

Optionally, the device further includes:

a fifth determining unit, configured to determine whether the memory database has an optimization when deleting the second data of the first database;

a second modifying unit, configured to: if the result of the determining by the fifth determining unit is that the in-memory database is optimized and the identifier of the second data is the merged identifier, modify the identifier of the second data to Describe the identifier of the second database;

And a third deleting unit, configured to delete the index information related to the second data of the first database.

Optionally, the third deleting unit is further configured to:

If the result of the determination by the fifth determining unit is that the in-memory database does not have an optimization, deleting the second data in the first database, and deleting the index information related to the second data in the first database ;

If the judgment result of the fifth determining unit is that the in-memory database exists optimized and the second The identifier of the data is the identifier of the first database, the second data in the first database is deleted, and the index information related to the second data in the first database is deleted;

If the result of the determination by the fifth determining unit is that the in-memory database is optimized and the identifier of the second data is the identifier of the second database, the information that the deletion fails is returned.

Optionally, the device further includes a searching unit, where the searching unit is configured to:

In the embodiment of the present invention, when new data is inserted into a database, if the new data already has the same data content in another database, only the merge identifier is set for the data content, and no new data is added. Reduce the space occupied by the data itself; and make the two memory models define the same in-memory database to retain only one, which also reduces the space occupied by the data model definition, and achieves the purpose of reducing the space occupied by the in-memory database. In addition, different processing methods are available for whether or not there is a need for memory optimization, and it is compatible with a plurality of different projects. Optimizing the in-memory database using the embodiment of the present invention can save about 30% of memory.

BRIEF abstract

1 is a schematic flow chart of a first embodiment of a data processing method of an in-memory database;

2 is a schematic flow chart of a second embodiment of a data processing method of an in-memory database;

3 is a schematic flow chart of a third embodiment of a data processing method of an in-memory database;

4 is a schematic flow chart of a fourth embodiment of a data processing method of an in-memory database;

FIG. 5 is a schematic flowchart diagram of a fifth embodiment of a data storage method of an in-memory database;

6 is a schematic flowchart of a sixth embodiment of a data processing method of an in-memory database;

7 is a schematic flowchart of a seventh embodiment of a data processing method of an in-memory database;

8 is a schematic flowchart diagram of an eighth embodiment of a data processing method of an in-memory database;

9 is a schematic flowchart diagram of a ninth embodiment of a data processing method of an in-memory database;

10 is a schematic flowchart of a tenth embodiment of a data processing method of an in-memory database;

11 is a schematic diagram of functional modules of a first embodiment of a data processing apparatus of an in-memory database;

12 is a schematic diagram of functional modules of a second embodiment of a data processing apparatus of an in-memory database;

13 is a schematic diagram of functional modules of a third embodiment of a data processing apparatus of an in-memory database;

14 is a schematic diagram of functional modules of a fourth embodiment of a data processing apparatus of an in-memory database;

15 is a schematic diagram of functional modules of a fifth embodiment of a data processing apparatus of an in-memory database;

16 is a schematic diagram of functional blocks of a sixth embodiment of a data processing apparatus of an in-memory database;

17 is a schematic diagram of functional blocks of a seventh embodiment of a data processing apparatus of an in-memory database;

18 is a schematic diagram of functional modules of an eighth embodiment of a data processing apparatus of an in-memory database;

19 is a schematic diagram of functional blocks of a ninth embodiment of a data processing apparatus of an in-memory database;

20 is a schematic diagram of functional blocks of a tenth embodiment of a data processing apparatus of an in-memory database.

Preferred embodiment of the invention

Embodiments of the present invention provide a data processing method for an in-memory database.

Referring to FIG. 1, FIG. 1 is a schematic flowchart diagram of a first embodiment of a data processing method of an in-memory database.

In the first embodiment, the data processing method of the in-memory database includes:

Step 101: Create a temporary physical space when inserting new data in the first database;

Among them, when memory optimization is enabled, a database is created, a user table definition is created, and two indexes are created on the user table, that is, the index of the c database is retrieved and the index of the r database is retrieved.

The rcflag field is added to each user table as an identifier. The rcflag field has three values, namely c, r, and rc, c represents that the record belongs to the c database, r represents the record belongs to the r database, and rc is the merge identifier, and the representative record belongs to The c database belongs to the r database. The first database is the r database, and the second database is the c database as an example. Suppose you want to insert a student information in the r database. For example, Zhang San with the student number 10001, a unique index has been created on the student number field. In the student information, the student number is a keyword. First create a temporary physical space to store the number of "Zhang San with the student number 10001" according to.

Step 102: If the in-memory database needs to be optimized, set an identifier of the first database in the temporary physical space, and write the new data into the temporary physical space;

For example, the first field of the temporary physical space may be set to an rcflag field, and the rcflag field is assigned to r, to identify that new data stored in the temporary physical space needs to be inserted into the r database.

Step 103: If the keywords in the new data match the index information of the first database and the index information of the second database, and the data content and location of the new data stored in the temporary physical space If the data content of the second database corresponding to the keyword in the new data is the same, the new data stored in the temporary physical space is deleted, and the keyword stored in the second database and the new data is deleted. The identifier of the corresponding data content is set as a merge identifier;

Among them, "keyword and database index information match" has two meanings. In a database that adds or modifies data (such as the first database described above), the meaning of the match is "if the keyword corresponds to a unique index, the new data and the keyword content in the modified data cannot be combined with the existing data. The keyword content is the same." In another database, the meaning of the match is "you can find the data that matches the criteria based on the keyword."

For example, the keyword in the data of "Zhang San with the student number 10001" is "student number 10001", and matches the index information of the r database and the c database, that is, the "study number" is searched from the r database and the c database. 10001" data.

It is judged whether the "study number 10001" is stored in advance in the r database, and if it is not stored, it is considered to match the index information of the r database, and the data of "student number 10001" is searched in the c database, if "study number 10001" exists in the c database. Then, it is considered that the index information of the c database also matches, and the data content of the new data stored in the temporary physical space and the data content in the record found in the c database with the student number 10001 as keywords are continuously judged (ie: c database) Whether the data content corresponding to the middle school number 10001) is the same.

If they are the same, that is, the data content in the record found in the c database with the "study number 10001" as the key is "Zhang San of the student number 10001", the new data stored in the temporary physical space is deleted, and the new data will be deleted. The rcflag field in the corresponding data content in the c database is set to rc with the "student number 10001" as a key, that is, the identifier is set as the merge identifier.

Step 104: Generate a correspondence between a keyword in the new data and a physical space address of the data content corresponding to the keyword in the new data stored in the second database, and save the first In the index information of the database.

For example, the correspondence between the "student number 10001" and the physical space address of the "study number 10001" stored in the c database is stored in the index information of the r database.

In this embodiment, when a new data is inserted in the first database, a temporary physical space is created; an identifier of the first database is set in the temporary physical space, and the new data is written into the temporary physical space; Determining keywords in the new data, and matching the index information of the first database and the index information of the second database; if the keywords in the new data and the index information of the first database and If the index information of the second database matches, the data content of the new data stored in the temporary physical space is determined to be the same as the data content of the second database corresponding to the keyword; if the same, the temporary data is deleted. The new data stored in the physical space, the identifier of the data content corresponding to the keyword stored in the second database, such as the rcflag field, is set as a merge identifier; generating keywords and keywords in the new data Corresponding relationship between physical space addresses of data contents corresponding to keywords in the new data stored in the second database is saved in Said first index information database, thus reducing the space occupied by the data itself, achieve the purpose of optimizing memory footprint database.

Referring to FIG. 2, FIG. 2 is a schematic flowchart of a second embodiment of a data processing method of an in-memory database.

In the second embodiment, based on the first embodiment, before step 103, the method further includes:

Step 105: Acquire a keyword in the new data, and match the index information of the first database and the index information of the second database.

Step 106: If the keywords in the new data match the index information of the first database and the index information of the second database, determine the data content and the new data of the temporary physical space. Whether the data content of the second database corresponding to the keyword in the new data is the same, and if the same, the step 103 is performed.

Optionally, in the second embodiment, after step 101, the method further includes:

Step 107: Determine whether the in-memory database needs to be optimized.

If optimization is needed, proceed to step 102;

If the in-memory database does not require optimization, proceed to step 107';

107', the new data is written into the temporary physical space, the keywords in the new data are acquired, and the index information of the first database is matched; if matched, the key in the new data is generated. Corresponding relationship between the word and the temporary physical space address is stored in the index information of the first database, and the information of the successful insertion is returned; if not, the new data stored in the temporary physical space is deleted, Returns information that the insertion failed.

For example, if the "Zhang San with the student number 10001" is written in the r database, it is judged that the current in-memory database does not need to be optimized, and the "study number 10001 is written from the first field of the temporary physical space. If the data of Zhang San" does not have the data of "Study 10001" in the r database, it is considered to match the r database, and the correspondence between "Student 10001" and the temporary physical space address is generated, and the index information stored in the r database is stored. If the data of "Student 10001" already exists, the data of "Zhang San of 10001" in the temporary physical space is deleted, and the information of the insertion failure is returned.

Referring to FIG. 3, FIG. 3 is a schematic flowchart of a third embodiment of a data processing method of an in-memory database.

In the third embodiment, based on the second embodiment, after step 105, the method further includes:

Step 108: If the keyword in the new data does not match the index information of the first database, delete the new data stored in the temporary physical space, and return information that the insertion fails;

For example, if the "study number 10001" is written in the r database, if the data of "study number 10001" already exists in the r database, it is considered that the data does not match the r database, and the "study number 10001 is deleted. The data of Zhang San" returns the information of the failed insertion. If the "study number 10001" is written in the r database, there is no "study number 10001" data in the r database, and there is no "study number 10001" data in the c database, then the r database is considered. The matching does not match the c database, and the correspondence between the temporary physical space address storing the "Zhang San of the student number 10001" and the "student number 10001" is generated and stored in the index information of the r database.

Referring to FIG. 4, FIG. 4 is a schematic flowchart diagram of a fourth embodiment of a data processing method of an in-memory database.

In the fourth embodiment, based on the third embodiment, after step 106, the method further includes:

Step 109: If the data content stored in the temporary physical space and the data content in the second database corresponding to the keyword in the new data are different, generate a keyword in the new data and the temporary Correspondence between physical space addresses is stored in the index information of the first database.

For example, if "Zhang San of 10001" is written in the r database, the data of "Student 10001" is stored in the c library, but the data content is not "Zhang San", then the storage "Study number 10001" is generated. The correspondence between the temporary physical space address of Zhang San and the "student number 10001" is stored in the index information of the r database.

Referring to FIG. 5, FIG. 5 is a schematic flowchart diagram of a fifth embodiment of a data processing method of an in-memory database.

On the basis of any one of the first to fourth embodiments, the method further includes:

Step 501: Determine, in a case where the first data of the first database is modified, whether there is optimization in the in-memory database;

For example, if the data content of the r database "Wang 5 with the student number 10003" is modified, it is judged whether there is optimization in the in-memory database (that is, whether the rcflag field exists).

Step 502: If the in-memory database is optimized, obtain an identifier of the first data.

For example, if there is optimization in the in-memory database, the identifier of the data content of the r database "Wang 5 with the student number 10003" is obtained.

Step 503: If the identifier of the first data is a merge identifier, modify the merge identifier to an identifier of the first database.

For example, if the identifier of the "Wang 5 with the student number 10003" is the rc identifier, the rc identifier is modified to the r identifier.

Step 504: Create a new physical space, write data content of the first data into the new physical space, and set an identifier of the second database in the new physical space, and generate the first Updating the index information of the second database by a correspondence between a keyword in a data and the new physical space address;

For example, creating a new physical space, writing the "King of the Academy number 10003" into the new physical space, and setting the identifier of the c database in the new physical space address, and generating "learning" The number 10003" corresponds to the new physical space address, and updates the index information of the c database.

Step 505: Create a new temporary physical space, and store the modified data of the first data in a new temporary physical space.

For example, if you need to change the data content of "Wang 5 with the student number 10003" stored in the r database to "Wang 6 with the student number 10003" or "Wang 5 with the student number 10009", then the student number will be It is stored in the new temporary physical space for the King of the 10003 or the King of the School of the 10009.

Step 506: When the keyword in the first data is modified, determine whether the keyword in the modified data of the first data matches the index information of the first database, and if yes, the first The modified data of the data is written into the physical space of the first data in the first database, and generates a keyword in the modified data of the first data and the first data in the first database Corresponding relationship between physical space addresses, updating index information of the first database, and deleting modification data of the first data stored in the new temporary physical space.

For example, it is necessary to modify the data content of "King No. 10003" stored in the r database to "Wang 5 with the student number 10009", first check whether the "student number 10009" in the r database is occupied, if not Write the "Wang Wu with the student number 10009" into the physical space where the "King Wu No. 10003" is located, and generate the physical space address of "Student No. 10009" and the original "King Wu with the student number 10003". Correspondence relationship, update the index information of the r database, and delete the "Wang 5 with the student number 10009" in the new temporary physical space.

When the modified is not a keyword, the modified data of the first data is written into the physical space of the first data, and the modified data of the first data stored in the new temporary physical space is deleted; for example, it needs to be stored in r The data content of "Wangwu with the student number 10003" in the database was changed to "Wang Liu with the student number 10003", and the "Wang Liu with the student number 10003" was written into the "Wang Wu with the student number 10003". The physical space in which it is located. Delete the "Wang Six with the student number 10003" in the new temporary physical space.

Referring to FIG. 6, FIG. 6 is a schematic flowchart diagram of a sixth embodiment of a data processing method of a database.

In the fifth embodiment, after step 502, the method further includes:

Step 507: If the identifier of the first data is the second database identifier, return information that fails to modify the first data.

Creating a new temporary physics if the identifier of the first data is an identifier of the first database Space, storing the modified data of the first data in the new temporary physical space;

When the keyword in the first data is modified, determining whether the keyword in the modified data of the first data matches the index information of the first database, and if yes, modifying the first data Writing data to the physical space of the first data in the first database, and generating a keyword in the modified data of the first data and a physical space address of the first data in the first database Corresponding relationship between the first database, and the modification data of the first data stored in the new temporary physical space. For example, the data content of "King No. 10003" stored in the r database needs to be changed to "Wang 5 with the student number 10009". If the "King of the school number 10003" stored in the r database is c The identifier of the database returns the information that failed to modify the r database. If the "K5 of the student number 10003" stored in the r database is the identifier of the r database, a new temporary physical space is created, and the "King of the school number 10009" is stored in the new temporary physical space. Judging whether the "student number 10009" is stored in the r database, if not stored (ie: matching with the r database), the "king five with the student number 10009" is written in "the king five with the student number 10003" in the r database. In the physical space, the correspondence between the "student number 10009" and the physical space address of the original "king five of the student number 10003" is generated, and the index information of the r database is updated. Delete the "King of the Academy number 10009" in the new temporary physical space.

When the modified is not a keyword, the modified data of the first data is written into the physical space of the first data, and the modified data of the first data stored in the new temporary physical space is deleted; for example, it needs to be stored in r In the database, the data content of the "King No. 10003" (for the logo of the r database) was changed to "Wang Six with the student number 10003", and the "Wang Six with the student number 10003" was stored in the new temporary physics. In the space, after writing the physical space where the "King of the Academy number 10003" is located, delete the "Wang Six with the student number 10003" in the new temporary physical space.

Referring to FIG. 7, FIG. 7 is a schematic flowchart diagram of a seventh embodiment of a data processing method of a database.

Based on the sixth embodiment, after step 507, the method further includes:

Step 508: Determine whether the modified data of the first data has the same data content in the second database.

If the same data content exists, delete the same data content in the second database, and generate a keyword in the modified data of the first data and a physicality of the first data in the first database Corresponding relationship between the spatial addresses, updating the index information of the second database, The identifier of the data content of the modified data of the first data is set as a merge identifier;

For example, judging whether "Wang Six with the student number 10003" stores the same data content in the c database, and if so, deletes the data content of the c database, and generates "Wang 6 with the student number 10003" stored in the r database. The correspondence between the physical space address and the "student number 10003" is updated, and the index information of the c database is updated, and the identifier of the "King of the school number 10003" in the r database is set as the merge identifier.

Referring to FIG. 8, FIG. 8 is a schematic flowchart diagram of an eighth embodiment of a data processing method of an in-memory database.

Step 901: Determine, in the case that the second data of the first database is deleted, whether the memory database has an optimization.

For example, if it is necessary to delete the "six-six" of the r database of the r database, it is judged whether there is optimization in the in-memory database (that is, whether or not the rcflag field exists).

Step 902: If the in-memory database is optimized and the identifier of the second data is the merge identifier, modify the identifier of the second data to an identifier of the second database.

For example, if the in-memory database is optimized and the identifier of the "study number 10006" is rc, the "six-six with the student number 10006" is modified to c.

Step 903, deleting the index information related to the first database and the second data (the deleted index information is a correspondence between a keyword of the second data and a physical space address of the data content of the second data) ).

For example, the index information in the r database is deleted, and the deleted index information is a correspondence between the physical space addresses where the "study number 10006" and the "study number 10006" are located.

Referring to FIG. 9, FIG. 9 is a schematic flowchart diagram of a ninth embodiment of a data processing method of an in-memory database.

On the basis of the ninth embodiment, after step 901, the method further includes:

Step 904, if there is no optimization in the in-memory database, deleting the second data in the first database, and deleting the index information related to the second data in the first database;

For example, if there is no optimization in the in-memory database, the "six number 6 of the student number 10006" in the r database is directly deleted, and the index information of the r database is deleted, and the deleted index information is "study". The correspondence between the physical space address where the number 10006" and the "six number six of the student number 10006" are located.

If the identifier of the first database is optimized, and the identifier of the second data is the identifier of the first database, the second data in the first database is deleted, and the second data and the second data are deleted. Relevant index information;

For example, if the identifier of the in-memory database is optimized and the identifier of the "six-six" of the student number 10006 is r, the "six-six number of the student number 10006" in the r-database is deleted, and the r-database is deleted. Index information, the deleted index information is the correspondence between the physical space addresses where "student number 10006" and "study number 10006" are located.

If the memory database is optimized and the identifier of the second data is the identifier of the second database, the information that the deletion fails is returned.

For example, if the identifier of the in-memory database is optimized and the identifier of the "six-six" with the student number 10006 is the c-identification, the information indicating that the "six-six number of the student number 10006" has been deleted is returned.

Referring to FIG. 10, FIG. 10 is a schematic flowchart diagram of a tenth embodiment of a data processing method of an in-memory database.

Step 1101, in the case of searching for the record of the first database, moving the cursor to the first record;

For example, in the case of finding a record of the r database, the cursor is first moved to the first record.

Step 1102: If the identifier of the first record is an identifier of the first database or a merge identifier, send the information of the first record.

For example, if the identifier of the first record is r or rc, the information of the first record is sent.

Step 1103: If the identifier of the first record is the identifier of the second database, move the cursor to the next record.

For example, if the identifier of the first record is c, the cursor is moved to the next record.

Embodiments of the present invention provide a data processing apparatus for an in-memory database.

Referring to FIG. 11, FIG. 11 is a first embodiment of a data processing apparatus for an in-memory database according to an embodiment of the present invention. A schematic diagram of the functional modules of the example. The device includes:

The first creating unit 1201 is configured to create a temporary physical space when inserting new data in the first database;

The rcflag field is added to each user table as an identifier. The rcflag field has three values, namely c, r, and rc, c represents that the record belongs to the c database, r represents the record belongs to the r database, and rc is the merge identifier, and the representative record belongs to The c database belongs to the r database. The first database is the r database, and the second database is the c database as an example. Suppose you want to insert a student information in the r database, such as Zhang San with the student number 10001, and the index information is the student number. First create a temporary physical space to store the data of "Zhang San with the student number 10001".

The first setting unit 1202 is configured to: if the in-memory database needs to be optimized, set an identifier of the first database in the temporary physical space, and write the new data into the temporary physical space;

The keyword for obtaining the data of "Zhang San with the student number 10001" is "student number 10001", and matches the index information of the r database and the c database, that is, searching for the "study number 10001" from the r database and the c database. information.

If the keyword "student number 10001" matches in both the r database and the c database, it is judged whether the new data stored in the temporary physical space and the data content in the corresponding record of the "student number 10001" in the c database are the same.

The first deleting unit 1203 is configured to: if the keyword in the new data matches the index information of the first database and the index information of the second database, and the new data stored in the temporary physical space And the data content is the same as the data content of the second database corresponding to the keyword in the new data, deleting the new data stored in the temporary physical space, storing the new data in the second database The identifier of the data content corresponding to the keyword in the data is set as the merge identifier;

For example, if the corresponding data content of the keyword "student number 10001" in the c database is "Zhang San with the student number 10001", the rcflag field in the corresponding data content of the keyword "student number 10001" in the c database is used. Set to rc.

The first generating unit 1204 is configured to generate a correspondence between a keyword in the new data and a physical space address of the data content corresponding to the keyword stored in the new data in the second database, and save the In the index information of the first database.

Specifically, the physical space address stored in the c database is recorded in the data content corresponding to the keyword "student number 10001", and the keyword "student number 10001" and the "study number 10001" are stored in the c database. The correspondence of the physical space addresses is stored in the index information of the r database.

Referring to FIG. 12, FIG. 12 is a schematic diagram of functional modules of a second embodiment of a data processing apparatus of an in-memory database.

Based on the first embodiment of the device, the device further includes:

The first obtaining unit 1301 is configured to acquire a keyword in the new data, and match the index information of the first database and the index information of the second database;

The first determining unit 1302 is configured to determine, if the keyword in the new data matches the index information of the first database and the index information of the second database, the storage of the temporary physical space Whether the data content of the new data is the same as the data content of the second database corresponding to the keyword in the new data;

The first deleting unit 1203, when the determination result of the first determining unit 1302 is the same, performing the deleting the new data stored in the temporary physical space, storing the new data in the second database The identifier of the data content corresponding to the keyword in the data is set as the operation of merging the identifier.

Optionally, the apparatus further includes: the second determining unit 1304 is configured to determine whether the in-memory database needs to be optimized after the first creating unit 1201 creates the temporary physical space;

The writing unit 1303 is configured to write the new data into the temporary physical space if the result of the determination by the second determining unit 1304 is that the in-memory database does not need to be optimized; and acquire the new data. a keyword matching the index information of the first database; if matched, generating a correspondence between a keyword in the new data and the temporary physical space address, and storing an index in the first database In the message, the information that the insertion was successful is returned; if it does not match, the deletion is deleted. In addition to the new data stored in the temporary physical space, information that the insertion failed is returned.

For example, if the "study number 10001" is written in the r database, it is judged that the current in-memory database does not need data optimization, and the "study number is 10001" is written from the first field of the temporary physical space. Zhang San".

Referring to FIG. 13, FIG. 13 is a functional block diagram of a third embodiment of a data processing apparatus of an in-memory database.

On the basis of the second embodiment of the device, the device further includes:

The second deleting unit 1401 is configured to delete the new data stored in the temporary physical space if the keyword in the new data does not match the index information of the first database, and return information that the insertion fails;

The second generating unit 1402 is configured to generate a key in the new data if the keyword in the new data matches the index information of the first database but does not match the index information of the second database. The correspondence between the word and the temporary physical space address is stored in the index information of the first database.

For example, if the "Zhangsan with the student number 10001" is written in the r database, if the index information of the "study number 10001" already exists in the r database, it is considered that the r-database does not match, and the temporary physical space is deleted. The stored data of "Zhang San of 10001" returns the information of the failed insertion. If "Zhang San with the student number 10001" is written in the r database, there is no index information of "study number 10001" in the r database, and there is no "study number 10001" index information in the c database. Matches with the r database, and does not match the c database, and generates a correspondence between the temporary physical space address storing the "Zhangsan of the student number 10001" and the keyword "student number 10001", and is stored in the index information of the r database. .

Referring to FIG. 14, FIG. 14 is a schematic diagram of functional modules of a fourth embodiment of a data processing apparatus of an in-memory database.

On the basis of the third embodiment of the device, the device further includes:

The third generating unit 1501 is configured to: if the determination result of the second determining unit is the data content of the new data stored in the temporary physical space and the data corresponding to the keyword in the new data in the second database If the content is different, generating keywords in the new data and the temporary physics The correspondence between the spatial addresses is stored in the index information of the first database.

For example, if "Zhang San with the student number 10001" is written in the r database, the index information of "study number 10001" is stored in the c library, but the data content is not "Zhang San", then the storage "student number is The correspondence between the temporary physical space address of the "three" of 10001 and the keyword "study number 10001" is stored in the physical space address relationship table of the r database.

Referring to FIG. 15, FIG. 15 is a schematic diagram of functional modules of a fifth embodiment of a data processing apparatus of an in-memory database.

On the basis of any one of the first to fourth embodiments of the device, the device further includes:

The third determining unit 1601 is configured to determine, if the first data of the first database is modified, whether the memory database has an optimization;

For example, if the "K5 of the student number 10003" of the r database is modified, it is judged whether it is necessary to optimize the in-memory database.

The second obtaining unit 1602 is configured to acquire an identifier of the first data if the result of the determining by the third determining unit is that the in-memory database is optimized;

The first modifying unit 1603 is configured to: if the identifier of the first data is a merge identifier, modify the merge identifier to an identifier of the first database;

a second creating unit 1604, configured to create a new physical space, write data content of the first data into the new physical space, and set an identifier of the second database in the new physical space, Generating a correspondence between a keyword in the first data and the new physical space address, and updating index information of the second database;

For example, creating a new physical space, writing the "King of 10003" to the new physical space, and setting the identifier of the c database in the new physical space address, and generating a keyword " The correspondence between the student number 10003" and the new physical space address is stored in the index information of the c database.

The storage unit 1605 is configured to create a new temporary physical space, and store the modified data of the first data in the new temporary physical space;

For example, if you need to change the "Wang 5 with the student number 10003" stored in the r database to "Wang 6 with the student number 10003" or "Wang 5 with the student number 10009", then the student number is 10003. Wang Liu” or “Wang Wu with the student number 10009” is stored in the new temporary physical space.

The fourth generating unit 1606 is configured to determine, when the keyword in the first data is modified, whether the keyword in the modified data of the first data matches the index information of the first database, and if yes, And modifying the modified data of the first data into the physical space of the first data in the first database, and generating a keyword in the modified data of the first data and the first data Corresponding relationship between physical space addresses in the first database, updating index information of the first database; deleting modification data of the first data stored in the new temporary physical space.

For example, you need to change the "Wang 5 with the student number 10003" stored in the r database to "Wang 5 with the student number 10009". First check whether the "student number 10009" in the r database is occupied. If not, modify it. The keyword of the data matches the index information of the r database, and the "King of the school number 10009" is written into the physical space where the "King of the Academy number 10003" is located, and the index information of the r database is updated, including: the r database The correspondence between "student number 10001" and the physical space address in the index information is updated to the correspondence between "student number 10009" and the physical space address.

In the case of not modifying the keyword of the first data, for example, if the data content of the "King No. 10003" stored in the r database needs to be modified to "Wang 6 with the student number 10003", then "learning" Wang 6, numbered 10003, is written in the physical space where the "King of the Academy number 10003" is located.

Referring to FIG. 16, FIG. 16 is a schematic diagram of functional blocks of a sixth embodiment of a data processing apparatus of an in-memory database.

On the basis of the fifth embodiment of the device, the device further includes:

The returning unit 1701 is configured to: if the identifier of the first data is the second database identifier, return information that fails to modify the first data;

The third creating unit 1702 is configured to: if the identifier of the first data is the identifier of the first database, create a new temporary physical space, and store the modified data of the first data in the new temporary physical In space

The fifth generating unit 1703 is configured to determine, when the keyword in the first data is modified, whether the keyword in the modified data of the first data matches the index information of the first database, and if yes, And modifying the modified data of the first data into the physical space of the first data in the first database, and generating a keyword in the modified data of the first data and the first data in the Determining a correspondence between physical space addresses in the first database, updating index information of the first database; and deleting modification data of the first data stored in the new temporary physical space.

For example, you need to change the "Wangwu with the student number 10003" stored in the r database to "Wangwu with the student number 10009". If the "King of the school number 10003" stored in the r database is the identifier of the c database. , return the information that failed to modify the r database. If the "K5 of the student number 10003" stored in the r database is the identifier of the r database, a new temporary physical space is created, and the "King 5 with the student number 10009" is stored in the new temporary physical space. Determine whether the index information of "study number 10009" is stored in the r database. If it is not stored (ie, the keyword matches the r database), the "king five with the student number 10009" is written in "the king with the student number 10003". Five" in the physical space in the r database, and generate a correspondence between the keyword "study number 10009" and "king five with the student number 10009", update the index information of the r database, delete the new The "King of the Academy number 10009" in the temporary physical space. .

In the case of not modifying the keyword of the first data, for example, if the "Wang 5 with the student number 10003" stored in the r database needs to be modified to "Wang 6 with the student number 10003", then the student number is 10003. The "Wang Liu" is written in the physical space where the "King Wu with the student number 10003" is located.

Reference 17, which is a functional block diagram of a seventh embodiment of a data processing apparatus of an in-memory database.

On the basis of the sixth embodiment of the device, the device further includes:

The fourth determining unit 1801 is configured to determine, after deleting the modified data of the first data stored in the new temporary physical space, whether the modified data of the first data has the same data in the second database. content;

The sixth generating unit 1802 is configured to delete the same data content in the second database and generate the modified data of the first data if the determination result of the fourth determining unit is that the same data content exists. Keyword and physical space of the first data in the first database Corresponding relationship between the addresses, updating the index information of the second database, setting an identifier of the data content of the modified data of the first data as a merge identifier.

For example, if there is optimization in the in-memory database, it is judged whether the modified data "Wang 6 with the student number 10003" stores the same data content in the c database, and if so, the data content of the c database is deleted, and the "student number is 10003" is generated. "Wang Liu" stores the correspondence between the physical space address in the r database and the "Wang Six" with the student number 10003, updates the index relationship of the c database, and the "King of 10003" in the r database The identifier of the six" is set to merge the identifier, and the "king six of the student number 10003" of the new temporary physical space storage is deleted.

Referring to FIG. 18, FIG. 18 is a schematic diagram of functional blocks of an eighth embodiment of a data processing apparatus of an in-memory database.

The fifth determining unit 2001 is configured to determine, if the second data of the first database is deleted, whether the memory database has an optimization (ie, whether an rcflag field exists);

For example, if it is necessary to delete the "six-six" of the r database of the r database, it is judged whether there is optimization in the in-memory database.

The second modifying unit 2002 is configured to modify the identifier of the second data to be determined if the result of the determining by the fifth determining unit is that the in-memory database is optimized and the identifier of the second data is the merge identifier The identifier of the second database;

For example, if the in-memory database is optimized and the identifier of the "six-six" with the student number 10006 is the rc flag, the "six-six" with the student number 10006 is modified to the c-identification.

The third deleting unit 2003 is configured to delete the index information related to the second data of the first database.

For example, in the index information of the r database, the correspondence between the keyword "student number 10006" and the physical space address of the "study number 10006" is deleted.

Referring to FIG. 19, FIG. 19 is a schematic diagram of functional blocks of a ninth embodiment of a data processing apparatus of an in-memory database.

On the basis of the ninth embodiment of the device, the third deleting unit 2101 is further configured to:

If the result of the determination by the fifth determining unit 2001 is that the in-memory database does not have an optimization, then Deleting the second data in the first database, and deleting index information related to the second data of the first database;

For example, if there is no optimization in the in-memory database, the "study number 10006" in the r database is directly deleted, and the index information of the r database is deleted, and the keyword "student number is 10006" and the "learning" The correspondence between the physical space addresses of the number 6 of Zhang Liu.

If the result of the determination by the fifth determining unit 2001 is that the in-memory database is optimized and the identifier of the second data is the identifier of the first database, deleting the second data in the first database, and deleting Index information related to the second data of the first database;

For example, if the identifier of the "six-six with the student number 10006" is r, delete the "six-six number of the student number 10006" in the r database, and delete the index information of the r database, the key The correspondence between the word "study number 10006" and the physical space address of the "study number 10006".

If the result of the determination by the fifth determining unit 2001 is that the in-memory database is optimized and the identifier of the second data is the identifier of the second database, the information that the deletion fails is returned.

For example, if the identifier of the "six-six with the student number 10006" is c, then the information that the "six-six number of the student number 10006" fails is returned.

Referring to FIG. 20, FIG. 20 is a schematic diagram of functional modules of a tenth embodiment of a data processing apparatus of an in-memory database.

On the basis of any one of the first to fourth embodiments of the apparatus, the apparatus further includes a searching unit 2201, and the searching unit 2201 is configured to:

In the case of finding the record of the first database, moving the cursor to the first record;

For example, if the identifier of the first record is an identifier of the r database or an rc identifier, the information of the first record is sent.

For example, if the identifier of the first record is the identifier of the c database, the cursor is moved to the next record.

Industrial applicability

In the embodiment of the present invention, when new data is inserted into a database, if the new data already has the same data content in another database, only the merge identifier is set for the data content, and no new data is added. Reduce the space occupied by the data itself; and make the two memory models define the same in-memory database to retain only one, which also reduces the space occupied by the data model definition, and achieves the purpose of reducing the space occupied by the in-memory database. In addition, different processing methods are available for whether or not there is a need for memory optimization, and it is compatible with a plurality of different projects.

Claims

A data processing method for an in-memory database, comprising:

Create a temporary physical space when inserting new data in the first database;

If the in-memory database needs to be optimized, setting an identifier of the first database in the temporary physical space, and writing the new data into the temporary physical space;

If the keywords in the new data match the index information of the first database and the index information of the second database, and the data content of the new data stored in the temporary physical space and the new data If the data content of the second database corresponding to the keyword in the same is the same, deleting the new data stored in the temporary physical space, and storing the data corresponding to the keyword in the new data stored in the second database The identity of the content is set to the merged identity;

Generating a correspondence between a keyword in the new data and a physical space address of the data content corresponding to the keyword in the new data stored in the second database, and storing an index in the first database Information.
The method according to claim 1, wherein the new data stored in the temporary physical space is deleted, and an identifier of the data content corresponding to the keyword in the new data stored in the second database is set as a merge Before the logo, it also includes:

Obtaining a keyword in the new data, and matching the index information of the first database and the index information of the second database;

If the keywords in the new data match the index information of the first database and the index information of the second database, determine the data content and the content of the new data stored in the temporary physical space. Whether the data content of the second database corresponding to the keyword in the new data is the same;

If the same is the same, the step of deleting the new data stored in the temporary physical space and setting the identifier of the data content corresponding to the keyword in the new data stored in the second database as a merged identifier is performed.
The method according to claim 1, wherein after the new data is inserted in the first database, after the temporary physical space is created, the method further includes:

Determining whether the in-memory database needs to be optimized;

If the in-memory database does not need to be optimized, the new data is written into the temporary physical space, the keywords in the new data are acquired, and the index information of the first database is matched; if matched, the generated The correspondence between the keyword in the new data and the temporary physical space address is saved in the index information of the first database, and the information of the successful insertion is returned; if not, the temporary physical space is deleted. The stored new data returns information that the insertion failed.
The method of claim 2, wherein after the keyword in the new data is acquired and matched with the index information of the first database and the index information of the second database, the method further includes:

If the keyword in the new data does not match the index information of the first database, deleting the new data stored in the temporary physical space, and returning information that the insertion fails;

If the keyword in the new data matches the index information of the first database but does not match the index information of the second database, generating a keyword in the new data and the temporary physical space address The correspondence between the two is stored in the index information of the first database.
The method according to claim 2, wherein after determining whether the data content of the new data stored in the temporary physical space and the data content in the second database corresponding to the keywords in the new data are the same, :

Generating a keyword in the new data and the temporary if the data content of the new data stored in the temporary physical space is different from the data content in the second database corresponding to the keyword in the new data Corresponding relationships between physical space addresses are stored in the first database index information.
The method of any one of claims 1 to 5, further comprising:

When modifying the first data of the first database, determining whether the in-memory database has an optimization;

Obtaining an identifier of the first data if the in-memory database is optimized;

If the identifier of the first data is a merge identifier, modifying the merge identifier to an identifier of the first database;

Creating a new physical space, writing data content of the first data to the new physical space, and setting an identifier of the second database in the new physical space, generating the first data Update the index information of the second database by the correspondence between the keyword and the new physical space address;

Creating a new temporary physical space, and storing the modified data of the first data in the new temporary physical space;

When the keyword in the first data is modified, determining whether the keyword in the modified data of the first data matches the index information of the first database, and if yes, modifying the first data Writing data to the physical space of the first data in the first database, and generating a keyword in the modified data of the first data and a physical space address of the first data in the first database Corresponding relationship between the index information of the first database is updated, and the modified data of the first data stored in the new temporary physical space is deleted.
The method of claim 6, wherein after obtaining the identifier of the first data, the method further comprises:

If the identifier of the first data is the identifier of the second database, returning information that fails to modify the first data;

If the identifier of the first data is the identifier of the first database, create a new temporary physical space, and store the modified data of the first data in the new temporary physical space;

When the keyword in the first data is modified, determining whether the keyword in the modified data of the first data matches the index information of the first database, and if yes, modifying the first data Writing data to the physical space of the first data in the first database, and generating a keyword in the modified data of the first data and a physical space address of the first data in the first database Corresponding relationship between the first database, and the modification data of the first data stored in the new temporary physical space.
The method according to claim 7, wherein after the deleting the modified data of the first data stored in the new temporary physical space, the method further comprises:

Determining whether the modified data of the first data has the same data content in the second database;

If the same data content exists, deleting the same data content in the second database, and generating a keyword in the modified data of the first data and the first data in the first data Corresponding relationship between physical space addresses in the library, updating index information of the second database, and setting an identifier of the data content of the modified data of the first data as a merge identifier.
The method of any one of claims 1 to 5, further comprising:

Determining whether the in-memory database has an optimization when deleting the second data of the first database;

And if the identifier of the second data is optimized, and the identifier of the second data is the merge identifier, the identifier of the second data is modified to an identifier of the second database;

The index information related to the second data of the first database is deleted.
The method of claim 9 further comprising:

When the second data of the first database is deleted, if there is no optimization in the in-memory database, deleting the second data in the first database, and deleting the first database is related to the second data Index information;

If the in-memory database is optimized and the identifier of the second data is an identifier of the first database, deleting the second data in the first database, and deleting the first database and the second data Index information about the data;

If the in-memory database is optimized and the identifier of the second data is an identifier of the second database, the information that the deletion fails is returned.
The method of any one of claims 1 to 5, further comprising:

Moving the cursor to the first record when looking up the record of the first database;

Sending information of the first record if the identifier of the first record is an identifier of the first database or a merge identifier;

If the identifier of the first record is the identifier of the second database, the cursor is moved to the next record.
A data processing device for an in-memory database, comprising:

a first creating unit, configured to create a temporary physical space when inserting new data in the first database;

a first setting unit, configured to: if the in-memory database needs to be optimized, in the temporary physics Setting an identifier of the first database and writing the new data to the temporary physical space;

a first deleting unit, configured to: if the keyword in the new data matches the index information of the first database and the index information of the second database, and the data of the new data stored in the temporary physical space And the content is the same as the data content of the second database corresponding to the keyword in the new data, deleting the new data stored in the temporary physical space, and storing the new data in the second database The identifier of the data content corresponding to the keyword in the keyword is set as the merge identifier;

a first generating unit configured to generate a correspondence between a keyword in the new data and a physical space address of a data content corresponding to a keyword stored in the second data in the second database, and save the The index information of the first database.
The apparatus of claim 12, further comprising:

a first acquiring unit, configured to acquire a keyword in the new data, and match the index information of the first database and the index information of the second database;

a first determining unit, configured to determine, if the keyword in the new data matches the index information of the first database and the index information of the second database, the new storage in the temporary physical space Whether the data content of the data is the same as the data content of the second database corresponding to the keyword in the new data;

The first deleting unit performs the deleting the new data stored in the temporary physical space when the determination result of the first determining unit is the same, and storing the new data in the second database. The identifier of the data content corresponding to the keyword is set to the operation of merging the identifier.
The apparatus of claim 12, further comprising:

a second determining unit, configured to determine whether the in-memory database needs to be optimized after the temporary physical space is created when the first setting unit inserts new data in the first database;

a writing unit, configured to write the new data into the temporary physical space if the judgment result of the second determining unit is that the in-memory database does not need to be optimized; and acquire a keyword in the new data And matching the index information of the first database; if matching, generating a correspondence between the keyword in the new data and the temporary physical space address, and saving in the index information of the first database Returning the information of the successful insertion; if not, deleting the new data stored in the temporary physical space, and returning the information of the insertion failure.
The apparatus of claim 13 further comprising:

a second deleting unit, configured to delete the new data stored in the temporary physical space if the keyword in the new data does not match the index information of the first database, and return information that the insertion fails;

a second generating unit, configured to generate a keyword in the new data if the keyword in the new data matches the index information of the first database but does not match the index information of the second database The correspondence relationship with the temporary physical space address is stored in the index information of the first database.
The apparatus of claim 12, further comprising:

a third generating unit, configured to: if the determination result of the second determining unit is the data content of the new data stored in the temporary physical space and the data content corresponding to the keyword in the new data in the second database If not, the correspondence between the keyword in the new data and the temporary physical space address is generated and stored in the index information of the first database.
The apparatus according to any one of claims 12 to 16, further comprising:

a third determining unit, configured to determine whether the memory database exists to be optimized when the first data of the first database is modified;

a second obtaining unit, configured to acquire an identifier of the first data if a result of the determining by the third determining unit is that the in-memory database is optimized;

a first modifying unit, configured to: if the identifier of the first data is a merge identifier, modify the merge identifier to an identifier of the first database;

a second creating unit, configured to create a new physical space, write data content of the first data into the new physical space, and set an identifier of the second database in the new physical space to generate Updating a mapping relationship between the keyword in the first data and the new physical space address, and updating index information of the second database;

a storage unit, configured to create a new temporary physical space, and store the modified data of the first data in the new temporary physical space;

a fourth generating unit, configured to determine, when the keyword in the first data is modified, whether the keyword in the modified data of the first data matches the index information of the first database, if Matching, the modified data of the first data is written into a physical space of the first data in the first database, and a keyword and a first data in the modified data of the first data are generated. And updating the index information of the first database in the corresponding relationship between the physical space addresses in the first database; and deleting the modified data of the first data stored in the new temporary physical space.
The apparatus of claim 17 further comprising:

Returning to the unit, if the identifier of the first data is the identifier of the second database, returning information that fails to modify the first data;

a third creating unit, configured to: if the identifier of the first data is an identifier of the first database, create a new temporary physical space, and store the modified data of the first data in the new temporary physical space in;

a fifth generating unit, configured to determine, when the keyword in the first data is modified, whether a keyword in the modified data of the first data matches an index information of the first database, and if yes, Transmitting the modified data of the first data into a physical space of the first data in the first database, and generating a keyword in the modified data of the first data and a location of the first data Determining a correspondence between physical space addresses in the first database, updating index information of the first database; and deleting modification data of the first data stored in the new temporary physical space.
The apparatus of claim 18, further comprising:

a fourth determining unit, configured to determine, after deleting the modified data of the first data stored in the new temporary physical space, whether the modified data of the first data has the same data content in the second database ;

a sixth generating unit, configured to delete the same data content in the second database and generate the modified data in the first data if the determination result of the fourth determining unit is that the same data content exists Updating the correspondence between the keyword and the physical space address of the first data in the first database, updating the index information of the second database, and identifying the data content of the modified data of the first data Set to merge ID.
The apparatus according to any one of claims 12 to 16, further comprising:

a fifth determining unit, configured to determine whether the memory database has an optimization when deleting the second data of the first database;

a second modifying unit, configured to: if the result of the determining by the fifth determining unit is that the in-memory database is optimized and the identifier of the second data is the merged identifier, modify the identifier of the second data to Describe the identifier of the second database;

And a third deleting unit, configured to delete the index information related to the second data of the first database.
The apparatus according to claim 20, wherein said third deleting unit is further configured to:

If the result of the determination by the fifth determining unit is that the in-memory database does not have an optimization, deleting the second data in the first database, and deleting the index information related to the second data in the first database ;

If the result of the determination by the fifth determining unit is that the in-memory database is optimized and the identifier of the second data is the identifier of the first database, deleting the second data in the first database, and deleting the Index information related to the second data of the first database;

If the result of the determination by the fifth determining unit is that the in-memory database is optimized and the identifier of the second data is the identifier of the second database, the information that the deletion fails is returned.
The apparatus according to any one of claims 12 to 16, further comprising a lookup unit configured to:

Moving the cursor to the first record when looking up the record of the first database;

Sending information of the first record if the identifier of the first record is an identifier of the first database or a merge identifier;

If the identifier of the first record is the identifier of the second database, the cursor is moved to the next record.