CN102508872A - Data processing method and system of online processing system based on memory - Google Patents
Data processing method and system of online processing system based on memory Download PDFInfo
- Publication number
- CN102508872A CN102508872A CN2011103085402A CN201110308540A CN102508872A CN 102508872 A CN102508872 A CN 102508872A CN 2011103085402 A CN2011103085402 A CN 2011103085402A CN 201110308540 A CN201110308540 A CN 201110308540A CN 102508872 A CN102508872 A CN 102508872A
- Authority
- CN
- China
- Prior art keywords
- user
- data
- service request
- internal memory
- lock
- 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.)
- Pending
Links
Images
Abstract
The invention relates to the field of data processing and in particular relates to a data processing method in an online processing system based on a memory. The method comprises the following steps: classifying and storing data in the memory according to users; receiving a service request which comprises a user identification; searching the corresponding user according to the user identification, carrying out locking operation on the user; processing the data of the user, after finishing the processing, unlocking the user. The method of classifying and respectively storing the data according to the users, provided by the application, can be used for greatly reducing the search range so as to improve the search performance of the system. Since the mechanism of the lock is based on the users, different user service requests are generally free from the competition relation, thereby greatly improving the concurrency capability. On the other hand, the lock of only one user is required when one service request is processed, thus the possibility of deadlock is reduced.
Description
Technical field
The application relates to data processing field, particularly relates to a kind of data processing method and system of the on-line processing system based on internal memory.
Background technology
Present security, futures business system are because the in-line processing mode is adopted in requirements such as real-time, batch processing mostly.In-line processing is claimed online treatment again, is the directly input system from the generation place of a kind of information, and result directly is sent to the processing mode of destination.In-line processing can provide query processing, data aggregation and distribution processor, information stores to transmit functions such as processing, makes data processing more efficient, convenient.
General on-line processing system adopts relational database to realize, like Oracle, MSSQL, DB2 etc.In the on-line processing system based on relational database, data are classified according to business, leave in respectively in the different tables, carry out association with field between each table.For example user's business datum can be divided into fund, holds position, order, conclusion of the business etc., leaves in respectively in the corresponding table, and the homogeneous data of different user all is placed in the identical table.SQL (SQL, Structured Query Language) is generally adopted in the visit of data, and the concurrent visit of data is all controlled by Database Systems.In this on-line processing system,, created a kind of mechanism of lock for integrality and the consistance that guarantees data.For example, attempt to visit simultaneously, when revising same data, at this moment collision problem can occur as a plurality of users.Locking is the common method that solves concurrent visit data.During concrete the realization; In order to control visit to data, can affairs during to the data executable operations his-and-hers watches lock, to repel the visit of other affairs; To guarantee that affairs do not receive other affairs during handling influence is (usually in database; Affairs are a base unit, and for example, a db transaction can be a write operation of revising a user's account).In database, the mechanism of lock generally has row lock, page or leaf lock, table lock etc. from small to large.
In realizing process of the present invention; The inventor finds to have following problem in the prior art at least: for the on-line processing system based on database; Because user's data stores classifiedly according to business, when handling the service request of different user, often need visit identical table; At this moment can produce the competition of lock, cause concurrent limited ability.On the other hand, when two service request from user during by parallel processing, if the order that locks is improper, two service request cause two requests all can not be processed down all in the resources of waiting for that the other side has occupied, therefore can cause the appearance of deadlock situation.Again on the one hand, when a plurality of subservice request of handling same user, need carry out associative search to different tables; When the record number of table increases; Table associative search data also need expend more time, cause the system handles performance to descend, and can not satisfy the requirement of real-time.
Summary of the invention
For solving the problems of the technologies described above, the application embodiment provides a kind of data processing method and system of the on-line processing system based on internal memory, to improve the concurrent processing ability to data, has reduced the probability of happening of deadlock.
Technical scheme is following:
The application embodiment discloses a kind of based on processing method of data in the on-line processing system of internal memory, and said method comprises:
Data are stored classifiedly in internal memory according to the user;
Receive service request, said service request includes ID;
Search corresponding user according to said ID, said user's execution is added latching operation;
Said user's data is handled, when finishing dealing with, said user is carried out unlocking operation.
Preferably, said said user is carried out adds the realization of latching operation employing mutex, and the state that mutex is set is used to represent that the user is in locking state or released state.
Preferably, said method further comprises:
Before said user's execution is added latching operation, judge whether said user is in locking state, if carry out and wait for operation; If, do not carry out and add latching operation.
Preferably, said method further comprises:
When a plurality of service request added latching operation to same user's request, the service request of request was carried out and is added latching operation at first, and other service request are in waiting status, discharged until said service request of asking at first to add latching operation.
Preferably, said said user is carried out adds latching operation and adopts Read-Write Locks to realize, the state that Read-Write Locks is set is locking state or a locking state not under locking state or the WriteMode under the reading mode.
Preferably, said data are stored classifiedly in internal memory according to the user is specially:
Calculate the active degree of user data, the data that active degree is high store classifiedly in internal memory according to the user, and the data that active degree is low store classifiedly in memory device according to the user.
Preferably, said method further comprises:
For each user distributes an ID, preserve the corresponding relation of said user and ID, according to the corresponding relation of said user and ID, search, visit said user's data.
Preferably, said on-line processing system based on internal memory is organized data according to the form of data tree.
The application embodiment also discloses a kind of on-line processing system based on internal memory, and said system comprises:
Storage unit is used for data are stored classifiedly at internal memory according to the user;
Receiving element is used to receive service request, and said service request includes ID;
Add lock unit, be used for searching corresponding user, said user's execution is added latching operation according to said ID;
Separate lock unit, be used for said user's data is handled, when finishing dealing with, said user is carried out unlocking operation.
Preferably, said system further comprises:
Preferably, said storage unit specifically comprises:
First storage unit is used for the data that active degree is high and stores classifiedly at internal memory according to the user;
Second storage unit is used for the data that active degree is low and stores classifiedly at memory device according to the user.
The data processing method of a kind of on-line processing system based on internal memory that the application embodiment provides; Its beneficial effect that can reach is: the embodiment of the invention provide based on the on-line processing system of internal memory in the processing method of data; Changed database in the past and stored classifiedly the organizational form of data according to business, but according to user's store data respectively of classifying.The location mode of this data has reduced range of search greatly, thereby has improved the retrieval performance of system.On the other hand, aspect lock machine-processed, each user has a lock, in order to control to the visit of its data.Because lock is based on the user's, generally there is not competitive relation in the service request of different user, thereby has increased substantially concurrent ability.On the other hand, when handling a service request, general needs a user's lock, thereby has reduced the possibility of deadlock.
Description of drawings
In order to be illustrated more clearly in the application embodiment or technical scheme of the prior art; To do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below; Obviously, the accompanying drawing in describing below only is some embodiment that put down in writing among the application, for those of ordinary skills; Under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
The data processing method first embodiment process flow diagram that Fig. 1 provides for the application;
The data processing method second embodiment process flow diagram that Fig. 2 provides for the application;
Fig. 3 is the application embodiment data organization mode synoptic diagram;
The on-line processing system synoptic diagram that Fig. 4 provides for the application.
Embodiment
The application embodiment provides a kind of data processing method and system of the on-line processing system based on internal memory, improves the concurrent processing ability to data, has reduced the probability of happening of deadlock.
In order to make those skilled in the art person understand the technical scheme among the application better; To combine the accompanying drawing among the application embodiment below; Technical scheme among the application embodiment is carried out clear, intactly description; Obviously, described embodiment only is the application's part embodiment, rather than whole embodiment.Based on the embodiment among the application, those of ordinary skills are not making the every other embodiment that is obtained under the creative work prerequisite, all should belong to the scope of the application's protection.
At first describe based on processing method of data in the on-line processing system of internal memory the application is a kind of.
General on-line processing system adopts relational database to realize, like Oracle, MSSQL, DB2 etc.In the prior art,, user's Various types of data is divided according to business, leave in respectively in the different tables based on the on-line processing system of database.For example user's business datum can be divided into fund, holds position, order, conclusion of the business etc., leaves in respectively in the corresponding table, and the homogeneous data of different user all is placed in the identical table.Carry out association with field between each table.SQL SQL is generally adopted in the visit of data.
Shown in table 1, table 2, table 3, be the design of the table of general Database Systems.
Table 1 subscriber's meter synoptic diagram
| ID | Other non-key fields |
| ID?1 | |
| ...... | |
| ID?N |
As shown in table 2, show the location mode of user related data A:
Table 2A class user data location mode synoptic diagram
| ID | Concrete data field |
| ID?1 | A-1 |
| ...... | ...... |
| ID?N | A-N |
As shown in table 3, show the location mode of user related data B:
Table 3B class user data location mode synoptic diagram
| ID | Concrete data field |
| ID?1 | B-1-1 |
| ID?1 | B-1-2 |
| ID?1 | B-1-3 |
| ID?2 | B-2-1 |
| ID?2 | B-2-2 |
| ...... | |
| ID?N | B-N-1 |
| ...... |
| ID?N | B-N-m |
Can find out from table 2 and table 3; In this deposit data mode based on relational database; Be to classify deposit data in different tables according to business, the homogeneous data of different user all is placed in the identical table, uses field to carry out association between each table.Relational database uses the SQL service data, carries out association through critical fielies such as ID, uses row lock, page or leaf lock, table lock etc. by Database Systems by situation.
For on-line processing system based on database, because user's data stores classifiedly according to business, when handling different service request from user, often need visit identical table, at this moment can produce the competition of lock, cause concurrent limited ability.On the other hand, when two service request from user during by parallel processing, if the order that locks is improper, two service request cause two requests all can not be processed down all in the resources of waiting for that the other side has occupied, therefore can cause the appearance of deadlock situation.Again on the one hand, when a plurality of subservice request of handling same user, need carry out associative search to different tables; Along with increasing of table record number in the database; Retrieval, access associated data also need expend more time, bring huge system overhead, can not satisfy the requirement of real-time.
In order to reduce the time overhead that retrieval, access associated data bring; The application provides the on-line processing system based on internal memory; This system use internal memory is deposited, management data; Changed database (for example relational database, memory database) in the past and stored classifiedly the organizational form of data according to business, but according to user's store data respectively of classifying.The location mode of this data has reduced range of search greatly, thereby has improved the retrieval performance of system.On the other hand, aspect lock machine-processed, each user has a lock, in order to control to the visit of its data.Because lock is based on the user's, generally there is not competitive relation in the service request of different user, thereby has increased substantially concurrent ability.Again on the one hand, when handling a service request, general needs a user's lock, thereby has reduced the possibility of deadlock.Through adopting said method, the final system that realizes generally can be faster more than 10 times than the speed that adopts traditional database.
Referring to Fig. 1, the data processing method first embodiment process flow diagram that provides for the application.
A kind of based on processing method of data in the on-line processing system of internal memory, said method comprises:
S101 stores classifiedly data in internal memory according to the user.
S102 receives service request, and said service request includes ID.
S103 searches corresponding user according to said ID, said user is carried out add latching operation.
S104 handles said user's data, when finishing dealing with, said user is carried out unlocking operation.
Below in conjunction with accompanying drawing the application embodiment is carried out detailed explanation.
Referring to Fig. 2, the data processing method second embodiment process flow diagram that provides for the application.
S201 carries out classification and storage with data in internal memory according to the user.
In embodiments of the present invention, changed traditional database and carried out the mode of classification and storage data, but data have been stored classifiedly in internal memory according to the user according to business.
Preferably, each user has a data tree, and is relatively independent between each user.Concrete, for distributing an ID, each user distinguishes, preserve the corresponding relation of user and ID.Each user's data by professional level, is associated in together with pointer step by step, forms a data tree.
As shown in Figure 3, be the organizational form synoptic diagram of the application embodiment data.In Fig. 3, ID1, the corresponding ID of ID2......IDN representative of consumer, A, B represent the different service classification respectively.In a user's data tree, user's sign can be used as root node and is used to distinguish the user, and the data of its each class of service can be used as subtree, and successively downward according to professional level, form a data tree.Can form association with pointer between each node, be convenient to inquiry.
Because in the method that the embodiment of the invention provides; Data store classifiedly according to the user, because the data of institute's requesting query often belong to same user in user's the different business request, therefore when retrieval, data query; Can in a user's data tree, search; Reduce range of search greatly, thereby promoted the retrieval performance and the treatment effeciency of system, satisfied the real-time requirement of on-line processing system.And in traditional relational database; Because data store classifiedly according to business, the data of a plurality of service request inquiries often belong to same user, and this user's data leaves in the different service table; Often need inquire about a plurality of traffic table; The query context of data is big, efficient is low, can not satisfy the real-time requirement of on-line processing system, and method provided by the invention has solved this problem well.
Preferably, in another embodiment provided by the invention, data can all not leave in the internal memory, can as required partial data be stored in the memory device.Because the capacity of internal memory is limited, and for example security, futures business system this type on-line processing system, data volume is very big, therefore can partial data be left in other memory devices, for example hard disk etc.Preferably, calculate the active degree of user data, the data that active degree is high store classifiedly in internal memory according to the user, and the data that active degree is low store classifiedly in memory device according to the user.Like this, can be according to the active degree of user data, the user data that part is not often used leaves in the middle of other memory devices, to reduce the demand to internal memory.Concrete, can timing ratio than user data by access times, the user data that access times are lower is transferred in the middle of other memory devices from internal memory.When needs visit not during the data in internal memory, said data load stored in the internal memory get final product.
S202 receives service request, and said service request comprises ID.
Receive service request from user, comprised ID in the said service request.The form of said service request can be a communication message, and concrete structure can be formulated as required, and the application does not limit.In said service request, comprise ID, system can be according to the user of the attribution data of said ID differentiated service request institute requesting query.
S203 searches corresponding user according to said ID.
According to the user of ID in the said service request and preservation and the corresponding relation of ID, in internal memory, search the position of the user's data tree corresponding with ID.
In another embodiment that the application provides, partial data is stored in the internal memory, and partial data is stored in the memory device.The data that require visit when service request are then searched corresponding user according to ID not in internal memory the time in memory device, user's data is loaded in the internal memory stores.
S204 adds latching operation to user's execution.
In the prior art, the mechanism of the lock of database is based on table, and operated by rotary motion has row lock, page or leaf lock, table lock, lock of a great variety, complicated.In the embodiment that the application provides, the mechanism of lock is based on the user, and each user has a lock.
Preferably, lock and to use mutex (mutex) to realize.When visit data, mutex is locked, after visit is accomplished, discharge the lock on the mutex.After mutex locked, any thread/process that other attempts once more mutex to be locked will get clogged and discharge this mutual exclusion lock up to current thread/process.If a plurality of thread/process blockings are arranged when discharging mutual exclusion lock; But all obstruction thread/processes on this mutual exclusion lock all can become running status; First thread/process that becomes running status can lock to mutex; Other thread/process it will be appreciated that mutual exclusion lock still is lockable, and it is available to go back to wait for once more that it becomes again.In this case, have only a thread/process to carry out forward at every turn.
In the embodiment that the application provides, concrete, can in internal memory mutex of each user applies, mutex inside has comprised sign, is used to represent that the state of mutex is in (lock) state that locks or released state (unlock).For example, when first service request requires the data of calling party, after the reception service request, the user is added latching operation.If mutex is in the lock state when being locking state, other service request can get into wait, must wait until that it is released state that mutex is in the unlock state, just can lock successfully, withdraw from wait.
Preferably; Require same user's request is added latching operation as a plurality of service request, have only a service request of request at first can lock successfully, other service request then can be waited in line; Up to that service request release of front, next service request can lock successfully.
In another embodiment provided by the invention, lock and to use Read-Write Locks to realize.Same, the mechanism of lock also is based on the user, and each user has a lock.For Read-Write Locks is provided with three kinds of states: locking state under locking state, the WriteMode under the reading mode, locking state not.In the embodiment that the application provides, once have only a service request can occupy the Read-Write Locks of WriteMode, but the Read-Write Locks that a plurality of service request can be occupied reading mode simultaneously.In Read-Write Locks is when writing locking state, and before this lock was unlocked, all service request of attempting that this lock is locked all can get clogged and promptly be in waiting status.
Preferably; When Read-Write Locks when reading locking state; All attempt can obtain access right with reading mode to the service request that it locks, if still service request hopes with WriteMode this lock to be locked, it must block up to all service request release read locks.When Read-Write Locks was in the reading mode locking-in state, if there is other service request to attempt to lock with WriteMode, Read-Write Locks can be blocked reading mode lock request subsequently usually.Can avoid the reading mode lock to take for a long time like this, and the request of the WriteMode of waiting for lock is not being met always.
When Read-Write Locks in WriteMode following time, the data structure that it is protected just can be revised safely, because currently have only a service request can under WriteMode, have this lock.When Read-Write Locks in read states following time, as long as service request has been obtained the Read-Write Locks the reading mode under, the user data that this lock is protected can be read by the service request that a plurality of acquisition reading modes are locked.
S205 handles user's data.
Service request locks after the success, promptly can carry out concrete operation to user's data.For example to this user's data conduct interviews, search, delete, operation such as modification.When service request locks success to the user after, find the root node of data tree, then can use pointer all data in the data tree of calling party step by step.Certainly, also can conduct interviews through other modes except that pointer.
S206, when finishing dealing with, this user of release.
After the practical operation of accomplishing data, i.e. this user of release, release is added in the lock on the user, and user's lock is set to the unlock state.Like this, other service request just can add latching operation to the user in order, the data in the data tree of calling party.
In the locking mechanisms that the application embodiment provides, lock is based on the user, and each user has a lock, has reduced the collision probability of lock, has improved the performance of system.On the other hand, simplify the kind of lock, reduced the possibility of deadlock.
Referring to Fig. 4, be the on-line processing system synoptic diagram of the embodiment of the invention based on internal memory.
The application embodiment discloses a kind of on-line processing system based on internal memory, and said system comprises:
Receiving element 402 is used to receive service request, and said service request includes ID.
Add lock unit 403, be used for searching corresponding user, said user's execution is added latching operation according to said ID.
In the embodiment that the application provides, can all data be stored classifiedly in internal memory according to the user, also can a part leave in the internal memory, a part is stored in the memory device except that internal memory.
Preferably, said storage unit specifically comprises:
First storage unit is used for the data that active degree is high and stores classifiedly at internal memory according to the user;
Second storage unit is used for the data that active degree is low and stores classifiedly at memory device according to the user.
Further, said system can further include:
Loading unit is used for data load to the first storage unit with second storage unit.When the data of second storage unit in the internal memory are not left in needs visits in, can be convenient to visit with in the data load of second storage unit first storage unit in the internal memory.
Concrete, said system can also comprise:
Allocation units are used to each user and distribute an ID, preserve the corresponding relation of said user and ID.
The application can describe in the general context of the computer executable instructions of being carried out by computing machine, for example program module.Usually, program module comprises the routine carrying out particular task or realize particular abstract, program, object, assembly, data structure or the like.Also can in DCE, put into practice the application, in these DCEs, by through communication network connected teleprocessing equipment execute the task.In DCE, program module can be arranged in this locality and the remote computer storage medium that comprises memory device.
The above only is the application's a embodiment; Should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the application's principle; Can also make some improvement and retouching, these improvement and retouching also should be regarded as the application's protection domain.
Claims (10)
1. the data processing method based on the on-line processing system of internal memory is characterized in that, said method comprises:
Data are stored classifiedly in internal memory according to the user;
Receive service request, said service request includes ID;
Search corresponding user according to said ID, said user's execution is added latching operation;
Said user's data is handled, when finishing dealing with, said user is carried out unlocking operation.
2. method according to claim 1 is characterized in that, said said user is carried out adds the realization of latching operation employing mutex, and the state that mutex is set is used to represent that the user is in locking state or released state.
3. method according to claim 2 is characterized in that, said method further comprises:
Before said user's execution is added latching operation, judge whether said user is in locking state, if carry out and wait for operation; If, do not carry out and add latching operation.
4. method according to claim 2 is characterized in that, said method further comprises:
When a plurality of service request added latching operation to same user's request, the service request of request was carried out and is added latching operation at first, and other service request are in waiting status, discharged until said service request of asking at first to add latching operation.
5. method according to claim 1 is characterized in that, said said user is carried out adds latching operation and adopt Read-Write Locks to realize, the state that Read-Write Locks is set is locking state or a locking state not under locking state or the WriteMode under the reading mode.
6. method according to claim 1 is characterized in that, said data are stored classifiedly in internal memory according to the user is specially:
Calculate the active degree of user data, the data that active degree is high store classifiedly in internal memory according to the user, and the data that active degree is low store classifiedly in memory device according to the user.
7. method according to claim 1 is characterized in that, said method further comprises:
For each user distributes an ID, preserve the corresponding relation of said user and ID, according to the corresponding relation of said user and ID, search, visit said user's data.
8. method according to claim 1 is characterized in that, said on-line processing system based on internal memory is organized data according to the form of data tree.
9. the on-line processing system based on internal memory is characterized in that, said system comprises:
Storage unit is used for data are stored classifiedly at internal memory according to the user;
Receiving element is used to receive service request, and said service request includes ID;
Add lock unit, be used for searching corresponding user, said user's execution is added latching operation according to said ID;
Separate lock unit, be used for said user's data is handled, when finishing dealing with, said user is carried out unlocking operation.
10. system according to claim 9 is characterized in that, said storage unit specifically comprises:
First storage unit is used for the data that active degree is high and stores classifiedly at internal memory according to the user;
Second storage unit is used for the data that active degree is low and stores classifiedly at memory device according to the user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103085402A CN102508872A (en) | 2011-10-12 | 2011-10-12 | Data processing method and system of online processing system based on memory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103085402A CN102508872A (en) | 2011-10-12 | 2011-10-12 | Data processing method and system of online processing system based on memory |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102508872A true CN102508872A (en) | 2012-06-20 |
Family
ID=46220958
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011103085402A Pending CN102508872A (en) | 2011-10-12 | 2011-10-12 | Data processing method and system of online processing system based on memory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102508872A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103634347A (en) * | 2012-08-24 | 2014-03-12 | 腾讯科技（深圳）有限公司 | Parallel service processing method, device and system |
| CN104008133A (en) * | 2014-05-06 | 2014-08-27 | 烽火通信科技股份有限公司 | Row-level locking set achieving device and method based on collision detecting |
| WO2016101115A1 (en) * | 2014-12-23 | 2016-06-30 | 华为技术有限公司 | Resource scheduling method and related apparatus |
| CN106156334A (en) * | 2016-07-06 | 2016-11-23 | 益佳科技（北京）有限责任公司 | Internal storage data processing equipment and internal storage data processing method |
| CN106610865A (en) * | 2015-10-21 | 2017-05-03 | 阿里巴巴集团控股有限公司 | Data locking and unlocking method and apparatus |
| CN106844041A (en) * | 2016-12-29 | 2017-06-13 | 华为技术有限公司 | The method and internal storage management system of memory management |
| CN107292640A (en) * | 2016-03-30 | 2017-10-24 | 阿里巴巴集团控股有限公司 | Resource information processing method and device in many businessman's joint promotion activities |
| CN107301091A (en) * | 2016-04-14 | 2017-10-27 | 北京京东尚科信息技术有限公司 | Resource allocation methods and device |
| CN109542922A (en) * | 2018-11-29 | 2019-03-29 | 泰康保险集团股份有限公司 | For the processing method and related system of real-time service data |
| CN110297716A (en) * | 2019-05-29 | 2019-10-01 | 联动优势电子商务有限公司 | A kind of network trading method and device |
| CN110765143A (en) * | 2019-10-10 | 2020-02-07 | 腾讯科技（深圳）有限公司 | Data processing method, device, server and storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101499061A (en) * | 2008-01-30 | 2009-08-05 | 国际商业机器公司 | Multi-tenant oriented database engine and its data access method |
-
2011
- 2011-10-12 CN CN2011103085402A patent/CN102508872A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101499061A (en) * | 2008-01-30 | 2009-08-05 | 国际商业机器公司 | Multi-tenant oriented database engine and its data access method |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10310913B2 (en) | 2012-08-24 | 2019-06-04 | Tencent Technology (Shenzhen) Company Limited | Method, device and system for processing parallel services |
| CN103634347A (en) * | 2012-08-24 | 2014-03-12 | 腾讯科技（深圳）有限公司 | Parallel service processing method, device and system |
| CN104008133A (en) * | 2014-05-06 | 2014-08-27 | 烽火通信科技股份有限公司 | Row-level locking set achieving device and method based on collision detecting |
| CN104008133B (en) * | 2014-05-06 | 2017-08-01 | 烽火通信科技股份有限公司 | Device and method is realized in row level locking set based on collision detection |
| WO2016101115A1 (en) * | 2014-12-23 | 2016-06-30 | 华为技术有限公司 | Resource scheduling method and related apparatus |
| US11194623B2 (en) | 2014-12-23 | 2021-12-07 | Huawei Technologies Co., Ltd. | Resource scheduling method and related apparatus |
| US10430237B2 (en) | 2014-12-23 | 2019-10-01 | Huawei Technologies Co., Ltd. | Resource scheduling method and related apparatus |
| CN106610865A (en) * | 2015-10-21 | 2017-05-03 | 阿里巴巴集团控股有限公司 | Data locking and unlocking method and apparatus |
| CN107292640A (en) * | 2016-03-30 | 2017-10-24 | 阿里巴巴集团控股有限公司 | Resource information processing method and device in many businessman's joint promotion activities |
| CN107301091A (en) * | 2016-04-14 | 2017-10-27 | 北京京东尚科信息技术有限公司 | Resource allocation methods and device |
| CN106156334B (en) * | 2016-07-06 | 2019-11-22 | 益佳科技（北京）有限责任公司 | Internal storage data processing equipment and internal storage data processing method |
| CN106156334A (en) * | 2016-07-06 | 2016-11-23 | 益佳科技（北京）有限责任公司 | Internal storage data processing equipment and internal storage data processing method |
| CN106844041A (en) * | 2016-12-29 | 2017-06-13 | 华为技术有限公司 | The method and internal storage management system of memory management |
| CN106844041B (en) * | 2016-12-29 | 2020-06-16 | 华为技术有限公司 | Memory management method and memory management system |
| CN109542922A (en) * | 2018-11-29 | 2019-03-29 | 泰康保险集团股份有限公司 | For the processing method and related system of real-time service data |
| CN110297716A (en) * | 2019-05-29 | 2019-10-01 | 联动优势电子商务有限公司 | A kind of network trading method and device |
| CN110297716B (en) * | 2019-05-29 | 2021-10-01 | 联动优势电子商务有限公司 | Network transaction method and device |
| CN110765143A (en) * | 2019-10-10 | 2020-02-07 | 腾讯科技（深圳）有限公司 | Data processing method, device, server and storage medium |
| CN110765143B (en) * | 2019-10-10 | 2022-08-02 | 腾讯科技（深圳）有限公司 | Data processing method, device, server and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102508872A (en) | Data processing method and system of online processing system based on memory | |
| US20220188332A1 (en) | Distributed transaction database log with immediate reads and batched writes | |
| CN103426072B (en) | The order processing system of a kind of high concurrent competition stock and disposal route thereof | |
| CN106294190B (en) | Storage space management method and device | |
| KR101959153B1 (en) | System for efficient processing of transaction requests related to an account in a database | |
| CN103914399B (en) | Disk buffering method and device in a kind of concurrent computational system | |
| CN107977376A (en) | Distributed data base system and transaction methods | |
| US20120166447A1 (en) | Filtering queried data on data stores | |
| EP1808779B1 (en) | Bundling database | |
| CN102197395A (en) | Storage-side storage request management | |
| CN104751359A (en) | System and method for payment and settlement | |
| CN110383764A (en) | The system and method for usage history data processing event in serverless backup system | |
| CN103886109B (en) | Method and device for realizing row lock of database | |
| US9813490B2 (en) | Scheduled network communication for efficient re-partitioning of data | |
| US11698893B2 (en) | System and method for use of lock-less techniques with a multidimensional database | |
| CN110110006A (en) | Data managing method and Related product | |
| CN108717457B (en) | Electronic commerce platform big data processing method and system | |
| CN108900626A (en) | Date storage method, apparatus and system under a kind of cloud environment | |
| CN108628894A (en) | Data target querying method in data warehouse and device | |
| CN101354720B (en) | Distributed memory database data system and sharing method thereof | |
| CN104618304A (en) | Data processing method and data processing system | |
| US11726975B2 (en) | Auto unload | |
| CN104166661A (en) | Data storage system and method | |
| CN110119396A (en) | Data managing method and Related product | |
| US8700822B2 (en) | Parallel aggregation system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20120620 |