CN109918369B - Data storage method and device - Google Patents
Data storage method and device Download PDFInfo
- Publication number
- CN109918369B CN109918369B CN201711337671.7A CN201711337671A CN109918369B CN 109918369 B CN109918369 B CN 109918369B CN 201711337671 A CN201711337671 A CN 201711337671A CN 109918369 B CN109918369 B CN 109918369B
- Authority
- CN
- China
- Prior art keywords
- field
- data
- preset
- level
- stored
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000013500 data storage Methods 0.000 title claims abstract description 57
- 238000000034 method Methods 0.000 title claims abstract description 39
- 230000008569 process Effects 0.000 claims abstract description 5
- 238000005516 engineering process Methods 0.000 abstract description 7
- 230000006870 function Effects 0.000 description 11
- 238000010586 diagram Methods 0.000 description 10
- 238000004364 calculation method Methods 0.000 description 2
- 239000012634 fragment Substances 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000002955 isolation Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000010076 replication Effects 0.000 description 2
- 230000011218 segmentation Effects 0.000 description 2
- 238000000926 separation method Methods 0.000 description 2
- 230000007474 system interaction Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000006378 damage Effects 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
Abstract
The invention provides a data storage method and a data storage device, wherein the method comprises the following steps: determining a plurality of preset fields or field combinations of a multi-level table for storing data, acquiring data parts related to each preset field or field combination in the data to be stored according to a preset sequence of the preset fields or field combinations, and storing the data parts to data storage nodes corresponding to the preset fields or field combinations. By adopting the scheme, the data to be stored is stored in one multi-stage table, even if the load of the data to be stored is huge, the needed data can be obtained in the multi-stage table during subsequent searching, the data is not required to be queried in a plurality of tables, the problem that the use is troublesome due to the fact that a plurality of tables are possibly used for storing data information in the related technology is solved, and the complicated processes during the data storage and the data searching are greatly reduced.
Description
Technical Field
The present invention relates to the field of communications, and in particular, to a data storage method and apparatus.
Background
In the related art, for complex and huge data traffic information, in the use of a distributed database, the traditional method stores different types of data of a service by constructing a plurality of data tables; this results in a very large number of tables in the distributed database, which results in business logic that is complex and difficult to maintain and cumbersome to use.
There is no effective solution to the problem that the storage of data information in the related art may use a plurality of tables, resulting in troublesome use.
Disclosure of Invention
The embodiment of the invention provides a data storage method and a data storage device, which at least solve the problem that a plurality of tables are possibly used for storing data information in the related technology, so that the use is troublesome.
According to an embodiment of the present invention, there is provided a data storage method including: determining a plurality of preset fields or field combinations of a multi-level table for storing data to be stored; and respectively storing partial data to be stored, which correspond to the preset fields or the field combinations, to a data storage node corresponding to the preset fields or the field combinations.
According to another embodiment of the present invention, there is also provided a data storage device including: determining a plurality of preset fields or field combinations of a multi-level table for storing data to be stored; and respectively storing partial data to be stored, which correspond to the preset fields or the field combinations, to a data storage node corresponding to the preset fields or the field combinations.
According to another embodiment of the present invention, there is also provided a storage medium including a stored program, wherein the program, when run, performs the method described in any one of the above alternative embodiments.
According to another embodiment of the present invention, there is also provided a processor for running a program, wherein the program when run performs the method as described in any of the above embodiments.
According to the method and the device, a plurality of preset fields or field combinations of the multi-level table for storing data are determined, data parts related to the preset fields or field combinations in the data to be stored are obtained according to the preset sequence of the preset fields or field combinations, and the data parts are stored to data storage nodes corresponding to the preset fields or field combinations. By adopting the scheme, the data to be stored is stored in one multi-stage table, even if the load of the data to be stored is huge, the needed data can be obtained in the multi-stage table during subsequent searching, the data is not required to be queried in a plurality of tables, the problem that the use is troublesome due to the fact that a plurality of tables are possibly used for storing data information in the related technology is solved, and the complicated processes during the data storage and the data searching are greatly reduced.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiments of the invention and together with the description serve to explain the invention and do not constitute a limitation on the invention. In the drawings:
FIG. 1 is a flow chart of a data storage method according to an embodiment of the invention;
FIG. 2 is a data distribution diagram of a distributed database multi-level table in accordance with a preferred embodiment of the present invention;
FIG. 3 is a hierarchical structure diagram of a multi-level table in accordance with a preferred embodiment of the present invention;
fig. 4 is a schematic structural view of a table_list_ex according to a preferred embodiment of the present invention;
FIG. 5 is a schematic diagram of the relationship between functional modules for a multi-level hierarchy in accordance with a preferred embodiment of the present invention;
FIG. 6 is a system interaction timing diagram of a multi-level slicing scheme in accordance with a preferred embodiment of the present invention;
fig. 7 is a block diagram of a banking instance of a multi-level table in accordance with an embodiment of the present invention.
Detailed Description
The application describes a data storage method which can be applied to various devices or network environments such as terminals or network servers.
The technical problem that this application file aims at is: in the distributed database query technology in the related technology, when a single table is created, local hot spot data with large traffic is encountered, and the problem of hot spot query congestion is easy to occur. The multi-level separation function can manage the same service problem by using the same table, simplify service logic, realize physical separation of different service data in one table and increase safety.
Example 1
In this embodiment, a data storage method running on the above device or network architecture is provided, and fig. 1 is a flowchart of the data storage method according to an embodiment of the present invention, as shown in fig. 1, where the flowchart includes the following steps:
step S102, determining a plurality of preset fields or field combinations of a multi-level table for storing data to be stored;
step S104, storing the partial data to be stored corresponding to each of the plurality of preset fields or field combinations to the data storage nodes corresponding to the preset fields or field combinations.
Through the steps, a plurality of preset fields or field combinations of the multi-level table for storing data are determined, data parts related to the preset fields or field combinations in the data to be stored are acquired according to a preset sequence of the preset fields or field combinations, and the data parts are stored to data storage nodes corresponding to the preset fields or field combinations. By adopting the scheme, the data to be stored is stored in one multi-stage table, even if the load of the data to be stored is huge, the needed data can be obtained in the multi-stage table during subsequent searching, the data is not required to be queried in a plurality of tables, the problem that the use is troublesome due to the fact that a plurality of tables are possibly used for storing data information in the related technology is solved, and the complicated processes during the data storage and the data searching are greatly reduced.
Optionally, storing the part of data to be stored corresponding to each of the plurality of preset fields or field combinations to a data storage node corresponding to the preset field or field combination, respectively, including: determining a priority of a plurality of preset fields or field combinations in the multi-level table; and sequentially storing part of data to be stored corresponding to the preset fields or the field combinations to the data storage nodes according to the priorities of the preset fields or the field combinations.
Optionally, according to the priorities of the plurality of preset fields or the field combinations, sequentially storing a portion of data to be stored corresponding to the preset fields or the field combinations to the data storage node, including: storing a first part of data to be stored corresponding to a preset field or field combination of a first priority; and determining second part of data to be stored corresponding to a preset field or field combination of a second priority in the other data to be stored except the first part of data to be stored, wherein the first priority is higher than the second priority.
Optionally, after storing the partial data to be stored corresponding to the plurality of preset fields or the field combinations to the data storage node corresponding to the preset fields or the field combinations, respectively, determining a first sub-table corresponding to the first preset field or the field combinations in the multi-level table according to the first preset field or the field combinations and the partial data to be stored after storing the partial data to be stored corresponding to the first preset field or the field combinations to the data storage node. In this embodiment, the plurality of sub-tables are part of a multi-level table, and form the multi-level table.
Optionally, storing the multi-level table, and/or, a plurality of sub-tables of the multi-level table, is performed by: the TABLE is stored by a metadata structure table_list_ex memory structure of the TABLE.
Optionally, before determining the plurality of preset fields or the combination of fields of the multi-level table for storing the data to be stored, the method further comprises: the multi-level table is built by a conditional case write statement.
Optionally, before storing the part of data to be stored corresponding to each of the plurality of preset fields or field combinations to the data storage node corresponding to the preset field or field combination, the method further includes: and acquiring the corresponding relation between the plurality of preset fields or the field combination and the data storage node.
The following detailed description is of preferred embodiments of the invention.
The multi-level slicing table has two concepts of distributing attributes and distributing nodes, and the table can be divided into the following steps according to different distributing attributes: hash table, copy table, list table and range table, the distribution node indicates the data tables are distributed on which data storage nodes. The multi-level hierarchical table can construct a plurality of distribution keys according to different service requirements in one table, support a plurality of distribution types for different service data, and distribute the service data to different nodes according to the distribution keys and the distribution types, so as to realize the function of multi-level hierarchical division of a plurality of fields. The multi-level hierarchical table can effectively reduce the problem of local hot spots, and particularly for the situation of complex service scenes, the problem of hot spot query congestion can be effectively solved by creating the multi-level hierarchical table, so that the data query speed is faster, the time is shorter, and the use is simpler.
The invention adopts the following technical scheme:
the invention relates to a multi-level slicing function main technology of a distributed database, which comprises the following steps:
the invention divides the multi-level table into a copy table, a hash table, a range table and a list table according to the distribution attribute of the table. The multi-level sliced table (i.e., the multi-level table of the above embodiment) is implemented based on case write statements. Specific examples are described below.
Core content of the multistage segmentation algorithm: the multi-level slicing syntax is implemented based on case white, and a multi-level table is created according to different slicing fields (field combinations) and distribution strategies. The multi-level table distributes the data of the same service to the same data storage node according to different fields (field combinations) and distribution strategies, and distributes the data of different services to different data storage nodes, so that the physical isolation of the data is realized, and the query statement is simplified.
For multi-level slicing functions:
1. the slicing basis can be a single field, a field combination or a part and combination of fields;
2. when the fragments are single fields, the required fragment field information is taken out through sub-chain subtreeding;
the table created by the multi-level slicing algorithm is called a multi-level table, the multi-level table can select different distributing fields according to different business needs, data in the table is distributed to different nodes according to different distributing strategies (replication and hash, list, range), and a table rule is established: when a multi-level hierarchical table is created, a field (field combination) is selected firstly, and data is distributed to a database storage node according to the field (field combination) and a case write statement, wherein the database storage node is a first-level sub-table; selecting new fields (field combinations) according to service requirements, combining case write statement, distributing strategy to construct a table, a hash table, a range table and a list table, and distributing data to a new database storage node, which is called a second-level sub-table; similarly, five-level sub-tables can be constructed at most, the last level is called a final level sub-table, the other levels are called intermediate level sub-tables, the intermediate level sub-tables can only be list tables or range tables, and the final level can be a copy table, a hash table, a list table and a range table, and the sub-tables form a multi-level table which is shown as a table at a service level. The multi-level table can solve the problem of multi-hot-spot inquiry congestion which cannot be solved by the single-level table, and the execution speed is improved.
There are two types of distributed multi-level slicing syntax, as follows:
grammar one:
grammar two:
the three parameters of case_value and case_ value, statement _list have the following meanings:
the meaning of case_value includes at least one of: 1) A field name; 2) Simple expression (+, -, /); 3) time, date, hour, minute, day, month, year and substr (substring) functions;
the meaning of the value of when_value includes at least one of: 1) A value;
the meaning of the status_list includes at least one of the following: 1) A case branch; 2) A group value; 3) A plurality of groups of distribution strategies;
FIG. 2 is a schematic diagram of data distribution of a multi-level table of a distributed database according to a preferred embodiment of the present invention, as shown in FIG. 2, if a multi-level table t1 is to be created, the creation flow is as follows:
step one, distributing part of service assignment of a multi-level table to a database storage node 1 according to a distribution field (field combination) 1 of t1, which is called a primary sub-table;
step two, the business which does not meet the first level sub-table condition is distributed to the data storage node 2 according to the distribution strategy designation according to the distribution field (field combination) 2 of t1, which is called a second level sub-table;
step three, the traffic which does not meet the above conditions is distributed to the storage node 3 according to the distribution field (field combination) 3 designation of t1, called a three-level sub-table, and so on.
It should be added that the distribution field combination can also be regarded as a new distribution field.
FIG. 3 is a hierarchical structure diagram of a multi-level table according to a preferred embodiment of the present invention, as shown in FIG. 3, a first level of list/range distribution in terms of fields or field combinations; the second layer, distribute list/range according to field or field combination 2; and a third layer, performing replication/hash/list/range distribution according to the field or the field combination 3. In contrast to multi-level TABLEs, conventional distributed database TABLEs are referred to as single-level TABLEs, and in multi-level slicing functions, the multi-level TABLEs, single-level TABLEs, and sub-TABLEs all use a unified memory structure table_list_ex.
Fig. 4 is a schematic structural view of table_list_ex according to a preferred embodiment of the present invention, as shown in fig. 4:
1. the metadata structure TABLE_LIST_EX of the TABLE requires lifecycle management (creation, counting and destruction) of the TABLE_LIST_EX of the last level sub-TABLE it is policing;
2. whether the current TABLE is a MULTI-LEVEL TABLE, a SINGLE-LEVEL TABLE or a filtered SUB-TABLE (MULTI-LEVEL TAB, sine-LEVEL TAB, SUB-LEVEL TAB) can be determined by the enumerated value of the member variable m_table LEVEL of table_list_ex.
FIG. 5 is a schematic diagram of the relationship between functional modules for a multi-level hierarchy in accordance with a preferred embodiment of the present invention, as shown in FIG. 5, the following steps are performed between the SQL layer and the metadata layer:
step 1, the original interface for obtaining the table structure is not changed and is used for obtaining cluster IDs, libraries, tables and the like, but the returned tables can be single-stage tables or multi-stage tables;
step 2, returning to the hierarchical table, wherein the service layer needs to call an interface to judge whether the service layer is a multi-level table, if the service layer is the multi-level table, executing the step 3, otherwise, executing the service layer according to the original service flow;
step 3, transmitting the non-final field value list of the multi-stage table to a metadata interface of the table;
and 4, the metadata module calls a data positioning module (a data positioning layer in the figure), finds out the corresponding last-stage table information, creates a metadata structure of a corresponding sub-table and returns the metadata structure to a structured query language (Structured Query Language, simply called SQL) layer.
Fig. 6 is a system interaction timing diagram of a multi-level slicing scheme according to a preferred embodiment of the present invention, as shown in fig. 6, including the steps of:
step 1, an SQL layer calls the existing interface function for acquiring the table metadata, wherein the interface function comprises a cluster ID, a library, a table and the like;
step 2, the returned metadata structure table_list_ex may be two types of TABLEs: a multi-level table or a single-level table;
step 3, judging that if the table is a multi-level table, jumping to step 4, otherwise executing step 9;
step 4, transmitting the non-final value of the table to a metadata interface function for positioning calculation; it is to be added that the final values are the correlation values of the final list, and the non-final values are the stored correlation values of the multi-level table not comprising the final list.
Step 5, calculating sub-table information of the SQL layer request through a positioning calculation interface;
step 6, returning sub-table information including positioning information
Step 7, creating a sub-TABLE structure TABLE_LIST_EX according to the information;
step 8, returning a sub-TABLE TABLE_LIST_EX pointer;
and 9, the SQL layer service uses the sub-table pointer or the single-level table pointer to execute the original single-level table flow.
Further description of specific embodiments follows:
taking a certain business of a bank as a grammar example, a multi-level table of banking information is built, the specific structure of the multi-level table is shown in fig. 7, and fig. 7 is a banking example structure diagram of the multi-level table according to the specific embodiment of the invention:
firstly, the following information of a database, namely a database name bank and a multi-level table name info, wherein the fields in the table have legal attributes: corporation_property, public and private type: private_type, group information: corporation Information, customer number: customer_number.
The table construction statement of the multi-stage table info is as follows:
from the above, the meaning of the multi-level slicing table with an end level of 4 layers in the above example can be as follows, that is, fig. 7 includes the following:
a first layer:
list distribution is carried out according to corporation_property, specifically, records with legal attributes of "Zhongxin Bank London" are distributed to a data storage node g9 according to the field corporation_property, records with corporation_property of "Zhongxin Bank New York" are distributed to a data storage node g10, and other record distribution conditions refer to a second layer;
a second layer:
according to the private_type, performing list distribution, specifically, according to the private_type, performing hash distribution on public and Private data according to a customer_number field of a third layer, and according to a hash rule, distributing the public and Private data to data storage nodes g1, g2, g3, g4 and g5, wherein other data distribution conditions refer to the third layer;
third layer:
if the public and private types are determined to be outside private, list distribution is carried out according to the corporation_information, particularly, data of which the group Information is five-ore group or optical big group is distributed to a data storage node g6 according to the field corporation_information, and other data distribution conditions refer to a fourth layer;
if the public and private type is determined to be 'private', hash distribution is carried out according to the field customer_number, and data are distributed to data storage nodes g1, g2, g3, g4 and g 5.
Fourth layer:
hash distribution is performed according to the field customer_number, and data are distributed to the data storage nodes g7 and g 8.
The beneficial effects are that: compared with the traditional distributed database single table, the method can realize service data management through only one table, can realize data isolation at physical level, and simplifies complex service scenes into scenes which can be realized through only one table by the multi-stage slicing function, so that improvement is achieved in improving the performance of a distributed query system, and the purpose of improving the distributed query speed is achieved.
The invention creates the multi-stage segmentation table in the distributed database, and distributes the data of different types in a service into different sections of a logic table, thereby simplifying the service logic, and the service can judge and accurately position the specific data section by only providing an SQL sentence.
From the description of the above embodiments, it will be clear to a person skilled in the art that the method according to the above embodiments may be implemented by means of software plus the necessary general hardware platform, but of course also by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art in the form of a software product stored in a storage medium (e.g. ROM/RAM, magnetic disk, optical disk) comprising instructions for causing a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform the method according to the embodiments of the present invention.
Example two
In this embodiment, a data storage device is further provided, and the device is used to implement the foregoing embodiments and preferred embodiments, and will not be described in detail. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. While the means described in the following embodiments are preferably implemented in software, implementation in hardware, or a combination of software and hardware, is also possible and contemplated.
According to an embodiment of the present invention, there is provided a data storage device including:
a determining module, configured to determine a plurality of preset fields or field combinations of a multi-level table for storing data to be stored;
and the storage module is used for respectively storing partial data to be stored, which correspond to the preset fields or the field combinations, to the data storage nodes corresponding to the preset fields or the field combinations.
It should be noted that each of the above modules may be implemented by software or hardware, and for the latter, it may be implemented by, but not limited to: the modules are all located in the same processor; alternatively, the above modules may be located in different processors in any combination.
Example III
According to another embodiment of the present invention, there is also provided a processor for running a program, wherein the program when run performs the method as described in any of the above alternative embodiments.
Example IV
According to another embodiment of the present invention, there is also provided a storage medium including a stored program, wherein the program, when run, performs the method described in any one of the above alternative embodiments.
It will be appreciated by those skilled in the art that the modules or steps of the invention described above may be implemented in a general purpose computing device, they may be concentrated on a single computing device, or distributed across a network of computing devices, they may alternatively be implemented in program code executable by computing devices, so that they may be stored in a memory device for execution by computing devices, and in some cases, the steps shown or described may be performed in a different order than that shown or described, or they may be separately fabricated into individual integrated circuit modules, or multiple modules or steps within them may be fabricated into a single integrated circuit module for implementation. Thus, the present invention is not limited to any specific combination of hardware and software.
The above description is only of the preferred embodiments of the present invention and is not intended to limit the present invention, but various modifications and variations can be made to the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method of data storage, comprising:
determining a plurality of preset fields or field combinations of a multi-level table for storing data to be stored, wherein the multi-level table at least comprises a distribution attribute, and the distribution attribute is used for dividing the multi-level table into a copying table, a hash table, a list table and a range table;
respectively storing partial data to be stored corresponding to each of the plurality of preset fields or field combinations to a data storage node corresponding to the preset field or field combination;
the creating process of the multi-level table comprises the following steps:
distributing part of the data to be stored corresponding to the first target preset field or the first target field combination to a first data storage node according to the first target preset field or the first target field combination and combining with a case write statement to obtain a first level sub-table;
according to a second target preset field or a second target field combination, combining a case write statement and a distribution strategy to construct a table, a hash table, a range table and a list table, distributing part of the data to be stored corresponding to the second target preset field or the second target field combination to a second data storage node to obtain a second level sub-table, until a maximum of five levels of sub-tables are constructed, wherein the last level is called a final level sub-table, the other levels are called intermediate level sub-tables, and the types of the intermediate level sub-tables comprise at least one of the following: list table, range table, the type of the said last level sub-table includes at least one of the following: copy table, hash table, list table, range table.
2. The method according to claim 1, wherein storing the portion of the data to be stored corresponding to each of the plurality of preset fields or field combinations to the data storage node corresponding to the preset field or field combination, respectively, comprises:
determining a priority of a plurality of preset fields or field combinations in the multi-level table;
and sequentially storing part of data to be stored corresponding to the preset fields or the field combinations to the data storage nodes according to the priorities of the preset fields or the field combinations.
3. The method according to claim 2, wherein sequentially storing the portion of the data to be stored corresponding to the predetermined field or the combination of fields to the data storage node according to the priorities of the plurality of predetermined fields or the combination of fields, comprises:
storing a first part of data to be stored corresponding to a preset field or field combination of a first priority;
and determining second parts of data to be stored corresponding to a preset field or field combination of a second priority in the other parts of data to be stored except the first parts of data to be stored, wherein the first priority is higher than the second priority.
4. The method of claim 1, wherein after storing the portions of the data to be stored corresponding to each of the plurality of preset fields or field combinations to the data storage nodes corresponding to the preset fields or field combinations, respectively, the method further comprises:
after storing part of data to be stored corresponding to a first preset field or field combination to a data storage node, determining a first sub-table corresponding to the first preset field or field combination in the multi-level table according to the first preset field or field combination and the part of data to be stored.
5. The method of claim 4, wherein storing the multi-level table and/or the plurality of sub-tables of the multi-level table is performed by:
the TABLE is stored by a metadata structure table_list_ex memory structure of the TABLE.
6. The method of claim 1, wherein prior to determining the plurality of preset fields or combinations of fields for storing the multi-level table of data to be stored, the method further comprises:
and building the multi-level table through a conditional case write statement.
7. The method of claim 1, wherein before storing the portion of the data to be stored corresponding to each of the plurality of preset fields or field combinations to the data storage node corresponding to the preset field or field combination, the method further comprises:
and acquiring the corresponding relation between the plurality of preset fields or the field combination and the data storage node.
8. A data storage device, comprising:
a determining module, configured to determine a plurality of preset fields or field combinations of a multi-level table for storing data to be stored, where the multi-level table includes at least a distribution attribute, and the distribution attribute is configured to divide the multi-level table into a copy table, a hash table, a list table, and a range table;
a storage module for storing the partial data to be stored corresponding to each of the plurality of preset fields or field combinations to the data storage node corresponding to the preset field or field combination
The creating process of the multi-level table comprises the following steps:
distributing part of the data to be stored corresponding to the first target preset field or the first target field combination to a first data storage node according to the first target preset field or the first target field combination and combining with a case write statement to obtain a first level sub-table;
according to a second target preset field or a second target field combination, combining a case write statement and a distribution strategy to construct a table, a hash table, a range table and a list table, distributing part of the data to be stored corresponding to the second target preset field or the second target field combination to a second data storage node to obtain a second level sub-table, until a maximum of five levels of sub-tables are constructed, wherein the last level is called a final level sub-table, the other levels are called intermediate level sub-tables, and the types of the intermediate level sub-tables comprise at least one of the following: list table, range table, the type of the said last level sub-table includes at least one of the following: copy table, hash table, list table, range table.
9. A storage medium comprising a stored program, wherein the program when run performs the method of any one of the preceding claims 1 to 7.
10. A processor, wherein the processor is configured to run a program, wherein,
the program when run performs the method of any of the preceding claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711337671.7A CN109918369B (en) | 2017-12-13 | 2017-12-13 | Data storage method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711337671.7A CN109918369B (en) | 2017-12-13 | 2017-12-13 | Data storage method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109918369A CN109918369A (en) | 2019-06-21 |
| CN109918369B true CN109918369B (en) | 2024-01-23 |
Family
ID=66959356
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711337671.7A Active CN109918369B (en) | 2017-12-13 | 2017-12-13 | Data storage method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109918369B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110472216B (en) * | 2019-08-19 | 2022-12-06 | 北京明略软件系统有限公司 | Method and device for determining field, storage medium and electronic device |
| CN114625798B (en) * | 2020-12-14 | 2023-03-24 | 金篆信科有限责任公司 | Data retrieval method and device, electronic equipment and storage medium |
| CN115396319B (en) * | 2021-05-19 | 2023-10-27 | 中国移动通信集团有限公司 | Data stream slicing method, device, equipment and storage medium |
| CN113704306B (en) * | 2021-08-31 | 2024-01-30 | 上海观安信息技术股份有限公司 | Database data processing method and device, storage medium and electronic equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101996250A (en) * | 2010-11-15 | 2011-03-30 | 中国科学院计算技术研究所 | Hadoop-based mass stream data storage and query method and system |
| CN103455335A (en) * | 2013-09-12 | 2013-12-18 | 苏州灵巴巴网络科技有限公司 | Multilevel classification Web implementation method |
| CN106095788A (en) * | 2016-05-27 | 2016-11-09 | 杭州华三通信技术有限公司 | A kind of date storage method and device |
| CN106682215A (en) * | 2016-12-30 | 2017-05-17 | 华为技术有限公司 | Data processing method and management node |
| CN106855866A (en) * | 2015-12-09 | 2017-06-16 | 北大方正集团有限公司 | XML document storage method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104021161B (en) * | 2014-05-27 | 2018-06-15 | 华为技术有限公司 | A kind of clustering storage method and device |
-
2017
- 2017-12-13 CN CN201711337671.7A patent/CN109918369B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101996250A (en) * | 2010-11-15 | 2011-03-30 | 中国科学院计算技术研究所 | Hadoop-based mass stream data storage and query method and system |
| CN103455335A (en) * | 2013-09-12 | 2013-12-18 | 苏州灵巴巴网络科技有限公司 | Multilevel classification Web implementation method |
| CN106855866A (en) * | 2015-12-09 | 2017-06-16 | 北大方正集团有限公司 | XML document storage method and device |
| CN106095788A (en) * | 2016-05-27 | 2016-11-09 | 杭州华三通信技术有限公司 | A kind of date storage method and device |
| CN106682215A (en) * | 2016-12-30 | 2017-05-17 | 华为技术有限公司 | Data processing method and management node |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109918369A (en) | 2019-06-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109918369B (en) | Data storage method and device | |
| US11288282B2 (en) | Distributed database systems and methods with pluggable storage engines | |
| CN108427684B (en) | Data query method and device and computing equipment | |
| Kossmann et al. | Cloudy: A modular cloud storage system | |
| US20130191523A1 (en) | Real-time analytics for large data sets | |
| CN108683692B (en) | Service request processing method and device | |
| CN107085570B (en) | Data processing method, application server and router | |
| CN109033109B (en) | Data processing method and system | |
| US9830333B1 (en) | Deterministic data replication with conflict resolution | |
| US8015195B2 (en) | Modifying entry names in directory server | |
| JP2018506775A (en) | Identifying join relationships based on transaction access patterns | |
| WO2016191995A1 (en) | Method and device for partitioning association table in distributed database | |
| CN103324487A (en) | Method for achieving SaaS for workflow engine | |
| US10592153B1 (en) | Redistributing a data set amongst partitions according to a secondary hashing scheme | |
| JP2022543306A (en) | Blockchain data processing method, apparatus, equipment and readable storage medium | |
| US20230099501A1 (en) | Masking shard operations in distributed database systems | |
| CN110175202A (en) | The method and system of the outer connection of table for database | |
| EP3061011B1 (en) | Method for optimizing index, master database node and subscriber database node | |
| CN114416884B (en) | Method and device for connecting partition table | |
| US20230153300A1 (en) | Building cross table index in relational database | |
| KR101256922B1 (en) | Method for distributed decision tree induction algorithm for prediction and analysis | |
| US9092472B1 (en) | Data merge based on logical segregation | |
| US9063773B2 (en) | Automatic parallelism tuning for apply processes | |
| CN111680069A (en) | Database access method and device | |
| US11841857B2 (en) | Query efficiency using merged columns |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20220325 Address after: 100176 602, 6 / F, building 6, courtyard 10, KEGU 1st Street, Daxing District, Beijing (Yizhuang group, high-end industrial area, Beijing Pilot Free Trade Zone) Applicant after: Jinzhuan Xinke Co.,Ltd. Address before: 518057 No. 55 South Science and technology road, Shenzhen, Guangdong, Nanshan District Applicant before: ZTE Corp. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |