CN105426451A - Key value pair-based data processing method and system - Google Patents
Key value pair-based data processing method and system Download PDFInfo
- Publication number
- CN105426451A CN105426451A CN201510765510.2A CN201510765510A CN105426451A CN 105426451 A CN105426451 A CN 105426451A CN 201510765510 A CN201510765510 A CN 201510765510A CN 105426451 A CN105426451 A CN 105426451A
- Authority
- CN
- China
- Prior art keywords
- key
- node
- order
- module
- database
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a key value pair-based data processing method and system, and belongs to the technical field of data storage. The method comprises the following steps: receiving a database key command sent by a client through any node in a server cluster; calculating a Hash slot corresponding to a Key value carried in the database key command by the node, and judging whether the node is responsible of the Hash slot; if the judging result is positive, executing the database key command by the node; and if the judging result is negative, returning prompt information of a moved error to the client by the node to ensure that the client turns to a correct node in the server cluster according to the prompt information. According to the key value pair-based data processing method and system, open source databases Redis can utilize the multi-core advantage of processors and carry out concurrent processing, so that the processing performance of the databases is enhanced, the deployment of database examples is decreased and the burden of database management is lightened.
Description
Technical field
The invention belongs to technical field of data storage, particularly relate to a kind of data processing method based on key-value pair and system.
Background technology
PostgreSQL database Redis is a high performance key-value pair data storehouse, also non-relational database is claimed, it supports master-slave synchronisation, data can synchronous from server from master server to any amount, from server can be association other master servers from server, this makes Redis can perform individual layer tree copying.The appearance of PostgreSQL database Redis, largely compensate for the deficiency of relational data library storage, can play good supplementary function in part occasion to relevant database.Along with the rise of web2.0 website, internet, PostgreSQL database Redis has become an extremely popular frontier, and the development of non-relational database product is also very fast.But, the data processing method of current PostgreSQL database Redis is generally one process process, when receiving the operational order that client sends, the operational order that server end can only be sent by the mode process client of queue, the multinuclear advantage of processor cannot be utilized to carry out concurrent processing, and monokaryon processing power is limited, therefore make the data processing performance of PostgreSQL database Redis lower.In addition, at present when disposing database, due to the problem of individual data storehouse example performance bottleneck, generally need to dispose multiple database instance and just can reach service feature demand, so just need input a large amount of time and manpower to monitor and O&M database, add the burden of data base administration.
Summary of the invention
The object of the embodiment of the present invention is to provide a kind of data processing method based on key-value pair and system, the data processing performance being intended to solve above-mentioned PostgreSQL database Redis is lower, and need input a large amount of time and manpower to monitor and O&M database, add the problem of the burden of data base administration.
The embodiment of the present invention is achieved in that a kind of data processing method based on key-value pair, comprising:
Any node in server cluster receives the database key order that client sends;
The Hash groove corresponding to key value carried in database key order described in described node calculate, and judge whether described Hash groove is responsible for by oneself;
If so, then described node performs described database key order;
If not, then described node returns the information of moved mistake to described client, makes described client turn to node correct in described server cluster according to described information.
Described in the embodiment of the present invention based in the data processing method of key-value pair, any node in server cluster also comprises before receiving the database key order that client sends:
Multiple Hash grooves in described server cluster are assigned to respectively each node in described server cluster, and the assignment information of described multiple Hash groove is stored to each node in described server cluster.
Described in the embodiment of the present invention based in the data processing method of key-value pair, described information comprises the nodename that the Hash groove corresponding to described key value is assigned.
Described in the embodiment of the present invention based in the data processing method of key-value pair, the Hash groove corresponding to key value carried in database key order described in described node calculate specifically comprises:
Described node employing cluster use formula CRC16 (key) %16384 calculates the Hash groove corresponding to key value, and wherein, CRC16 (key) statement is for calculating the CRC16 School Affairs of key value.
Described in the embodiment of the present invention based in the data processing method of key-value pair, described database key order comprises get order, set order, del order and hget order.
Another object of the embodiment of the present invention is to provide a kind of data handling system based on key-value pair, comprise the receiver module, computing module, judge module, execution module and the reminding module that are positioned at server cluster interior joint inside, described receiver module, described computing module, described judge module and described execution module connect successively, described judge module is also connected with described reminding module, wherein:
Described receiver module, for receiving the database key order that client sends;
Described computing module, for calculating the Hash groove corresponding to the key value of carrying in described database key order;
Described judge module, for judging whether described Hash groove is responsible for by described node;
Described execution module, if for being responsible for by described node, then performs described database key order;
Described reminding module, for if not be responsible for by described node, then returns the information of moved mistake to described client, make described client turn to node correct in described server cluster according to described information.
Described in the embodiment of the present invention based in the data handling system of key-value pair, also comprise the distribution module that is connected with the node in described server cluster and be positioned at the memory module that described intra-node is connected with described distribution module and described judge module, wherein:
Described distribution module, for being assigned to each node in described server cluster respectively by the multiple Hash grooves in described server cluster;
Described memory module, for storing the assignment information of described multiple Hash groove.
Described in the embodiment of the present invention based in the data handling system of key-value pair, described information comprises the nodename that the Hash groove corresponding to described key value is assigned.
Described in the embodiment of the present invention based in the data handling system of key-value pair, described computing module specifically for:
Employing cluster use formula CRC16 (key) %16384 calculates the Hash groove corresponding to key value, and wherein, CRC16 (key) statement is for calculating the CRC16 School Affairs of key value.
Described in the embodiment of the present invention based in the data handling system of key-value pair, described database key order comprises get order, set order, del order and hget order.
The data processing method based on key-value pair that the enforcement embodiment of the present invention provides and system have following beneficial effect:
The database key order that by any node in server cluster received client transmission of the embodiment of the present invention owing to first adopting; Then the Hash groove corresponding to the key value of carrying in database key order described in described node calculate, and judge whether described Hash groove is responsible for by oneself; If so, then described node performs described database key order; If not, then described node returns the information of moved mistake to described client, described client is made to turn to node correct in described server cluster according to described information, thus make PostgreSQL database Redis that the multinuclear advantage of processor can be utilized to carry out concurrent processing, improve the handling property of database, make only to dispose a database instance and can reach service feature index, decrease the deployment of database instance, alleviate the burden of data base administration.
Accompanying drawing explanation
Fig. 1 is the specific implementation process flow diagram of the data processing method based on key-value pair that the embodiment of the present invention provides;
Fig. 2 is the structured flowchart of the data handling system based on key-value pair that the embodiment of the present invention provides.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
Fig. 1 shows the specific implementation flow process of the data processing method based on key-value pair that the embodiment of the present invention provides.Shown in Figure 1, a kind of data processing method based on key-value pair that the embodiment of the present invention provides, comprising:
In S101, any node in server cluster receives the database key order that client sends.
In embodiments of the present invention, any node in server cluster also comprises before receiving the database key order of client transmission: the multiple Hash grooves in described server cluster are assigned to respectively each node in described server cluster, and the assignment information of described multiple Hash groove is stored to each node in described server cluster.Further, each Hash groove in server cluster correspondence can only be assigned to a node, but each node all may correspond to is responsible for the multiple Hash groove of process.
In S102, the Hash groove corresponding to key value carried in database key order described in described node calculate, and judge whether described Hash groove is responsible for by oneself.
In embodiments of the present invention, include 16384 Hash grooves (hashslot) in the server cluster of database, each key value in database belongs to one of them of this 16384 Hash grooves.Described node is after the data key order receiving client transmission, can resolve described data key order, to obtain the key value of carrying in described data key order, then calculate the Hash groove corresponding to described key value, and judge whether described Hash groove is responsible for by oneself.
Wherein, the Hash groove corresponding to key value carried in database key order described in described node calculate specifically comprises: described node adopts cluster to use formula CRC16 (key) %16384 to calculate the Hash groove corresponding to key value, wherein, CRC16 (key) statement is for calculating the CRC16 School Affairs of key value.
Wherein, judge that whether described Hash groove is responsible for specifically comprising by oneself: search according to the assignment information of the multiple Hash grooves prestored in the Hash groove calculated and described node the nodename that the Hash groove corresponding to described key value is assigned, judge that whether described nodename is identical with the nodename that self stores, if identical, then illustrate that the Hash groove corresponding to described key value is responsible for by oneself; Otherwise the Hash groove corresponding to described key value is not responsible for by oneself.
In S103-1, if so, then described node performs described database key order.
In embodiments of the present invention, if described node judges that the Hash groove corresponding to described key value is responsible for by oneself, then described database key order is performed.Wherein, described database key order includes but not limited to get order, set order, del order and hget order.
In S103-2, if not, then described node returns the information of moved mistake to described client, makes described client turn to node correct in described server cluster according to described information.
In the present embodiment, described information comprises the nodename that the Hash groove corresponding to described key value is assigned.Described node returns the information of moved mistake to described client, described client is made to turn to node correct in described server cluster specifically to comprise according to described information: if the Hash groove corresponding to described key value is not be responsible for by described node, the nodename that then the Hash groove of described node automatically corresponding to described key value is assigned generates the information of moved mistake, and described information is back to described client, the nodename that the Hash groove of described client corresponding to the described key value in described information is assigned turns to node correct in described server cluster.
More than can find out, the database key order that by any node in server cluster received client transmission of data processing method owing to first adopting based on key-value pair that the embodiment of the present invention provides; Then the Hash groove corresponding to the key value of carrying in database key order described in described node calculate, and judge whether described Hash groove is responsible for by oneself; If so, then described node performs described database key order; If not, then described node returns the information of moved mistake to described client, described client is made to turn to node correct in described server cluster according to described information, thus make PostgreSQL database Redis that the multinuclear advantage of processor can be utilized to carry out concurrent processing, improve the handling property of database, make only to dispose a database instance and can reach service feature index, decrease the deployment of database instance, alleviate the burden of data base administration.
Fig. 2 shows the structured flowchart of the data handling system based on key-value pair that the embodiment of the present invention provides, and this system is for running the method provided embodiment illustrated in fig. 1.Illustrate only the part relevant to the embodiment of the present invention for convenience of explanation.
Shown in Figure 2, a kind of data handling system based on key-value pair that the embodiment of the present invention provides, comprise the receiver module 1, computing module 2, judge module 3, execution module 4 and the reminding module 5 that are positioned at server cluster interior joint inside, described receiver module 1, described computing module 2, described judge module 3 and described execution module 4 connect successively, described judge module 3 is also connected with described reminding module 5, wherein:
Described receiver module 1, for receiving the database key order that client sends;
Described computing module 2, for calculating the Hash groove corresponding to the key value of carrying in described database key order;
Described judge module 3, for judging whether described Hash groove is responsible for by described node;
Described execution module 4, if for being responsible for by described node, then performs described database key order;
Described reminding module 5, for if not be responsible for by described node, then returns the information of moved mistake to described client, make described client turn to node correct in described server cluster according to described information.
Optionally, the described data handling system based on key-value pair also comprises the distribution module 6 that is connected with the node in described server cluster and is positioned at the memory module 7 that described intra-node is connected with described distribution module 6 and described judge module 3, wherein:
Described distribution module 6, for being assigned to each node in described server cluster respectively by the multiple Hash grooves in described server cluster;
Described memory module 7, for storing the assignment information of described multiple Hash groove.
Optionally, described information comprises the nodename that the Hash groove corresponding to described key value is assigned.
Optionally, described computing module 2 specifically for:
Employing cluster use formula CRC16 (key) %16384 calculates the Hash groove corresponding to key value, and wherein, CRC16 (key) statement is for calculating the CRC16 School Affairs of key value.
Optionally, described database key order comprises get order, set order, del order and hget order.
It should be noted that, modules in the said system that the embodiment of the present invention provides, due to the inventive method embodiment based on same design, its technique effect brought is identical with the inventive method embodiment, particular content see describing in the inventive method embodiment, can repeat no more herein.
Therefore, can find out that the data handling system based on key-value pair that the embodiment of the present invention provides can make PostgreSQL database Redis that the multinuclear advantage of processor can be utilized to carry out concurrent processing equally, improve the handling property of database, and the deployment of database instance can be reduced, alleviate the burden of data base administration.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. based on a data processing method for key-value pair, it is characterized in that, comprising:
Any node in server cluster receives the database key order that client sends;
The Hash groove corresponding to key value carried in database key order described in described node calculate, and judge whether described Hash groove is responsible for by oneself;
If so, then described node performs described database key order;
If not, then described node returns the information of moved mistake to described client, makes described client turn to node correct in described server cluster according to described information.
2. as claimed in claim 1 based on the data processing method of key-value pair, it is characterized in that, any node in server cluster also comprises before receiving the database key order of client transmission:
Multiple Hash grooves in described server cluster are assigned to respectively each node in described server cluster, and the assignment information of described multiple Hash groove is stored to each node in described server cluster.
3., as claimed in claim 2 based on the data processing method of key-value pair, it is characterized in that, described information comprises the nodename that the Hash groove corresponding to described key value is assigned.
4., as claimed in claim 1 based on the data processing method of key-value pair, it is characterized in that, the Hash groove corresponding to key value carried in database key order described in described node calculate specifically comprises:
Described node employing cluster use formula CRC16 (key) %16384 calculates the Hash groove corresponding to key value, and wherein, CRC16 (key) statement is for calculating the CRC16 School Affairs of key value.
5., as claimed in claim 1 based on the data processing method of key-value pair, it is characterized in that, described database key order comprises get order, set order, del order and hget order.
6. the data handling system based on key-value pair, it is characterized in that, comprise the receiver module, computing module, judge module, execution module and the reminding module that are positioned at server cluster interior joint inside, described receiver module, described computing module, described judge module and described execution module connect successively, described judge module is also connected with described reminding module, wherein:
Described receiver module, for receiving the database key order that client sends;
Described computing module, for calculating the Hash groove corresponding to the key value of carrying in described database key order;
Described judge module, for judging whether described Hash groove is responsible for by described node;
Described execution module, if for being responsible for by described node, then performs described database key order;
Described reminding module, for if not be responsible for by described node, then returns the information of moved mistake to described client, make described client turn to node correct in described server cluster according to described information.
7. as claimed in claim 6 based on the data handling system of key-value pair, it is characterized in that, also comprise the distribution module that is connected with the node in described server cluster and be positioned at the memory module that described intra-node is connected with described distribution module and described judge module, wherein:
Described distribution module, for being assigned to each node in described server cluster respectively by the multiple Hash grooves in described server cluster;
Described memory module, for storing the assignment information of described multiple Hash groove.
8., as claimed in claim 7 based on the data handling system of key-value pair, it is characterized in that, described information comprises the nodename that the Hash groove corresponding to described key value is assigned.
9., as claimed in claim 6 based on the data handling system of key-value pair, it is characterized in that, described computing module specifically for:
Employing cluster use formula CRC16 (key) %16384 calculates the Hash groove corresponding to key value, and wherein, CRC16 (key) statement is for calculating the CRC16 School Affairs of key value.
10., as claimed in claim 6 based on the data handling system of key-value pair, it is characterized in that, described database key order comprises get order, set order, del order and hget order.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510765510.2A CN105426451A (en) | 2015-11-11 | 2015-11-11 | Key value pair-based data processing method and system |
| PCT/CN2016/091942 WO2017080257A1 (en) | 2015-11-11 | 2016-07-27 | Data processing method and system based on key-value pair |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510765510.2A CN105426451A (en) | 2015-11-11 | 2015-11-11 | Key value pair-based data processing method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105426451A true CN105426451A (en) | 2016-03-23 |
Family
ID=55504663
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510765510.2A Pending CN105426451A (en) | 2015-11-11 | 2015-11-11 | Key value pair-based data processing method and system |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN105426451A (en) |
| WO (1) | WO2017080257A1 (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017080257A1 (en) * | 2015-11-11 | 2017-05-18 | 华讯方舟科技有限公司 | Data processing method and system based on key-value pair |
| CN107479829A (en) * | 2017-08-03 | 2017-12-15 | 杭州铭师堂教育科技发展有限公司 | A kind of Redis cluster mass datas based on message queue quickly clear up system and method |
| CN107688611A (en) * | 2017-08-03 | 2018-02-13 | 杭州铭师堂教育科技发展有限公司 | A kind of Redis key assignments management system and method based on saltstack |
| CN108416039A (en) * | 2018-03-14 | 2018-08-17 | 北京思特奇信息技术股份有限公司 | A kind of data query method and system |
| CN108509540A (en) * | 2018-03-16 | 2018-09-07 | 中国银行股份有限公司 | Multikey value command handling method and system based on redis clusters |
| CN109274665A (en) * | 2018-09-13 | 2019-01-25 | 北京奇安信科技有限公司 | DNS threatens information processing method and device |
| CN109710406A (en) * | 2018-12-21 | 2019-05-03 | 腾讯科技（深圳）有限公司 | Data distribution and its model training method, device and computing cluster |
| CN109862075A (en) * | 2018-12-29 | 2019-06-07 | 北京奥鹏远程教育中心有限公司 | A kind of method for routing of Redis Service Instance |
| CN112948377A (en) * | 2021-02-02 | 2021-06-11 | 京东数字科技控股股份有限公司 | Data storage method and device, electronic equipment and computer readable medium |
| CN113836238A (en) * | 2021-09-30 | 2021-12-24 | 杭州数梦工场科技有限公司 | Batch processing method and device for data commands |
| CN117033395A (en) * | 2023-10-08 | 2023-11-10 | 北京凌云雀科技有限公司 | Information processing method and device of Redis cluster, electronic equipment and medium |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FR3103664B1 (en) * | 2019-11-27 | 2023-04-07 | Amadeus Sas | Distributed storage system to store contextual data |
| CN113297192B (en) * | 2021-05-31 | 2023-03-14 | 上海艾麒信息科技股份有限公司 | Method and system for controlling field expiration aiming at redis hash type data |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101741731A (en) * | 2009-12-03 | 2010-06-16 | 中兴通讯股份有限公司 | Content metadata storing, inquiring method and managing system in content delivery network (CDN) |
| CN103107944A (en) * | 2011-11-14 | 2013-05-15 | 中国移动通信集团公司 | Content locating method and route equipment |
| CN103268318A (en) * | 2013-04-16 | 2013-08-28 | 华中科技大学 | Distributed key value database system with strong consistency and read-write method thereof |
| CN103544285A (en) * | 2013-10-28 | 2014-01-29 | 华为技术有限公司 | Data loading method and device |
| US20140052762A1 (en) * | 2010-09-28 | 2014-02-20 | Yiftach Shoolman | System, methods, and media for compressing non-relational database objects |
| CN104156380A (en) * | 2014-03-04 | 2014-11-19 | 深圳信息职业技术学院 | Distributed memory Hash indexing method and system |
| CN104361030A (en) * | 2014-10-24 | 2015-02-18 | 西安未来国际信息股份有限公司 | Distributed cache architecture with task distribution function and cache method |
| US9122713B2 (en) * | 2005-07-28 | 2015-09-01 | Pivotal Software, Inc. | Distributed data management system |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101567006B (en) * | 2009-05-25 | 2012-07-04 | 中兴通讯股份有限公司 | Database system and distributed SQL statement execution plan reuse method |
| CN104333512B (en) * | 2014-10-30 | 2017-07-28 | 北京思特奇信息技术股份有限公司 | A kind of distributed memory database accesses system and method |
| CN104408073B (en) * | 2014-10-31 | 2017-10-20 | 广州华多网络科技有限公司 | Data manipulation method and device |
| CN105426451A (en) * | 2015-11-11 | 2016-03-23 | 深圳市华讯方舟科技有限公司 | Key value pair-based data processing method and system |
-
2015
- 2015-11-11 CN CN201510765510.2A patent/CN105426451A/en active Pending
-
2016
- 2016-07-27 WO PCT/CN2016/091942 patent/WO2017080257A1/en active Application Filing
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9122713B2 (en) * | 2005-07-28 | 2015-09-01 | Pivotal Software, Inc. | Distributed data management system |
| CN101741731A (en) * | 2009-12-03 | 2010-06-16 | 中兴通讯股份有限公司 | Content metadata storing, inquiring method and managing system in content delivery network (CDN) |
| US20140052762A1 (en) * | 2010-09-28 | 2014-02-20 | Yiftach Shoolman | System, methods, and media for compressing non-relational database objects |
| CN103107944A (en) * | 2011-11-14 | 2013-05-15 | 中国移动通信集团公司 | Content locating method and route equipment |
| CN103268318A (en) * | 2013-04-16 | 2013-08-28 | 华中科技大学 | Distributed key value database system with strong consistency and read-write method thereof |
| CN103544285A (en) * | 2013-10-28 | 2014-01-29 | 华为技术有限公司 | Data loading method and device |
| CN104156380A (en) * | 2014-03-04 | 2014-11-19 | 深圳信息职业技术学院 | Distributed memory Hash indexing method and system |
| CN104361030A (en) * | 2014-10-24 | 2015-02-18 | 西安未来国际信息股份有限公司 | Distributed cache architecture with task distribution function and cache method |
Non-Patent Citations (2)
| Title |
|---|
| 黄建宏 著: "《Redis设计与实现》", 30 June 2014 * |
| 黎勇等: ""内存数据库在超宽带实时定位系统中应用"", 《计算机应用》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017080257A1 (en) * | 2015-11-11 | 2017-05-18 | 华讯方舟科技有限公司 | Data processing method and system based on key-value pair |
| CN107479829A (en) * | 2017-08-03 | 2017-12-15 | 杭州铭师堂教育科技发展有限公司 | A kind of Redis cluster mass datas based on message queue quickly clear up system and method |
| CN107688611A (en) * | 2017-08-03 | 2018-02-13 | 杭州铭师堂教育科技发展有限公司 | A kind of Redis key assignments management system and method based on saltstack |
| CN107479829B (en) * | 2017-08-03 | 2020-04-17 | 杭州铭师堂教育科技发展有限公司 | Redis cluster mass data rapid cleaning system and method based on message queue |
| CN108416039A (en) * | 2018-03-14 | 2018-08-17 | 北京思特奇信息技术股份有限公司 | A kind of data query method and system |
| CN108509540A (en) * | 2018-03-16 | 2018-09-07 | 中国银行股份有限公司 | Multikey value command handling method and system based on redis clusters |
| CN109274665A (en) * | 2018-09-13 | 2019-01-25 | 北京奇安信科技有限公司 | DNS threatens information processing method and device |
| CN109710406A (en) * | 2018-12-21 | 2019-05-03 | 腾讯科技（深圳）有限公司 | Data distribution and its model training method, device and computing cluster |
| CN109862075A (en) * | 2018-12-29 | 2019-06-07 | 北京奥鹏远程教育中心有限公司 | A kind of method for routing of Redis Service Instance |
| CN112948377A (en) * | 2021-02-02 | 2021-06-11 | 京东数字科技控股股份有限公司 | Data storage method and device, electronic equipment and computer readable medium |
| CN113836238A (en) * | 2021-09-30 | 2021-12-24 | 杭州数梦工场科技有限公司 | Batch processing method and device for data commands |
| CN117033395A (en) * | 2023-10-08 | 2023-11-10 | 北京凌云雀科技有限公司 | Information processing method and device of Redis cluster, electronic equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2017080257A1 (en) | 2017-05-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105426451A (en) | Key value pair-based data processing method and system | |
| US11120022B2 (en) | Processing a database query using a shared metadata store | |
| US9563673B2 (en) | Query method for a distributed database system and query apparatus | |
| US9081837B2 (en) | Scoped database connections | |
| US10140351B2 (en) | Method and apparatus for processing database data in distributed database system | |
| US9507875B2 (en) | Symbolic hyper-graph database | |
| US8682876B2 (en) | Techniques to perform in-database computational programming | |
| US20150120645A1 (en) | System and Method for Creating a Distributed Transaction Manager Supporting Repeatable Read Isolation level in a MPP Database | |
| CN104123374A (en) | Method and device for aggregate query in distributed databases | |
| US10534797B2 (en) | Synchronized updates across multiple database partitions | |
| CN104933173A (en) | Data processing method and device used for heterogeneous multiple data sources, and server | |
| US20140122422A1 (en) | Data synchronization | |
| US11036797B2 (en) | Efficient storage and utilization of a hierarchical data set | |
| CN106569896A (en) | Data distribution and parallel processing method and system | |
| CN104378397A (en) | Method and system for issuing incremental updating of program package | |
| Bienko et al. | IBM cloudant: database as a service advanced topics | |
| CN116775712A (en) | Method, device, electronic equipment, distributed system and storage medium for inquiring linked list | |
| US10963426B1 (en) | Method of providing access controls and permissions over relational data stored in a hadoop file system | |
| Mathew et al. | An efficient index based query handling model for neo4j | |
| Khashan et al. | An adaptive spark-based framework for querying large-scale NoSQL and relational databases | |
| CN104239576A (en) | Method and device for searching for all lines in column values of HBase list | |
| CN108062329A (en) | A kind of data lead-in method and device | |
| Thakare et al. | NoSQL Databases: Modern Data Systems for Big Data Analytics-Features, Categorization and Comparison | |
| Carruthers | The Query Optimizer | |
| Wylot | Efficient, scalable, and provenance-aware management of Linked Data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 518000 Guangdong city of Shenzhen province Baoan District Xixiang Bao Tian Yi Lu Chen Tian Industrial District 37 Building 1 floor Applicant after: Shenzhen Huaxunark Technology Co., Ltd. Applicant after: SHENZHEN CCT SOFTWARE INFORMATION CO., LTD. Address before: 518000 Guangdong city of Shenzhen province Baoan District Xixiang Bao Tian Yi Lu Chen Tian Industrial District 37 Building 1 floor Applicant before: Shenzhen City Huaxun Fangzhou Technology Co., Ltd. Applicant before: SHENZHEN CCT SOFTWARE INFORMATION CO., LTD. |
|
| COR | Change of bibliographic data | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160323 |
|
| RJ01 | Rejection of invention patent application after publication |