CN104166661A - Data storage system and method - Google Patents
Data storage system and method Download PDFInfo
- Publication number
- CN104166661A CN104166661A CN201310187436.1A CN201310187436A CN104166661A CN 104166661 A CN104166661 A CN 104166661A CN 201310187436 A CN201310187436 A CN 201310187436A CN 104166661 A CN104166661 A CN 104166661A
- Authority
- CN
- China
- Prior art keywords
- data
- tables
- data table
- service nodes
- concordance list
- 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.)
- Granted
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
- 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/2282—Tablespace storage structures; Management thereof
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a data storage system and method. The data storage system comprises a plurality of service nodes. Each service node comprises a receiving unit, a judging unit and an updating unit. The receiving units are used for receiving input data and storing the data into the corresponding data table according to the specified data type, and the corresponding data table is one of structural data tables built in a memory of the service nodes. The judging unit is used for storing the corresponding data table into other service nodes in a partition data table mode when the size of the corresponding data table exceeds the threshold value. The updating unit is used for updating a global data index table according to the storage address of the data, and the global data index table is used for storing data table partition indexes of all the service nodes. By the adoption of the technical scheme, the partition data table is built in the memory and forms a cluster in cooperation with multiple service nodes, network service performance can be improved, and rapid operation and statistics of mass information are supported.
Description
Technical field
The present invention relates to field of computer technology, in particular to a kind of data-storage system and date storage method.
Background technology
Current network management system need to be controlled user's data on flows.Wherein a kind of control method is internal storage data management, and the method is the most traditional scheme, is still extensively present at present in various network device and the webserver.In internal memory, set up exactly simple data structure, conventionally by chained list, queue, binary tree, B tree, or the complexity being composited by simple data structure associating data structure forms.This mode can be carried out effective organization and management to data, but structure ossifys in program life cycle, after first design and implementation, be difficult for changing, be unsuitable for the structure of current service-oriented application program, be not suitable for beyond the clouds for each user provides service, data power down in internal memory is volatile in addition, and the data beyond program point storage time cannot back up in time.In network equipment application, along with data stream is passed through, the content that program is preserved is often among continuous variation, as routing table, and data cached table, local network interior nodes ARP information etc., curing structure can not on-demand.Traditional solution is in software, to set up multiple layers, information filtering is extracted or is changed and integrate, and has improved scale and the complexity of program.Another kind of more popular scheme is to preserve information by being used in conjunction external data base, such as Mysql, Oracle, DB2 etc., this scheme has been avoided interim storage volatility and the curing defect of structure, but conventionally need to additionally dispose in site of deployment, it is large that system load becomes, cost rises at double, and program relies on serious to external environment condition, cannot dispose separately; On the other hand, these database bulky, for network application, have a large amount of functions and complexity redundancy, are not suitable for single program or small-scale cluster.Adopt partitioned storage at some network services or the network equipment, the demand to high-throughput when the mechanism copying as required realizes large concurrent data access, such as DNS dns database.This scheme is not introduced extra data base server, can provide again basic data corresponding inquiry, in addition can dispersion load by large tables of data subregion, improve availability.The defect of this scheme is to have distributed deployment platform, will have neighbor node to each customers, in function, can only realize inquiry, increases and deletes information operating and carry out slower; Easily occur that cluster is inconsistent, easily occur being only applicable to information storage little by information redundancy, change request is low, not high to service response rate request, the specific occasion application low to each node coupling granularity requirements of data cluster.
In sum, current various network services data are preserved scheme respectively its inferior position, all can not meet speed, configuration flexibility, distribution tolerance, the modern network service memory demand of data consistency and persistent data simultaneously.
Summary of the invention
In order one of to solve the problems of the technologies described above at least, technical matters to be solved by this invention is, a kind of data storage technology is provided, can flexible storage data, and the data storage method that can carry out as required distributed or concentrated deployment.
In view of this, according to an aspect of the present invention, a kind of data-storage system is provided, comprise: multiple service nodes, described service node comprises receiving element, judging unit and updating block, and wherein, described receiving element is for receiving the data of input, according to the data type of specifying, described data are deposited in corresponding data table, described corresponding data table is the one in the structural data table building in the internal memory of described service node; Described judging unit, in the time that the size of described corresponding data table exceeds threshold value, is stored in other service nodes by described corresponding data table in partition data table mode; Described updating block is for upgrading global data concordance list according to the memory address of described data, and wherein, described global data concordance list is for preserving the tables of data subregion index of all service nodes.
In this technical scheme, can be according to the flexible in size data table memory of tables of data, this data storage system architecture is flexible, deployment is simple, the data storage method that can carry out as required distributed or concentrated deployment.
According to a further aspect in the invention, a kind of date storage method is also provided, comprise: the data that receive input, described data are deposited in the corresponding data table of specified services node according to the data type of specifying, wherein, described corresponding data table is the one in the structural data table building in the internal memory of described specified services node; In the time that the size of described corresponding data table exceeds threshold value, described corresponding data table is stored in to described specified services node in partition data table mode and other service nodes of closing on described specified services node in; Upgrade global data concordance list according to the memory address of described data, wherein, described global data concordance list is for preserving the tables of data subregion index of all service nodes.
In this technical scheme, can be according to the flexible in size data table memory of tables of data, this storage organization is flexible, deployment is simple, the data storage method that can carry out as required distributed or concentrated deployment.
Brief description of the drawings
Figure 1A shows the block diagram of data-storage system according to an embodiment of the invention;
Figure 1B shows the block diagram of service node according to an embodiment of the invention;
Fig. 2 shows the structural representation of data-storage system according to another embodiment of the present invention;
Fig. 3 shows program inner structure schematic diagram according to an embodiment of the invention;
Fig. 4 shows the process flow diagram of date storage method according to an embodiment of the invention;
Fig. 5 shows the process flow diagram of date storage method according to another embodiment of the present invention.
Embodiment
In order more clearly to understand above-mentioned purpose of the present invention, feature and advantage, below in conjunction with the drawings and specific embodiments, the present invention is further described in detail.It should be noted that, in the situation that not conflicting, the feature in the application's embodiment and embodiment can combine mutually.
Set forth in the following description a lot of details so that fully understand the present invention, still, the present invention can also adopt other to be different from other modes described here and implement, and therefore, the present invention is not limited to the restriction of following public specific embodiment.
Figure 1A shows the block diagram of data-storage system according to an embodiment of the invention.
As shown in Figure 1A, data-storage system 100 according to an embodiment of the invention, comprise: multiple service nodes 102, each service node 102 comprises that receiving element 1022, judging unit 1024 and updating block 1026(are as shown in Figure 1B), wherein, described receiving element 1022, for receiving the data of input, deposits described data in corresponding data table according to the data type of specifying, and described corresponding data table is the one in the structural data table building in the internal memory of described service node; Described judging unit 1024, in the time that the size of described corresponding data table exceeds threshold value, is stored in other service nodes by described corresponding data table in partition data table mode; Described updating block 1026 is for upgrading global data concordance list according to the memory address of described data, and wherein, described global data concordance list is for preserving the tables of data subregion index of all service nodes.
In this technical scheme, can be according to the flexible in size data table memory of tables of data, this data storage system architecture is flexible, deployment is simple, can carry out as required the data storage method of distributed or concentrated deployment, and the structural data table building in internal memory has simple in structure, the fireballing feature of inquiry response.
In technique scheme, preferably, described judging unit 1024, also in the time that described receiving element receives user's operation requests, judges whether the operand corresponding with described operation requests is stored in described service node, responds described operation requests according to judged result.
Because data may all be stored in this locality, or be partly stored in this locality, or be all stored in other service nodes, therefore need to carry out operation response request according to different situations, due to global data concordance list, therefore fast response time being provided.
In technique scheme, preferably, described service node 102 also comprises performance element 1028, for in described judged result when being, call in the tables of data corresponding with the data type of described operand, tables of data based on described correspondence is carried out described operation requests, and return to operating result, and in the time that described judged result is no or is partly stored in described service node, import described global data concordance list, according to the described global data concordance list location tables of data corresponding with described operand, tables of data based on described correspondence is carried out described operation requests, and return to operating result.
Preferably, as shown in Figure 1B, service node 102 can also comprise notification unit 10210, after EO, notifies other service nodes to upgrade described global data concordance list.In order to make global data concordance list keep synchronous consistance, and ensure the accuracy of operating result, in the time that delete, add or amendment etc. operates, need upgrade global data concordance list.
In above-mentioned arbitrary technical scheme, preferably, the structural data table that described service node 102 builds in the internal memory of described service node 102 comprises corresponding relation tables of data, orderly relation database table, index relative tables of data and/or two-way chain type relation database table.
In the internal memory of service node, build the multiple tables of data with simple structure, i.e. multilist associating, this multiple tables of data with simple structure comprises corresponding relation tables of data, orderly relation database table, index relative tables of data or two-way chain type relation database table.Just because of having adopted the tables of data with simple structure, therefore do not need the professional program knowledge of user's needs just can finishing service logical operation, and need all can realize business logical operation for different users, do not need amendment or data structure, make data-storage system more flexible; Secondly, owing to adopting similar corresponding relation tables of data, orderly relation database table, index relative tables of data etc. to there is the tables of data of simple structure, can be as SQL data structure, need take larger system resource, in the time that executable operations is the operations such as deletion, increase by it, execution speed is slow, affects data access efficiency.
Referring to Fig. 2 and Fig. 3, another embodiment of the present invention is described below.
As shown in Figure 2, be the structural representation of the data-storage system of another embodiment of the present invention.In the internal memory of each service node 102, build structural data table, the inner structure of this structure structural data table is referring to Fig. 3.
In Fig. 2, tables of data can be crossed over multiple service nodes and be stored, and for example tables of data c1 can cross over 3 service nodes such as being stored in A1, A2, A3; Tables of data c4, can cross over and be stored in 2 service nodes such as A3, A4; Tables of data c2, can cross over and be stored in 2 service nodes such as A3, A4.Therefore, realized the partitioned storage of tables of data and realized the concurrent operations of multiple service nodes.
Each service node has corresponding data preparation and mirror image finger daemon, after tables of data is operated, by this data preparation and mirror image finger daemon by the data image after upgrading to disk, to ensure the persistence of data.
As shown in Figure 3, the present invention adopts multilist associated form to realize simple structural data list structure 302, by this structural data list structure 302, user can adopt the renewal of shirtsleeve operation logic realization to data, without possessing professional program knowledge, this structural data table can meet user's different demands, without expansion or change former data structure.This structural data table data list structure 302 comprises corresponding relation tables of data, ordered data table, search index table, doubly linked list and corresponding finger daemon, the finger daemon that for example sorts, inquiry proxy finger daemon, storage finger daemon, set operation finger daemon.Wherein sort finger daemon for data are sorted, can trigger sequence finger daemon when user inserts or delete one while recording, can locate fast by sequence finger daemon the address that needs to insert record, improve response speed.Set operation finger daemon is for regularly calculating the common ground between two tables of data.Inquiry proxy finger daemon is used for responding user's remote access, and can meet the access needs of different clients.Mutual exclusion management, communication finger daemon are used for limiting each operation can only allow an operation, can not write simultaneously, avoids occurring the confusion of data.Storage finger daemon is for making the process that user operates data separate and carry out with the storing process of data.Do not need as SQL database, in the time that data are operated, need multiple locks, reduced system resource and taken.
Therefore, the invention provides a kind of a large amount of process Concurrency Access of supporting, flexible structure, disposes simply, and renewal speed is fast, is easy to hold data and changes for a long time preservation, responds rapidly the data storage method that can carry out as required distributed or concentrated deployment.
Fig. 4 shows the process flow diagram of date storage method according to an embodiment of the invention.
As shown in Figure 4, date storage method according to an embodiment of the invention, can comprise the following steps: step 402, receive the data of input, described data are deposited in the corresponding data table of specified services node according to the data type of specifying, wherein, described corresponding data table is the one in the structural data table building in the internal memory of described specified services node; Step 404, in the time that the size of described corresponding data table exceeds threshold value, described corresponding data table is stored in to described specified services node in partition data table mode and other service nodes of closing on described specified services node in; Step 406, upgrades global data concordance list according to the memory address of described data, and wherein, described global data concordance list is for preserving the tables of data subregion index of all service nodes.
In this technical scheme, can be according to the flexible in size data table memory of tables of data, this storage organization is flexible, deployment is simple, the data storage method that can carry out as required distributed or concentrated deployment.
In technique scheme, preferred, reception user's operation requests, judges whether the operand corresponding with described operation requests is stored in described specified services node; Respond described operation requests according to judged result.
Because data may all be stored in this locality, or be partly stored in this locality, or be all stored in other service nodes, therefore need to carry out operation response request according to different situations, due to global data concordance list, therefore fast response time being provided.
In technique scheme, preferred, when being, call in the tables of data corresponding with the data type of described operand in described judged result, the tables of data based on described correspondence is carried out described operation requests, and returns to operating result; In the time that described judged result is no or is partly stored in described service node, import described global data concordance list, according to the described global data concordance list location tables of data corresponding with described operand, the tables of data based on described correspondence is carried out described operation requests, and returns to operating result.
In technique scheme, preferred, after EO, notify all service nodes to upgrade described global data concordance list.In order to make global data concordance list keep synchronous consistance, and ensure the accuracy of operating result, in the time that delete, add or amendment etc. operates, need upgrade global data concordance list.
In above-mentioned arbitrary technical scheme, preferably, in the internal memory of described specified services node and described other service nodes, build described structural data table, described structural data table comprises corresponding relation tables of data, orderly relation database table, index relative tables of data and/or two-way chain type relation database table.
In the internal memory of service node, build the multiple tables of data with simple structure, i.e. multilist associating, this multiple tables of data with simple structure comprises corresponding relation tables of data, orderly relation database table, index relative tables of data or two-way chain type relation database table.Just because of having adopted the tables of data with simple structure, therefore do not need the professional program knowledge of user's needs just can finishing service logical operation, and need all can realize business logical operation for different users, do not need amendment or data structure, make data-storage system more flexible; Secondly, owing to adopting similar corresponding relation tables of data, orderly relation database table, index relative tables of data etc. to there is the tables of data of simple structure, can be as SQL data structure, need take larger system resource, in the time that executable operations is the operations such as deletion, increase by it, execution speed is slow, affects data access efficiency.
Fig. 5 shows the process flow diagram of date storage method according to another embodiment of the present invention.
The process that adopts data-storage system of the present invention to store data comprises: according to user's specified data type, deposit data in one in mapping table or ordinal relation table or index relative table or two-way chain type relation table;
When tables of data excessive (being greater than threshold value), adopt the mode of partition table tables of data to be kept in the multiple service nodes that approach with query point, simultaneously synchronous all global data concordance lists, preserve the tables of data subregion index of all service nodes in cluster in this global data concordance list.
As shown in Figure 5, in step 502, agent process (example is inquiry proxy finger daemon as shown in Figure 3) in service node receives external request, when inquiry or more when new data, first from closing on service node request.In step 504, create agency service process.In step 506, judge whether that operand (inquiry or the data object upgrading), whether all at local service node, if so, enters step 526, otherwise, enter step 508.
In step 508, import global data concordance list.In step 510, judge that this operand whether in this global data concordance list, if so, enters 512, otherwise enters step 522.
In step 512, preserve the cluster index item of data query, the index object address information of preserving all service nodes of this operand.In step 514, judge whether cluster index item comprises local service node, if so, enter step 516, if not, enter step 520, return to this global data concordance list.
In step 516, retain the respective index object address in local service node, and enter step 526, go out corresponding data with the index object address search according to local service node; In step 518, return to the index object address of other service nodes, search the corresponding data of other service nodes for user.
In step 522, delete the global data concordance list of preserving.In step 524, return to mistake, there is no the operand that will search.
In the time that operand is all kept at local service node, directly enter step 526, the tables of data type of decision operation object, according to different tables of data types, calls in different handling function collection.
In step 528, the operation that judges user is query manipulation or upgrades operation, if query manipulation enters step 536, carries out solicit operation; If not, enter step 530.
In step 530, carry out solicit operation, in step 532, tables of data is being upgraded to operation (for example delete, interpolation, retouching operation) afterwards, renewal global data concordance list.In step 534, return to operation success message.
From above-mentioned flow process, can find out, when closing on service node search data message in the synchronous global data concordance list upgrading, have three kinds of situations:
(1) data are all kept at this locality, if query manipulation directly operates, and result are returned to client; If increase or deletion action, upgrade global data concordance list at all service nodes of Inform when done.
(2) data are all kept at external service node, now directly return to the service node list of preserving these data to user, then exit communication, wait for next request.
(3) data mixing is stored in local service node and external service node.First return to the service node list that user preserves these data, if increase, deletion action need to be carried out snapshot to this part data on local service node, then carries out the operation of user's request, returns to operating result.In the time that all returning successfully, finish all service nodes, otherwise, recover snapshot, final updating global data concordance list.
To sum up, in order to meet network service actual demand, and have a good treatment effeciency, the invention provides a kind of a large amount of process Concurrency Access of supporting, flexible structure, disposes simple, renewal speed is fast, be easy to hold data and change for a long time preservation, response is rapid, the data storage method that can carry out as required distributed or concentrated deployment.In technical scheme of the present invention, set up a network server moving (being database table storage management program) in internal memory, support one or more operation, comprise the increase based on corresponding relation, inquiry, delete function and searching based on sequence order, deletion action function, and finger daemon Timing Sort data are set, to accelerate access efficiency, and in the time that each acceptance is upgraded, mirror image data is to disk, to ensure the persistence of data, allow subset, occur simultaneously, union set operation, tolerate that same group of corresponding relation cross over multiple service nodes, and realize the concurrent operations of multiple nodes, having solved correlation technique, all can not to meet speed responsive fast simultaneously, configuration flexibility, distribution tolerance, the problem of the modern network service memory demand of data consistency and persistent data.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any amendment of doing, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.
Claims (10)
1. a data-storage system, is characterized in that, comprising: multiple service nodes, and described service node comprises receiving element, judging unit and updating block, wherein,
Described receiving element, for receiving the data of input, deposits described data in corresponding data table according to the data type of specifying, and described corresponding data table is the one in the structural data table building in the internal memory of described service node;
Described judging unit, in the time that the size of described corresponding data table exceeds threshold value, is stored in other service nodes by described corresponding data table in partition data table mode;
Described updating block is for upgrading global data concordance list according to the memory address of described data, and wherein, described global data concordance list is for preserving the tables of data subregion index of all service nodes.
2. data-storage system according to claim 1, it is characterized in that, described judging unit is also in the time that described receiving element receives user's operation requests, judge whether the operand corresponding with described operation requests is stored in described service node, responds described operation requests according to judged result.
3. data-storage system according to claim 2, it is characterized in that, described service node also comprises performance element, for in described judged result when being, call in the tables of data corresponding with the data type of described operand, tables of data based on described correspondence is carried out described operation requests, and return to operating result, and in the time that described judged result is no or is partly stored in described service node, import described global data concordance list, according to the described global data concordance list location tables of data corresponding with described operand, tables of data based on described correspondence is carried out described operation requests, and return to operating result.
4. data-storage system according to claim 2, is characterized in that, also comprises notification unit, after EO, notifies other service nodes to upgrade described global data concordance list.
5. according to the data-storage system described in any one in claim 2 to 4, it is characterized in that, described structural data table comprises corresponding relation tables of data, orderly relation database table, index relative tables of data and/or two-way chain type relation database table.
6. a date storage method, is characterized in that, comprising:
Receive the data of input, described data are deposited in the corresponding data table of specified services node according to the data type of specifying, wherein, described corresponding data table is the one in the structural data table building in the internal memory of described specified services node;
In the time that the size of described corresponding data table exceeds threshold value, described corresponding data table is stored in to described specified services node in partition data table mode and other service nodes of closing on described specified services node in;
Upgrade global data concordance list according to the memory address of described data, wherein, described global data concordance list is for preserving the tables of data subregion index of all service nodes.
7. date storage method according to claim 6, is characterized in that, receives user's operation requests, judges whether the operand corresponding with described operation requests is stored in described specified services node;
Respond described operation requests according to judged result.
8. date storage method according to claim 7, it is characterized in that, when being, call in the tables of data corresponding with the data type of described operand in described judged result, tables of data based on described correspondence is carried out described operation requests, and returns to operating result;
In the time that described judged result is no or is partly stored in described service node, import described global data concordance list, according to the described global data concordance list location tables of data corresponding with described operand, the tables of data based on described correspondence is carried out described operation requests, and returns to operating result.
9. date storage method according to claim 7, is characterized in that, after EO, notifies all service nodes to upgrade described global data concordance list.
10. according to the date storage method described in any one in claim 7 to 9, it is characterized in that, in the internal memory of described specified services node and described other service nodes, build described structural data table, described structural data table comprises corresponding relation tables of data, orderly relation database table, index relative tables of data and/or two-way chain type relation database table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310187436.1A CN104166661B (en) | 2013-05-20 | 2013-05-20 | Data-storage system and date storage method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310187436.1A CN104166661B (en) | 2013-05-20 | 2013-05-20 | Data-storage system and date storage method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104166661A true CN104166661A (en) | 2014-11-26 |
| CN104166661B CN104166661B (en) | 2018-05-22 |
Family
ID=51910479
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310187436.1A Expired - Fee Related CN104166661B (en) | 2013-05-20 | 2013-05-20 | Data-storage system and date storage method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104166661B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104866584A (en) * | 2015-05-28 | 2015-08-26 | 交通银行股份有限公司 | Data partitioning method and data partitioning device based on business rules |
| CN107480283A (en) * | 2017-08-23 | 2017-12-15 | 九次方大数据信息集团有限公司 | Realize the method, apparatus and storage system of big data quick storage |
| CN107515880A (en) * | 2016-06-17 | 2017-12-26 | 宏碁股份有限公司 | data distributed processing system and method |
| CN107908371A (en) * | 2017-12-08 | 2018-04-13 | 浪潮软件股份有限公司 | A kind of data management system and its method for realizing data management business |
| CN108090095A (en) * | 2016-11-23 | 2018-05-29 | 北京国双科技有限公司 | The method and apparatus that batch rebuilds database |
| CN110019400A (en) * | 2017-12-25 | 2019-07-16 | 深圳云天励飞技术有限公司 | Date storage method, electronic equipment and storage medium |
| CN113220729A (en) * | 2021-05-28 | 2021-08-06 | 网易（杭州）网络有限公司 | Data storage method and device, electronic equipment and computer readable storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102395962A (en) * | 2009-03-11 | 2012-03-28 | 甲骨文国际公司 | Composite hash and list partitioning of database tables |
| CN102467570A (en) * | 2010-11-17 | 2012-05-23 | 日电（中国）有限公司 | Connection query system and method for distributed data warehouse |
-
2013
- 2013-05-20 CN CN201310187436.1A patent/CN104166661B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102395962A (en) * | 2009-03-11 | 2012-03-28 | 甲骨文国际公司 | Composite hash and list partitioning of database tables |
| CN102467570A (en) * | 2010-11-17 | 2012-05-23 | 日电（中国）有限公司 | Connection query system and method for distributed data warehouse |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104866584A (en) * | 2015-05-28 | 2015-08-26 | 交通银行股份有限公司 | Data partitioning method and data partitioning device based on business rules |
| CN107515880A (en) * | 2016-06-17 | 2017-12-26 | 宏碁股份有限公司 | data distributed processing system and method |
| CN107515880B (en) * | 2016-06-17 | 2020-12-22 | 宏碁股份有限公司 | Data decentralized processing system and method |
| CN108090095A (en) * | 2016-11-23 | 2018-05-29 | 北京国双科技有限公司 | The method and apparatus that batch rebuilds database |
| CN108090095B (en) * | 2016-11-23 | 2020-09-15 | 北京国双科技有限公司 | Method and device for reconstructing database in batches |
| CN107480283A (en) * | 2017-08-23 | 2017-12-15 | 九次方大数据信息集团有限公司 | Realize the method, apparatus and storage system of big data quick storage |
| CN107908371A (en) * | 2017-12-08 | 2018-04-13 | 浪潮软件股份有限公司 | A kind of data management system and its method for realizing data management business |
| CN110019400A (en) * | 2017-12-25 | 2019-07-16 | 深圳云天励飞技术有限公司 | Date storage method, electronic equipment and storage medium |
| CN110019400B (en) * | 2017-12-25 | 2021-01-12 | 深圳云天励飞技术有限公司 | Data storage method, electronic device and storage medium |
| CN113220729A (en) * | 2021-05-28 | 2021-08-06 | 网易（杭州）网络有限公司 | Data storage method and device, electronic equipment and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104166661B (en) | 2018-05-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11294890B2 (en) | Batch data ingestion in database systems | |
| US10387402B2 (en) | System and method for conditionally updating an item with attribute granularity | |
| US10915408B2 (en) | Snapshot for grouping and elastic replication of virtual machines | |
| CN103150394B (en) | Distributed file system metadata management method facing to high-performance calculation | |
| CN104166661A (en) | Data storage system and method | |
| CN104067216B (en) | System and method for implementing expansible data storage service | |
| AU2014346369B2 (en) | Managed service for acquisition, storage and consumption of large-scale data streams | |
| Annamalai et al. | Sharding the shards: managing datastore locality at scale with Akkio | |
| US10853242B2 (en) | Deduplication and garbage collection across logical databases | |
| CN103023982B (en) | Low-latency metadata access method of cloud storage client | |
| CN110018983A (en) | A kind of metadata query method and device | |
| US7512621B2 (en) | Moving records between partitions | |
| CN103631868B (en) | Data management system compatible with relational database | |
| CN101354726A (en) | Method for managing memory metadata of cluster file system | |
| CN103139300A (en) | Virtual machine image management optimization method based on data de-duplication | |
| US11080207B2 (en) | Caching framework for big-data engines in the cloud | |
| Xiong et al. | Data vitalization: a new paradigm for large-scale dataset analysis | |
| US10642530B2 (en) | Global occupancy aggregator for global garbage collection scheduling | |
| CN102779138A (en) | Hard disk access method of real time data | |
| CN113811928B (en) | Distributed memory space data storage for K nearest neighbor search | |
| JP2012008854A (en) | Storage virtualization device | |
| CN114610680A (en) | Method, device and equipment for managing metadata of distributed file system and storage medium | |
| CN112559459B (en) | Cloud computing-based self-adaptive storage layering system and method | |
| JP2022521412A (en) | Asynchronous storage management in distributed systems | |
| CN107220248A (en) | A kind of method and apparatus for data storage |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 100088 Beijing City, Haidian District Institute of Road No. 15, North Building B block 5 layer Patentee after: FOUNDER BROADBAND NETWORK SERVICE Co.,Ltd. Address before: 100088 Beijing City, Haidian District Institute of Road No. 15, North Building B block 5 layer Patentee before: FOUNDER BROADBAND NETWORK SERVICE Co.,Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180522 |