CN100353325C - Method for realing sharing internal stored data base and internal stored data base system - Google Patents
Method for realing sharing internal stored data base and internal stored data base system Download PDFInfo
- Publication number
- CN100353325C CN100353325C CNB2004100643248A CN200410064324A CN100353325C CN 100353325 C CN100353325 C CN 100353325C CN B2004100643248 A CNB2004100643248 A CN B2004100643248A CN 200410064324 A CN200410064324 A CN 200410064324A CN 100353325 C CN100353325 C CN 100353325C
- Authority
- CN
- China
- Prior art keywords
- data
- memory database
- database
- module
- memory
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Abstract
The present invention discloses a method for realizing memory database share, which is used for solving the problem existing in the existing memory database which can not satisfy high concurrent quantity data access. The method comprises a creating procedure, a locking procedure, an executing procedure and an unlocking procedure, wherein the creating procedure is used for creating a shared memory for multi-process access and preserving a memory database in the shared memory; when receiving an accessing request of the processes, the memory database locks the operation so that the processes exclusively access the memory database to ensure data consistency; after the operation is locked, the data is actually operated by a database management system which outputs results; the unlocking procedure is used for unlocking the operation after executing the accessing operation of the processes.
Description
Technical field
The present invention relates to database technology, relate in particular to the shared drive database that can carry out data processing for multi-process.
Background technology
Memory database is for traditional magnetic disk relevant database (as Oracle, SQLServer).Traditional database uses disk to guarantee the persistent storage of data, and memory database is the data memory-resident, and the access of all affairs/data only relates to internal memory.Therefore memory database can reach higher performance, better real-time property with respect to traditional relevant database.
In real-time required than higher telesoftware, memory database used often.The patent No. is ZL00134030.1, name be called the method that improves the Short Message Scheduling Center message handling ability patent disclosure a kind of implementation of memory database.These memory databases are because of its running environment difference, and the scheme of realization is also different, but its common characteristic is exactly: all be the scheme of one process, database data can only the one process visit.
Require in the lower running environment at some, the memory database of one process is realized simple, can satisfy the demands.But for the platform software of telecommunication system, such as Service Control Point of intelligent network (SCP) platform, need the data access of high concurrency, need a plurality of processes to carry out the processing of data simultaneously, at this time the memory database of one process just can't meet the demands.
Summary of the invention
The invention provides a kind of method and memory database system of realizing the shared drive database, have the problem that can't satisfy high concurrency data access to solve existing memory database.
For addressing the above problem, the invention provides following technical scheme:
A kind of method that realizes the shared drive database, this method comprises: foundation step is used to create to supply the shared drive of multi-process visit, and memory database is stored in this shared drive;
The step that locks locks to operation when the request of access of described memory database in the process of receiving, and makes between process the exclusive reference memory database to guarantee the consistance of data;
Execution in step is carried out practical operation and is exported the result data by data base management system (DBMS) after operation locks;
The release step is used for behind the accessing operation of the process of executing removing the lock of this operation.
Wherein:
Adopt semaphore that operation is locked and release; Each lock realizes that with two semaphores one of them semaphore writes down the current enterable process number of reading, i.e. read signal amount, and another semaphore writes down the current number of passes amount of writing into, i.e. write signal amount.
When described accessing operation is read operation, judge that whether the write signal amount is greater than 0 earlier; If then make read operation enter waiting status, otherwise, carry out read operation after the read signal amount subtracted 1, and after finishing read operation, the read signal amount is added 1.
When described accessing operation is write operation, earlier the write signal amount is added 1 back and judge whether the read signal amount is that maximum is read the process number; If then carry out write operation, and after write operation is finished, the write signal amount subtracted 1, otherwise make write operation enter waiting status.
Described shared drive comprises a plurality of uniquely identified common memory sections that have, and process at in-process first address, is visited data this common memory section in according to this first address according to this sign mapping common memory section and record mapping back common memory section.
A kind of memory database system is used for for the multi-process visit; This memory database system comprises:
Interface module is used for providing access path to outside application process;
The data definition language (DDL) execution module is used for carrying out establishment table, delete list and establishment index operation according to the operational order of interface module output;
The data dictionary module is used for the order management list structure information according to the output of data definition language (DDL) execution module;
The data manipulation language (DML) execution module is carried out the reading and writing operation of data according to the operational order of interface module output;
Index module is carried out index according to the operational order of data manipulation language (DML) execution module output to data;
Lock module is used for accessing operation is locked, and release after operation is finished, to guarantee the consistance of data when shared data is visited in multi-process.
Memory management module is used to manage the shared drive of preserving memory database.
The present invention has following beneficial effect:
1, the present invention can realize multi-process access memory database simultaneously, can improve the performance of the concurrent inquiry of memory database greatly.
2, the present invention can realize the memory database of dynamic memory management, so just can guarantee the elasticity of memory database, and memory database can be used on various applied environments.
3, the present invention can realize the memory database of direct accessing data, and application data can be managed concentratedly by memory database, with respect to the mode of using the Decentralization data, only has very little performance loss simultaneously.
Description of drawings
Fig. 1 is the synoptic diagram of multi-process visit shared drive;
Fig. 2 is the system interface synoptic diagram;
Fig. 3 is the building-block of logic of memory database system of the present invention;
Fig. 4 is the building-block of logic of T-tree index;
Fig. 5 is a memory management synoptic diagram of the present invention.
Embodiment
Shared drive is the mechanism of a kind of interprocess communication that is provided by UNIX operating system (IPC), and it allows two or more processes to share a given memory block.Data are put into the memory block, and different processes can direct access, need not carry out data between client-server and duplicate, so this is the fastest a kind of interprocess communication mode.The advantage of using the memory database of shared drive is a multi-process visit data simultaneously, and data are in shared drive, and the interface of visit data is in each process, as shown in Figure 1.
Semaphore is a kind of inter-process communication mechanisms in the UNIX operating system, and it is a counter, is used for the access of multi-process to sharing data objects.Semaphore is the technology of a kind of common inter process synchronization among the UNIX, in the present invention, it be used for to multi-process visit shared drive synchronously.
The method of realization shared drive database provided by the invention comprises:
Foundation step is used to create to supply the shared drive of multi-process visit, and memory database is stored in this shared drive;
The step that locks is used for described memory database and when the request of access of the process of receiving operation is locked, and makes between process the exclusive reference memory database to guarantee the consistance of data;
Execution in step is used for by data base management system (DBMS) data being carried out practical operation and being exported the result after operation locks;
The release step is used for behind the accessing operation of the process of executing removing the lock of this operation.
To locking with unlocking operation is to adopt semaphore to realize; Each lock realizes that with two semaphores one of them semaphore writes down the current enterable process number of reading, i.e. read signal amount, and another semaphore writes down the current number of passes amount of writing into, i.e. write signal amount.
As shown in Figure 2, memory database adopts the mode in storehouse to issue, and needs the process of access memory database only need link this storehouse when its program compilation in the system and gets final product.
For memory database, importantly can improve the performance of data query, the complexity that reduces processing procedure is to improve the method for performance, therefore, uses the memory database of Sharing Memory Realization that the definition of data and the query function of data can only be provided.Specifically comprise:
The definition of list structure: comprise the definition of field, field type, fields default value, major key, index etc.;
Data query: according to the field value query note;
The modification of data: comprise and insert record, amendment record, deletion record.
Consult shown in Figure 3ly, memory database comprises: interface module (IF), data definition language (DDL) execution module (DDL), data manipulation language (DML) execution module (DML), data dictionary module (DL), index module (INDEX), lock module (LOCK) and memory management module (MM).Each module is described in detail as follows:
1, interface (IF) module provides the interface to applications, comprising: the execution of DDL/DML and some other special purpose interface.Wherein DDL/DML adopts normal structure query language (SQL) statement interface.These SQL statement of IF module parses pass to DDL or DML module then.
In order to improve execution efficient, the IF module also provides special purpose interface for each operation (comprising: select, update, delete, insert, create table, drop table).
2, data definition language (DDL) execution module (DDL) is used for processing and builds table, deletes operations such as table and establishment index.
3, data manipulation language (DML) execution module (DML) is used for inquiry and retouching operation to data.
During DML resume module DML operation requests, at first call the LOCK module and carry out some synchronous processing of process, call the INDEX module then and revise or data query, the output form that at last Query Result is organized into standard is exported to applications.For inquiry (select), the information of output is exactly the record of inquiry; For inserting (insert), deletion (delete), upgrade (update), output is the data line that is affected in the result of operation and the database.
4, data dictionary module (DL) is used for the admin table structural information, comprises table name, field name, field type, fields default value, index or the like the information of table.List structure is placed on the specific regions in the shared drive, adopts the management of Hash table.
5, index module (INDEX) is used to organize data, and high performance data query and modification process are provided.Index is one of most important technology in the relevant database.
The present invention adopts the T-tree to carry out index.The T-tree is the most frequently used a kind of index that arrives in the database, as shown in Figure 4, T-tree is the two-way search tree of a kind of balance of proposing on the basis of balanced binary tree, can store code word on each node of T-tree more than one, can reduce binary tree and insert the balance number of times that deletion causes, it is a tree shorter more and stout than balanced binary tree.
If the code value number is 5 on each node, then the height of the T-tree of 1,000,000 code word compositions is [lg (220/5+1)=18], and promptly certain table record number is 1,000,000 o'clock, only needs 18 tree nodes of visit can find required record.
6, lock module (LOCK), the data consistency control when being used for multi-process visit shared data.Memory database is different from Universal Database, its main purpose is to support high performance data query and data modification, do not need to support the notion of affairs, therefore the target of lock be to guarantee to inquire about, the mutual exclusion between the retouching operation, can not read " dirty " data when guaranteeing inquiry, can not influence other modification process when guaranteeing to revise.
The granularity of lock is divided into table level and block level, also has some to be stored in the data structure of shared drive, such as Hash table, chained list etc., also needs to lock.
Because semaphore can discharge automatically in process death, so lock adopts semaphore to realize.Lock is divided into read lock and writes lock.Each lock is realized with two semaphores, one of them semaphore writes down currently enterablely to be read the process number (initial value is that maximum is read the process number, the back whenever enters one and reads process and then subtract 1), be called the read signal amount, another semaphore record is current to be write into the number of passes amount (initial value is 0, the back whenever enters one and writes process and then add 1), be called the write signal amount.
For read operation, whether at first judge the write signal amount greater than 0, if greater than 0, then wait for, otherwise, the read signal amount is subtracted 1, reading of data then reads and finishes, and the read signal amount is added 1;
For write operation, at first the write signal amount is added 1, judge then whether the read signal amount is that maximum is read the process number, if, then carry out write operation, after write operation is finished, the write signal amount is subtracted 1, and the read signal amount is changed to maximum process number.Because number of read operations will be far longer than number of write operations in the general application, when write operation enters, put earlier and write sign, the read operation that guarantees the back can not enter, write operation can begin to write process as long as wait for the process of the reading complete operation that the front has entered, and is unlikely to allow write operation wait for the too many time.
7, memory management module (MM) is used for shared drive inlet pipe reason is comprised the management of common memory section and the management of memory block.
A, shared drive segment management: shared drive is a kind of IPC of UNIX, shared drive by certain process creation after, other process only need be done a mapping, just can visit the data of this piece shared drive.
Memory management of the present invention can be managed the multistage shared drive.All common memory sections are numbered in the internal system unification, and a unique ID is arranged.Need the process of certain common memory section of visit can judge whether oneself has shone upon this common memory section, if not mapping, then the unique ID according to this common memory section does mapping, and record mapping back it at in-process first address.After this according to this first address, just can visit the data in this common memory section.If the common memory section of finding when visit is discharged by other process, then can remap.
Common memory section can dynamically be applied for according to data volume, can make full use of the memory source of system like this.
B, memory block management: as shown in Figure 5, all application heaps all are divided into equal-sized, and the data of all memory databases comprise index Index, record Row, and lock Lock, table Table structure etc. is all put into these memory blocks.
In order to discharge whole table data quickly, different table records uses different data blocks with index
On above-mentioned Basis of Database, realize that the method for shared drive database is: create to supply the shared drive of multi-process visit by server processes, and memory database is stored in this shared drive; When the request of access of memory database, operation is locked, make between process the exclusive reference memory database to guarantee the consistance of data in the process of receiving; After operation locks, data are carried out practical operation and exported the result by data base management system (DBMS); And the lock of behind the accessing operation of the process of executing, removing this operation.
Typically the operating process to memory database is described below:
Query script to memory database: application process is submitted query requests to by interface module (IF), interface module is converted to inner form with request, then this request is passed to the DML resume module, the DML module is at first called INDEX module searches recording address, call the LOCK module then and lock, call MM module reading and recording data at last, call the release of LOCK module again, at last data are returned to application process, the one query operation is promptly finished dealing with.To writing therewith in like manner of memory database.
The process of establishment table is: application process is submitted the table request (SQL) of creating to by interface (IF), interface is converted to inner form with request, then this request being passed to data language execution module (DDL) handles, DDL calls the DL module and deposits list structure in the Hash table, return saving result to interface module then, the result who by interface module process is shown in establishment at last returns to application.
The present invention makes full use of shared drive interprocess communication (IPC) function of UNIX, has realized following function:
1, immediate data access: the data of each process in can the direct access shared drive;
2, multi-process while access data: by the synchro control between process, the data in a plurality of processes access simultaneously shared drive;
3, jumbo, flexible data management: the common memory section size is configurable, and common memory section quantity can dynamically be adjusted in operational process.
The present invention has realized high performance, high flexible, as a to use memory database in several scenes, the memory database of especially can multi-process visiting simultaneously can satisfy the data access requirement of high concurrency.
Claims (10)
1, a kind of method that realizes the shared drive database is characterized in that this method comprises:
Foundation step is used to create to supply the shared drive of multi-process visit, and memory database is stored in this shared drive;
The step that locks is used for described memory database and when the request of access of the process of receiving operation is locked, and makes between process the exclusive reference memory database to guarantee the consistance of data;
Execution in step is used for by data base management system (DBMS) data being carried out practical operation and being exported the result after operation locks;
The release step is used for behind the accessing operation of the process of executing removing the lock of this operation.
2, the method for claim 1 is characterized in that, operation is locked and the realization of release employing semaphore; Each lock realizes that with two semaphores one of them semaphore writes down the current enterable process number of reading, i.e. read signal amount, and another semaphore writes down the current number of passes amount of writing into, i.e. write signal amount.
3, method as claimed in claim 2 is characterized in that, when described accessing operation is read operation, judges that whether the write signal amount is greater than 0 earlier; If then make read operation enter waiting status, otherwise, carry out read operation after the read signal amount subtracted 1, and after finishing read operation, the read signal amount is added 1.
4, method as claimed in claim 2 is characterized in that, when described accessing operation is write operation, earlier the write signal amount is added 1 back and judges whether the read signal amount is that maximum is read the process number; If then carry out write operation, and after write operation is finished, the write signal amount subtracted 1, otherwise make write operation enter waiting status.
5, as each described method of claim 1 to 4, it is characterized in that, described shared drive adopts a plurality of uniquely identified common memory section formations that have, process is shone upon the back common memory section at in-process first address according to described sign mapping common memory section and record, according to the data in this first address visit common memory section.
6, method as claimed in claim 5 is characterized in that, when process is found to visit then to shine upon again when common memory section has been released.
7, method as claimed in claim 5 is characterized in that, dynamically applies for common memory section quantity according to the data volume of memory database.
8, require 5 described methods as claim, it is characterized in that, common memory section is divided into equal-sized, all data of memory database are stored in these memory blocks.
9, require 1 described method as claim, it is characterized in that, adopt the form of T-tree to organize data and index data in the described memory database.
10, a kind of memory database system is used for for the multi-process visit; It is characterized in that comprising:
Interface module is used for providing access path to outside application process;
The data definition language (DDL) execution module is used for carrying out establishment table, delete list and establishment index operation according to the operational order of interface module output;
The data dictionary module is used for the order management list structure information according to the output of data definition language (DDL) execution module;
The data manipulation language (DML) execution module is used for carrying out according to the operational order of interface module output the reading and writing operation of data;
Index module is used for according to the operational order of data manipulation language (DML) execution module output data being carried out index;
Lock module is used for accessing operation is locked, and release after operation is finished, to guarantee the consistance of data when shared data is visited in multi-process.
Memory management module is used to manage the shared drive of preserving memory database.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100643248A CN100353325C (en) | 2004-08-23 | 2004-08-23 | Method for realing sharing internal stored data base and internal stored data base system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100643248A CN100353325C (en) | 2004-08-23 | 2004-08-23 | Method for realing sharing internal stored data base and internal stored data base system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1740978A CN1740978A (en) | 2006-03-01 |
| CN100353325C true CN100353325C (en) | 2007-12-05 |
Family
ID=36093380
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100643248A Active CN100353325C (en) | 2004-08-23 | 2004-08-23 | Method for realing sharing internal stored data base and internal stored data base system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100353325C (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011009274A1 (en) * | 2009-07-23 | 2011-01-27 | 中兴通讯股份有限公司 | Method and apparatus of concurrency control |
| CN109376165A (en) * | 2018-11-14 | 2019-02-22 | 深圳市金证科技股份有限公司 | The implementation method and device and computer readable storage medium of memory database lock |
Families Citing this family (45)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100365632C (en) * | 2006-04-05 | 2008-01-30 | 华为技术有限公司 | Processing method for realizing consistency of internal storage data and data bank data service |
| CN100416568C (en) * | 2006-09-14 | 2008-09-03 | 南京中兴软创软件有限公司 | Method for accelerating database searching speed |
| CN101082928B (en) * | 2007-06-25 | 2010-11-24 | 腾讯科技（深圳）有限公司 | Method for accessing database and data-base mapping system |
| CN101119363B (en) * | 2007-07-20 | 2011-02-16 | 联创科技(南京)有限公司 | United interface based memory database remote concurrent access and interface management method |
| CN101470627B (en) * | 2007-12-29 | 2011-06-08 | 北京天融信网络安全技术有限公司 | Method for implementing parallel multi-core configuration lock on MIPS platform |
| CN101382953B (en) * | 2008-09-19 | 2013-03-20 | 中兴通讯股份有限公司 | Interface system for accessing file system in user space and file reading and writing method |
| CN101937387B (en) * | 2009-06-30 | 2013-04-17 | 中国电信股份有限公司 | Method and system for generating test parameters |
| CN102004743B (en) * | 2009-09-02 | 2013-08-14 | 中国银联股份有限公司 | System and method for copying data among heterogeneous databases |
| CN101650646B (en) * | 2009-09-22 | 2012-02-08 | 杭州华三通信技术有限公司 | Method and device for realizing shared data consistency |
| CN102156700A (en) * | 2010-02-12 | 2011-08-17 | 华为技术有限公司 | Database accessing method and device and system |
| CN101901250A (en) * | 2010-06-08 | 2010-12-01 | 中兴通讯股份有限公司 | Memory database and data processing method thereof |
| CN102279885A (en) * | 2011-08-16 | 2011-12-14 | 中兴通讯股份有限公司 | Method and device for operating data by memory database |
| CN102385526A (en) * | 2011-11-16 | 2012-03-21 | 深圳市大赢家网络有限公司 | Method and device for sharing stock data among multiple processes |
| CN102693162A (en) * | 2011-12-29 | 2012-09-26 | 中国科学技术大学苏州研究院 | Method for process communication among multiple virtual machines on multi-core platform based on shared memory and intercore interruption |
| CN102693159B (en) * | 2012-05-09 | 2015-07-01 | 上海晨思电子科技有限公司 | Method and device for controlling hardware equipment based on user mode multitask |
| CN103514164B (en) * | 2012-06-15 | 2016-12-21 | 阿里巴巴集团控股有限公司 | Data migration method and system |
| CN102750187B (en) * | 2012-07-11 | 2015-11-25 | 北京联嘉众赢网络技术有限公司 | A kind of striding course exchange method and device |
| CN102880704A (en) * | 2012-09-25 | 2013-01-16 | 上海证券交易所 | Novel concurrent memory data organization and access method |
| CN103064748A (en) * | 2013-01-05 | 2013-04-24 | 浪潮电子信息产业股份有限公司 | Method for processing communication among multiple processes in Linux system |
| CN103198122B (en) * | 2013-04-02 | 2017-09-29 | 华为技术有限公司 | Restart the method and apparatus of memory database |
| CN104636260B (en) * | 2013-11-06 | 2018-03-06 | 深圳市风景智联科技有限公司 | A kind of data managing method and system for call charge service |
| CN104978278B (en) * | 2014-04-14 | 2020-05-29 | 创新先进技术有限公司 | Data processing method and device |
| CN104021145B (en) | 2014-05-16 | 2018-03-06 | 华为技术有限公司 | The method and apparatus that a kind of mixed service concurrently accesses |
| CN104021355B (en) * | 2014-06-20 | 2017-03-29 | 浪潮电子信息产业股份有限公司 | A kind of multi-process operates the security method menu of same file simultaneously |
| CN105468635B (en) * | 2014-09-09 | 2019-02-15 | 上海机电工程研究所 | A kind of target property real-time data base and its application method |
| CN104933196B (en) * | 2015-07-13 | 2019-06-21 | 上海斐讯数据通信技术有限公司 | Data base management method and system in a kind of embedded system |
| CN105389226B (en) * | 2015-10-23 | 2018-07-13 | 上海斐讯数据通信技术有限公司 | A kind of system and method accessing shared drive exception |
| CN107643942B (en) * | 2016-07-21 | 2020-11-03 | 杭州海康威视数字技术股份有限公司 | State information storage method and device |
| CN107704325B (en) * | 2016-08-08 | 2021-08-27 | 北京百度网讯科技有限公司 | Method and device for transmitting messages between processes |
| CN108062252B (en) * | 2016-11-08 | 2022-02-01 | 斑马智行网络(香港)有限公司 | Information interaction method, object management method, device and system |
| CN106648939A (en) * | 2016-12-30 | 2017-05-10 | 上海寰视网络科技有限公司 | Method and equipment for inter-process resource sharing |
| CN108287835B (en) * | 2017-01-09 | 2022-06-21 | 腾讯科技（深圳）有限公司 | Data cleaning method and device |
| CN107391278A (en) * | 2017-07-25 | 2017-11-24 | 郑州云海信息技术有限公司 | A kind of front and back end communication means based on shared drive |
| CN108021339B (en) * | 2017-11-03 | 2021-05-04 | 网宿科技股份有限公司 | Method and device for reading and writing magnetic disk and computer readable storage medium |
| CN108052569A (en) * | 2017-12-07 | 2018-05-18 | 深圳市康必达控制技术有限公司 | Data bank access method, device, computer readable storage medium and computing device |
| CN110022341B (en) * | 2018-01-10 | 2022-01-25 | 腾讯科技（深圳）有限公司 | Data transmission method and related equipment |
| CN109032798B (en) * | 2018-07-25 | 2022-03-18 | 天津凯发电气股份有限公司 | Control method for shared memory lock of power quality management system |
| CN109032817B (en) * | 2018-07-25 | 2022-03-18 | 天津凯发电气股份有限公司 | Method for realizing shared memory of power quality management system |
| CN110888939A (en) * | 2018-09-06 | 2020-03-17 | 北京京东尚科信息技术有限公司 | Data management method and device |
| CN110058947B (en) * | 2019-04-26 | 2021-04-23 | 海光信息技术股份有限公司 | Exclusive release method of cache space and related device |
| CN110618883B (en) * | 2019-09-26 | 2022-09-13 | 迈普通信技术股份有限公司 | Method, device, equipment and storage medium for sharing memory linked list |
| CN112632031A (en) * | 2020-12-08 | 2021-04-09 | 北京思特奇信息技术股份有限公司 | Method and system for realizing long connection use of distributed memory database, electronic device and storage medium |
| CN113157692B (en) * | 2021-02-07 | 2023-10-27 | 上海万得宏汇信息技术有限公司 | Relational memory database system |
| CN114357046A (en) * | 2021-12-31 | 2022-04-15 | 深圳市兆珑科技有限公司 | Access method, device, system, server and storage medium of memory database |
| CN114996244B (en) * | 2022-07-18 | 2022-10-28 | 北京博华信智科技股份有限公司 | Control method, device and equipment of real-time database system and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1262481A (en) * | 1999-01-27 | 2000-08-09 | 电话通有限公司 | Method and device for synchronizing multiple data base |
| CN1319203A (en) * | 1998-07-22 | 2001-10-24 | 艾利森电话股份有限公司 | Method relating to handling of transactions in databases |
| CN1357836A (en) * | 2000-12-07 | 2002-07-10 | 华为技术有限公司 | Method of raising message processing capacity of short message dispatching center |
| WO2003003256A2 (en) * | 2001-06-29 | 2003-01-09 | Trendium, Inc. | System, method and computer program product for storing data in a databa using a multi-thread shared memory message queue buffer |
| US6560601B1 (en) * | 1998-01-22 | 2003-05-06 | Telefonaktiebolaget Lm Ericsson (Publ) | Database transaction with locking in two phases and multiple versions of objects |
| US6636901B2 (en) * | 1998-01-30 | 2003-10-21 | Object Technology Licensing Corp. | Object-oriented resource lock and entry register |
-
2004
- 2004-08-23 CN CNB2004100643248A patent/CN100353325C/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6560601B1 (en) * | 1998-01-22 | 2003-05-06 | Telefonaktiebolaget Lm Ericsson (Publ) | Database transaction with locking in two phases and multiple versions of objects |
| US6636901B2 (en) * | 1998-01-30 | 2003-10-21 | Object Technology Licensing Corp. | Object-oriented resource lock and entry register |
| CN1319203A (en) * | 1998-07-22 | 2001-10-24 | 艾利森电话股份有限公司 | Method relating to handling of transactions in databases |
| CN1262481A (en) * | 1999-01-27 | 2000-08-09 | 电话通有限公司 | Method and device for synchronizing multiple data base |
| CN1357836A (en) * | 2000-12-07 | 2002-07-10 | 华为技术有限公司 | Method of raising message processing capacity of short message dispatching center |
| WO2003003256A2 (en) * | 2001-06-29 | 2003-01-09 | Trendium, Inc. | System, method and computer program product for storing data in a databa using a multi-thread shared memory message queue buffer |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011009274A1 (en) * | 2009-07-23 | 2011-01-27 | 中兴通讯股份有限公司 | Method and apparatus of concurrency control |
| CN109376165A (en) * | 2018-11-14 | 2019-02-22 | 深圳市金证科技股份有限公司 | The implementation method and device and computer readable storage medium of memory database lock |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1740978A (en) | 2006-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100353325C (en) | Method for realing sharing internal stored data base and internal stored data base system | |
| US11119997B2 (en) | Lock-free hash indexing | |
| US6240422B1 (en) | Object to relational database mapping infrastructure in a customer care and billing system | |
| Banerjee et al. | DBC—A database computer for very large databases | |
| KR102177190B1 (en) | Managing data with flexible schema | |
| Härder et al. | PRIMA: A DBMS prototype supporting engineering applications | |
| US5829006A (en) | System and method for efficient relational query generation and tuple-to-object translation in an object-relational gateway supporting class inheritance | |
| US6009432A (en) | Value-instance-connectivity computer-implemented database | |
| US7243088B2 (en) | Database management system with efficient version control | |
| US20210224235A1 (en) | Parallel and efficient technique for building and maintaining a main memory csr based graph index in a rdbms | |
| US7376658B1 (en) | Managing cross-store relationships to data objects | |
| CN100367239C (en) | Cache-conscious concurrency control scheme for database systems | |
| US20050102255A1 (en) | Computer-implemented system and method for handling stored data | |
| CN109144994A (en) | Index updating method, system and relevant apparatus | |
| US20080091691A1 (en) | Datebase Device, Database Management Method, Data Structure Of Database, Database Management Program, And Computer-Readable Storage Medium Storing Same Program | |
| US20090177622A1 (en) | Method and system for speeding up rebuild of user-defined indexes during partition maintenance operations in the database systems | |
| WO2005062206A2 (en) | Extended database engine providing versioning and caching of derived data | |
| JP2002519765A (en) | High-speed storage resident processing method and processing system for transaction data | |
| US6941309B2 (en) | Object integrated management system | |
| EP1934700A2 (en) | Database heap management system with variable page size and fixed instruction set address resolution | |
| CN102163232A (en) | SQL (Structured Query Language) interface implementing method supporting IEC61850 object query | |
| CN107977446A (en) | A kind of memory grid data load method based on data partition | |
| CN109690522A (en) | A kind of data-updating method, device and storage device based on B+ tree index | |
| US20070112865A1 (en) | Enforcing constraints from a parent table to a child table | |
| US7310719B2 (en) | Memory management tile optimization |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |