CN104166661B - Data-storage system and date storage method - Google Patents
Data-storage system and date storage method Download PDFInfo
- Publication number
- CN104166661B CN104166661B CN201310187436.1A CN201310187436A CN104166661B CN 104166661 B CN104166661 B CN 104166661B CN 201310187436 A CN201310187436 A CN 201310187436A CN 104166661 B CN104166661 B CN 104166661B
- Authority
- CN
- China
- Prior art keywords
- data
- tables
- data table
- concordance list
- service
- 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.)
- Expired - Fee Related
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]
Abstract
The present invention provides a kind of data-storage system and date storage method, wherein, data-storage system, including：Multiple service nodes, service node includes receiving unit, judging unit and updating block, wherein, the data that receiving unit inputs for reception, data are stored in corresponding data table according to specified data type, the corresponding data table is one kind in the structural data table built in the memory of the service node；Judging unit is used to, when the size of corresponding data table exceeds threshold value, corresponding data table is stored in other service nodes in a manner of partition data table；Updating block is used to update global data concordance list according to the storage address of data, wherein, global data concordance list is used to preserve the tables of data subregion index of all service nodes.By technical scheme, partition data table is built in memory and combines multiple service node composition clusters, can increase network service performance, support the fast operating and statistics of magnanimity information.
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 needs to control the data on flows of user.One of which control method is memory
Data management, this method are most traditional schemes, are still widely present in the various network equipments and network server at present.Just
To establish simple data structure in memory, it is usually compound by chained list, queue, binary tree, B-tree or by simple data structure and
Into complicated joint data structure composition.This mode can carry out data effective organization and management, but be given birth in program
Structure ossifys in the life cycle, is not easy to change after first design and implement, and is unsuitable for the structure of current service-oriented application program
It builds, is not suitable for providing service beyond the clouds for each user, data power down in addition in memory is volatile, at program storage time point
Data in addition can not back up in time.In network equipment application field, as data flow is by the way that the content that program preserves often is located
Among continuous variation, such as routing table, data cached table, local network interior nodes ARP information etc., cured structure cannot be with need to answer
Become.Traditional solution method is to establish multiple layers in software, and information filtering is extracted or is changed and is integrated, improves the rule of program
Mould and complexity.Another more popular scheme is to preserve information, such as Mysql, Oracle by the way that external data base is used in conjunction,
DB2 etc., this solution avoids interim storage volatibility and it is Structured cured the defects of, but usually require it is additional in site of deployment
Deployment, system load become larger, and cost rises at double, and program is serious to external condition depended, can not individually dispose；On the other hand,
These database bulkies for network application, there is substantial amounts of function and complexity redundancy, are not suitable for single program or small
Scale cluster.In some network services or the network equipment using partitioned storage, the mechanism replicated on demand realizes big concurrent data
To the demand of high-throughput, such as DNS domain name database during access.This scheme does not introduce additional data base server,
Basic data can be provided again and correspond to inquiry, in addition can load big data table subregion with dispersion, improve availability.It is this
The defects of scheme is the deployment platform that must be distributed formula, will have neighbor node to each customers, can only functionally realize
Inquiry, increases and deletion information operation execution is slower；It is inconsistent to be susceptible to cluster, is susceptible to information redundancy, is only applicable to
Information storage is small, and change request is low, not high to service response rate request, and granularity requirements are coupled to each node of data cluster
Low specific occasion application.
In conclusion current various network service datas, which preserve scheme, respectively its inferior position, it cannot meet speed simultaneously,
Configuration flexibility is distributed tolerance, data consistency and the persistent modern network service memory demand of data.
The content of the invention
At least one in order to solve the above-mentioned technical problem, the technical problems to be solved by the invention are, provide a kind of number
According to memory technology, can flexible storage data, and data storage method that is distributed or concentrating deployment can be carried out on demand.
In view of this, according to an aspect of the invention, there is provided a kind of data-storage system, including：Multiple service sections
Point, the service node include receiving unit, judging unit and updating block, wherein, the receiving unit inputs for receiving
Data, according to specified data type by the data be stored in corresponding data table in, the corresponding data table is the service
One kind in the structural data table built in the memory of node；The judging unit is used for the size in the corresponding data table
During beyond threshold value, the corresponding data table is stored in other service nodes in a manner of partition data table；The updating block is used
In updating global data concordance list according to the storage address of the data, wherein, the global data concordance list is for preserving institute
The tables of data subregion for having service node indexes.
It in the technical scheme, can be according to the flexible in size data table memory of tables of data, data storage system architecture spirit
Living, deployment simply, can carry out data storage method that is distributed or concentrating deployment on demand.
According to another aspect of the present invention, a kind of date storage method is additionally provided, including：Receive the data of input, root
The data are stored in the corresponding data table of specified services node according to specified data type, wherein, the corresponding data table
One kind in the structural data table built in the memory for being the specified services node；Surpass in the size of the corresponding data table
When going out threshold value, by the corresponding data table be stored in a manner of partition data table the specified services node and with the specified clothes
In other service nodes that business node closes on；Global data concordance list is updated according to the storage address of the data, wherein, it is described
Global data concordance list is used to preserve the tables of data subregion index of all service nodes.
In the technical scheme, can be according to the flexible in size data table memory of tables of data, the storage organization is flexible, deployment letter
It is single, data storage method that is distributed or concentrating deployment can be carried out on demand.
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 internal structure schematic diagram according to an embodiment of the invention；
Fig. 4 shows the flow chart of date storage method according to an embodiment of the invention；
Fig. 5 shows the flow chart of date storage method according to another embodiment of the present invention.
Specific embodiment
It is to better understand the objects, features and advantages of the present invention, below in conjunction with the accompanying drawings and specific real
Mode is applied the present invention is further described in detail.It should be noted that in the case where there is no conflict, the implementation of the application
Feature in example and embodiment can be mutually combined.
Many details are elaborated in the following description to facilitate a thorough understanding of the present invention, still, the present invention may be used also
To be implemented using other different from other modes described here, therefore, the present invention is not limited to following public specific realities
Apply the limitation of example.
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, including：Multiple service nodes 102,
Each service node 102 includes receiving unit 1022, judging unit 1024 and updating block 1026（As shown in Figure 1B）, wherein,
The data are stored in corresponding data table by the receiving unit 1022 for receiving the data of input, according to specified data type
In, the corresponding data table is one kind in the structural data table built in the memory of the service node；It is described to judge list
Member 1024 is used to, when the size of the corresponding data table exceeds threshold value, the corresponding data table be protected in a manner of partition data table
It is stored in other service nodes；The updating block 1026 is used to update global data index according to the storage address of the data
Table, wherein, the global data concordance list is used to preserve the tables of data subregion index of all service nodes.
It in the technical scheme, can be according to the flexible in size data table memory of tables of data, data storage system architecture spirit
Living, deployment simply, can carry out data storage method that is distributed or concentrating deployment, and the structuring built in memory on demand
Tables of data has simple in structure, the fireballing feature of inquiry response.
In the above-mentioned technical solutions, it is preferred that the judging unit 1024 is additionally operable to receive use in the receiving unit
During the operation requests at family, judge whether corresponding with operation requests operation object is stored in the service node, according to sentencing
Disconnected result responds the operation requests.
Local may be all stored in due to data or be partly stored in local or be all stored in other services
In node, therefore need to operation requests be responded according to different situations, due to providing global data concordance list, response speed
Degree is fast.
In the above-mentioned technical solutions, it is preferred that the service node 102 further includes execution unit 1028, for described
Judging result is when being, tables of data corresponding with the data type of the operation object to be called in, based on the corresponding tables of data
The operation requests are performed, and returns to operating result and is stored in the service section in the judging result for no or part
During point, the global data concordance list is imported, number corresponding with the operation object is positioned according to the global data concordance list
According to table, the operation requests are performed based on the corresponding tables of data, and return to operating result.
Preferably, as shown in Figure 1B, service node 102 can also include notification unit 10210, after operation, lead to
Know that other service nodes update the global data concordance list.In order to which global data concordance list is made to keep synchronous uniformity, and protect
The accuracy of operating result is demonstrate,proved, when being deleted, being added or being changed when operations, global data concordance list need to be updated.
In any of the above-described technical solution, it is preferred that the service node 102 is in the memory of the service node 102
The structural data table of structure includes corresponding relation data table, ordering relationship tables of data, index relative tables of data and/or Two-way Chain
Formula relation database table.
Build a variety of tables of data with simple structure in the memory of service node, i.e., multilist is combined, this is a variety of to have
The tables of data of simple structure includes corresponding relation data table, ordering relationship tables of data, index relative tables of data or two-way chain type and closes
It is tables of data.Just because of employing the tables of data with simple structure, therefore user is not required to need the procedural knowledge of specialty
Just can finishing service logical operation, and need that business logical operation can be achieved for different users, need not change
Or data structure so that data-storage system is more flexible；Secondly as it using similar corresponding relation data table, closes in order
Be tables of data, index relative tables of data etc. have simple structure tables of data, will not as SQL data structures, need to occupy compared with
Big system resource, when execution operation is deletion, is increased when operations by it, execution speed is slow, influences data access efficiency.
Illustrate another embodiment of the present invention referring now to Fig. 2 and Fig. 3.
As shown in Fig. 2, the structural representation of the data-storage system for another embodiment of the present invention.In each service node
Structural data table is built in 102 memory, the internal structure of the structure structural data table is referring to Fig. 3.
In fig. 2, tables of data may span across multiple service nodes and be stored, such as tables of data c1, may span across be stored in A1,
3 service nodes such as A2, A3；Tables of data c4 may span across and be stored in 2 service nodes such as A3, A4；Tables of data c2, may span across and deposit
Storage is in 2 service nodes such as A3, A4.It is thereby achieved that the partitioned storage of tables of data and realizing the concurrent of multiple service nodes
Operation.
Each service node has corresponding data preparation and mirror image finger daemon, after being operated to tables of data,
By the data preparation and mirror image finger daemon by updated data image to disk, to ensure the persistence of data.
As shown in figure 3, the present invention realizes simple structural data table structure 302 using multilist associated form, by this
Update of the shirtsleeve operation logic realization to data can be used in structural data table structure 302, user, without possessing the journey of specialty
Sequence knowledge, the structural data table can meet the different demands of user, without extending or changing former data structure.The structuring number
Include corresponding relation data table, ordered data table, search index table, doubly linked list and corresponding according to table data list structure 302
Finger daemon, such as sequence finger daemon, inquiry proxy finger daemon, storage finger daemon, set operation finger daemon.Wherein
Sequence finger daemon is for being ranked up data, when user is inserted into or deletes a record, can trigger sequence finger daemon,
Can quickly be positioned by the finger daemon that sorts need to be inserted into the address of record, improve response speed.Set operation finger daemon is used for
Periodically calculate the common ground between two tables of data.Inquiry proxy finger daemon is used to respond the remote access of user, and can
Meet the access needs of different clients.Mutual exclusion management, communication finger daemon can only allow a behaviour for limiting operation every time
Make, it is impossible to write simultaneously, avoid the occurrence of the confusion of data.Storage finger daemon is used to make the process that user operates data
It is separately carried out with the storing process of data.Need not as SQL database, when being operated to data, it is necessary to multiple locks,
Reduce system resource occupancy.
Therefore, the present invention provides a kind of a large amount of processes is supported concurrently to access, flexible structure, deployment is simple, renewal speed
Soon, it is easy to hold data and changes preservation long, response is rapid, can carry out data storage method that is distributed or concentrating deployment on demand.
Fig. 4 shows the flow chart 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, may comprise steps of：Step 402,
The data of input are received, the data are stored in the corresponding data table of specified services node according to specified data type,
In, the corresponding data table is one kind in the structural data table built in the memory of the specified services node；Step
404, when the size of the corresponding data table exceeds threshold value, the corresponding data table is stored in institute in a manner of partition data table
It states in specified services node and other service nodes closed on the specified services node；Step 406, according to the data
Storage address updates global data concordance list, wherein, the global data concordance list is used to preserve the data of all service nodes
Table subregion indexes.
In the technical scheme, can be according to the flexible in size data table memory of tables of data, the storage organization is flexible, deployment letter
It is single, data storage method that is distributed or concentrating deployment can be carried out on demand.
In the above-mentioned technical solutions, it is preferred that receive the operation requests of user, judge behaviour corresponding with the operation requests
It opposes as if no is stored in the specified services node；The operation requests are responded according to judging result.
Local may be all stored in due to data or be partly stored in local or be all stored in other services
In node, therefore need to operation requests be responded according to different situations, due to providing global data concordance list, response speed
Degree is fast.
In the above-mentioned technical solutions, it is preferred that when the judging result is to be, call in the data with the operation object
The corresponding tables of data of type performs the operation requests based on the corresponding tables of data, and returns to operating result；Sentence described
When disconnected result is stored in the service node for no or part, the global data concordance list is imported, according to the global data
Concordance list positions tables of data corresponding with the operation object, and the operation requests are performed based on the corresponding tables of data, and
Return to operating result.
In the above-mentioned technical solutions, it is preferred that after operation, all service nodes is notified to update the global data
Concordance list.In order to which global data concordance list is made to keep synchronous uniformity, and ensure the accuracy of operating result, deleted,
Addition is changed when operations, and global data concordance list need to be updated.
In any of the above-described technical solution, it is preferred that in the specified services node and other described service nodes
The middle structure structural data table is deposited, the structural data table includes corresponding relation data table, ordering relationship tables of data, rope
Draw relation database table and/or two-way chain type relation database table.
Build a variety of tables of data with simple structure in the memory of service node, i.e., multilist is combined, this is a variety of to have
The tables of data of simple structure includes corresponding relation data table, ordering relationship tables of data, index relative tables of data or two-way chain type and closes
It is tables of data.Just because of employing the tables of data with simple structure, therefore user is not required to need the procedural knowledge of specialty
Just can finishing service logical operation, and need that business logical operation can be achieved for different users, need not change
Or data structure so that data-storage system is more flexible；Secondly as it using similar corresponding relation data table, closes in order
Be tables of data, index relative tables of data etc. have simple structure tables of data, will not as SQL data structures, need to occupy compared with
Big system resource, when execution operation is deletion, is increased when operations by it, execution speed is slow, influences data access efficiency.
Fig. 5 shows the flow chart of date storage method according to another embodiment of the present invention.
The process that data-storage system using the present invention stores data includes：According to the specified data class of user
Data are stored in one kind in mapping table or ordinal relation table or index relative table or two-way chain type relation table by type；
When tables of data is excessive（More than threshold value）When, tables of data is stored in by the way of partition table close with query point
In multiple service nodes, while synchronous all global data concordance lists, preserve in cluster and own in this global data concordance list
The tables of data subregion index of service node.
As shown in figure 5, the agent process in step 502, service node（Such as the inquiry proxy shown in Fig. 3 is guarded
Process）Receive external request, when inquiring about or updating the data, first from close on service node request.In step 504, generation is created
Manage service processes.In step 506, judge whether operation object（Inquiry or newer data object）Whether all in local service
Node if so, entering step 526, otherwise, enters step 508.
In step 508, global data concordance list is imported.In step 510, judge the operation object whether in the global data
In concordance list, if so, into 512,522 are otherwise entered step.
In step 512, the cluster index item of inquiry data is preserved, that is, preserves all service nodes of the operation object
Index object address information.In step 514, whether cluster index item is judged comprising local service node, if so, entering step
Rapid 516, if it is not, then entering step 520, return to the global data concordance list.
In step 516, retain the respective index object address in local service node, and enter step 526, with according to this
The index object address search of ground service node goes out corresponding data；In step 518, with returning to the index object of other service nodes
Location, so that user searches the corresponding data of other service nodes.
In step 522, the global data concordance list of preservation is deleted.In step 524, mistake, the behaviour not searched are returned
Make object.
When operation object is all stored in local service node, step 526 is directly entered, judges the data of operation object
Table type according to different data table types, calls in different handling function collection.
In step 528, the operation for judging user is inquiry operation or update operation, if inquiry operation, then into step
Rapid 536, perform request operation；If it is not, then enter step 530.
In step 530, request operation is performed, in step 532, operation is being updated to tables of data（Such as it deletes, add
Add, change operation）Afterwards, global data concordance list is updated.In step 534, operation success message is returned.
As can be seen that closing on service node searching data in the global data concordance list of synchronized update from above-mentioned flow
During information, there are three types of situations：
（1）Data are all stored in local, if inquiry operation, are then directly operated, and return result to visitor
Family；If increase or delete operation, then in all service nodes update global data concordance lists of Inform when done.
（2）Data are all stored in external service node, return to the service node for preserving the data directly to user at this time
List is then log out communicating, and waits next request.
（3）Data mixing is stored in local service node and external service node.User is returned to first preserves the data
Service node list, if increase, delete operation, then need on local service node to this partial data carry out snapshot,
The operation of user's request is then carried out, returns to operating result.Terminate when all service nodes all return successfully, otherwise, recover
Snapshot, final updating global data concordance list.
To sum up, in order to meet network service actual demand, and preferable treatment effeciency is possessed, the present invention provides a kind of
Hold a large amount of processes concurrently to access, flexible structure, deployment is simple, and renewal speed is fast, is easy to hold data and changes preservations long, response rapidly,
Data storage method that is distributed or concentrating deployment can be carried out on demand.It establishes in the inventive solutions including one
Deposit the network server of middle operation（That is database table storage management program）, one or more operation is supported, including being based on pair
The increase that should be related to, inquiry delete function and lookup based on sequence order, delete operation function, and finger daemon are set to determine
When sorting data, with accelerate access efficiency and it is each receive update when, mirror image data to disk, to ensure holding for data
Long property, allows subset, intersection, and union set operation is tolerated same group of correspondence across multiple service nodes, and realized multiple
The concurrent operations of node solve correlation technique fast, the configuration flexibility that cannot meet speed responsive simultaneously, are distributed tolerance,
The problem of data consistency and data persistent modern network service memory demand.
The foregoing is only a preferred embodiment of the present invention, is not intended to limit the invention, for the skill of this field
For art personnel, the invention may be variously modified and varied.Within the spirit and principles of the invention, that is made any repaiies
Change, equivalent substitution, improvement etc., should all be included in the protection scope of the present invention.
Claims (8)
1. a kind of data-storage system, which is characterized in that including：Multiple service nodes, the service node include receiving unit,
Judging unit and updating block, wherein,
The data are stored in corresponding data table by the receiving unit for receiving the data of input, according to specified data type
In, the corresponding data table is one kind in the structural data table built in the memory of the service node；
The judging unit is used for when the size of the corresponding data table exceeds threshold value, by the corresponding data table with the number of partitions
Other service nodes are stored according to table mode；
The updating block is used to update global data concordance list according to the storage address of the data, wherein, the overall situation number
The tables of data subregion for being used to preserve all service nodes according to concordance list indexes；
The judging unit is additionally operable to when the receiving unit receives the operation requests of user, is judged and the operation requests
Whether corresponding operation object is stored in the service node, and the operation requests are responded according to judging result.
2. data-storage system according to claim 1, which is characterized in that the service node further includes execution unit,
During for being in the judging result, tables of data corresponding with the data type of the operation object is called in, based on described right
The tables of data answered performs the operation requests, and returns to operating result and be stored in the judging result for no or part
During the service node, the global data concordance list is imported, according to global data concordance list positioning and the operation pair
As corresponding tables of data, the operation requests are performed based on the corresponding tables of data, and return to operating result.
3. data-storage system according to claim 1, which is characterized in that notification unit is further included, after operation,
Other service nodes is notified to update the global data concordance list.
4. data-storage system according to any one of claim 1 to 3, which is characterized in that the structural data table
Including corresponding relation data table, ordering relationship tables of data, index relative tables of data and/or two-way chain type relation database table.
5. a kind of date storage method, which is characterized in that including：
The data of input are received, the data are stored in the corresponding data table of specified services node according to specified data type
In, wherein, the corresponding data table is one kind in the structural data table built in the memory of the specified services node；
When the size of the corresponding data table exceeds threshold value, the corresponding data table is stored in institute in a manner of partition data table
It states in specified services node and other service nodes closed on the specified services node；
Global data concordance list is updated according to the storage address of the data, wherein, the global data concordance list is used to preserve
The tables of data subregion index of all service nodes；
The operation requests of user are received, judge whether operation object corresponding with the operation requests is stored in the specified services
Node；
The operation requests are responded according to judging result.
6. date storage method according to claim 5, which is characterized in that the judging result for be when, call in
The corresponding tables of data of data type of the operation object performs the operation requests based on the corresponding tables of data, and returns
Return operating result；
When the judging result is stored in the service node for no or part, the global data concordance list is imported, according to
The global data concordance list positions tables of data corresponding with the operation object, based on described in the corresponding tables of data execution
Operation requests, and return to operating result.
7. date storage method according to claim 5, which is characterized in that after operation, notify all service sections
Point updates the global data concordance list.
8. date storage method according to any one of claims 5 to 7, which is characterized in that in the specified services section
The structural data table is built in the memory of point and other service nodes, the structural data table includes correspondence
Tables of data, ordering relationship tables of data, 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 CN104166661A (en) | 2014-11-26 |
| CN104166661B true 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) |
Families Citing this family (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 |
| CN107515880B (en) * | 2016-06-17 | 2020-12-22 | 宏碁股份有限公司 | Data decentralized processing system and method |
| 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 |
| CN110019400B (en) * | 2017-12-25 | 2021-01-12 | 深圳云天励飞技术有限公司 | Data storage method, electronic device and storage medium |
| CN113220729B (en) * | 2021-05-28 | 2023-03-21 | 网易（杭州）网络有限公司 | 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104166661A (en) | 2014-11-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104166661B (en) | Data-storage system and date storage method | |
| Mayer et al. | Fogstore: Toward a distributed data store for fog computing | |
| US9996581B2 (en) | Real-time saved-query updates for a large graph | |
| CN103067433B (en) | A kind of data migration method of distributed memory system, equipment and system | |
| US20110153644A1 (en) | Method and apparatus for utilizing a scalable data structure | |
| US7606813B1 (en) | Model consolidation in a database schema | |
| CN103795811B (en) | Information storage and data statistical management method based on meta data storage | |
| CN103312624B (en) | A kind of Message Queuing Services system and method | |
| CN107169083A (en) | Public security bayonet socket magnanimity vehicle data storage and retrieval method and device, electronic equipment | |
| CN104412266A (en) | Method and apparatus for multidimensional data storage and file system with a dynamic ordered tree structure | |
| CN103150394A (en) | Distributed file system metadata management method facing to high-performance calculation | |
| US11068537B1 (en) | Partition segmenting in a distributed time-series database | |
| CN103345521A (en) | Method and device for processing key values in hash table database | |
| CN105159845A (en) | Memory reading method | |
| US8015195B2 (en) | Modifying entry names in directory server | |
| CN105224532A (en) | Data processing method and device | |
| CN112765182A (en) | Data synchronization method and device among cloud server clusters | |
| CN104618304A (en) | Data processing method and data processing system | |
| CN109690522A (en) | A kind of data-updating method, device and storage device based on B+ tree index | |
| CN113811928B (en) | Distributed memory space data storage for K nearest neighbor search | |
| Sourlas et al. | Caching in content-based publish/subscribe systems | |
| CN101963978B (en) | Distributed database management method, device and system | |
| US8463793B2 (en) | Method executed by management server, system, and computer-readable recording medium | |
| CN113127526A (en) | Distributed data storage and retrieval system based on Kubernetes | |
| CN112559459B (en) | Cloud computing-based self-adaptive storage layering system and method |
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 |