CN109918369A - Date storage method and device - Google Patents
Date storage method and device Download PDFInfo
- Publication number
- CN109918369A CN109918369A CN201711337671.7A CN201711337671A CN109918369A CN 109918369 A CN109918369 A CN 109918369A CN 201711337671 A CN201711337671 A CN 201711337671A CN 109918369 A CN109918369 A CN 109918369A
- Authority
- CN
- China
- Prior art keywords
- field
- data
- stored
- combination
- field combination
- 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
- 238000000034 method Methods 0.000 title claims abstract description 40
- 238000003860 storage Methods 0.000 title claims abstract description 28
- 238000013500 data storage Methods 0.000 claims description 4
- 238000005516 engineering process Methods 0.000 abstract description 8
- 230000008569 process Effects 0.000 abstract description 2
- 238000009826 distribution Methods 0.000 description 40
- 239000012634 fragment Substances 0.000 description 23
- 238000010586 diagram Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 10
- 238000002955 isolation Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 239000004744 fabric Substances 0.000 description 2
- 230000007474 system interaction Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
- 230000003362 replicative effect Effects 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of date storage method and devices, wherein, this method comprises: determining the multiple preset fields or field combination of multi-level table for storing data, according to the predetermined order of multiple preset fields or field combination, data portion relevant to each preset field or field combination in data to be stored is obtained, which is stored to data memory node corresponding with the preset field or field combination.Using the above scheme, data to be stored is stored in a multi-level table, even if data to be stored load is huge, the data of needs can be got when subsequent lookup in the multi-level table, it need not go in multiple tables to inquire data, solve the problems, such as that storing data information may use multiple tables and lead to using trouble in the related technology, cumbersome process when significantly reducing storing data and searching data.
Description
Technical field
The present invention relates to the communications fields, in particular to a kind of date storage method and device.
Background technique
In the related art, for complicated and huge data volume business information, in distributed data base in use, passing
System method is all the different classes of data by constructing multiple tables of data come storage service；It will lead to distributed data base in this way
In table it is very more, becoming complexity so as to cause service logic should not safeguard, also be more troublesome in use.
Aiming at the problem that storing data information in the related technology may use multiple tables and lead to using trouble, do not have also at present
There is effective solution scheme.
Summary of the invention
The embodiment of the invention provides a kind of date storage method and devices, at least to solve storing data in the related technology
The problem of information may use multiple tables and lead to using trouble.
According to one embodiment of present invention, a kind of date storage method is provided, comprising: determine for storing wait store
The multiple preset fields or field combination of the multi-level table of data；It respectively will be respectively right with the multiple preset field or field combination
The part data to be stored answered is stored to data memory node corresponding with preset field or field combination.
According to another embodiment of the invention, additionally provide a kind of data storage device, comprising: determine for store to
The multiple preset fields or field combination of the multi-level table of storing data；It respectively will be each with the multiple preset field or field combination
Self-corresponding part data to be stored is stored to data memory node corresponding with preset field or field combination.
According to another embodiment of the invention, a kind of storage medium is additionally provided, the storage medium includes storage
Program, wherein described program executes method described in above-mentioned any one of alternative embodiment when running.
According to another embodiment of the invention, a kind of processor is additionally provided, the processor is used to run program,
In, described program executes method described in any one of above-described embodiment when running.
Through the invention, the multiple preset fields or field combination for determining multi-level table for storing data, according to multiple
The predetermined order of preset field or field combination obtains number relevant to each preset field or field combination in data to be stored
According to part, which is stored to data memory node corresponding with the preset field or field combination.Using above-mentioned side
Case stores data to be stored in a multi-level table, even if data to be stored load is huge, when subsequent lookup can be more at this
The data of needs are got in grade table, it is not necessary to go in multiple tables to inquire data, solve in the related technology that storing data information can
Multiple tables can be used and cumbersome stream the problem of lead to using trouble, when significantly reducing storing data and searching data
Journey.
Detailed description of the invention
The drawings described herein are used to provide a further understanding of the present invention, constitutes part of this application, this hair
Bright illustrative embodiments and their description are used to explain the present invention, and are not constituted improper limitations of the present invention.In the accompanying drawings:
Fig. 1 is the flow chart of date storage method according to an embodiment of the present invention；
Fig. 2 is the data distribution schematic diagram of distributed data base multi-level table according to the preferred embodiment of the invention；
Fig. 3 is the hierarchical chart of multi-level table according to the preferred embodiment of the invention；
Fig. 4 is the structural schematic diagram of TABLE_LIST_EX according to the preferred embodiment of the invention；
Fig. 5 is the relation schematic diagram according to the preferred embodiment of the invention between multistage fragment functional module；
Fig. 6 is the system interaction timing diagram of multistage slicing scheme according to the preferred embodiment of the invention；
Fig. 7 is the banking example block diagram of the multi-level table of specific embodiment according to the present invention.
Specific embodiment
Present specification describes a kind of date storage method, can be applied to various terminals or network server etc. and sets
Standby or network environment.
Present specification for the technical issues of be: in distributed networks database query technology in the related technology, creation is single
When table, the problem of encountering the big hot localised points data of portfolio, be easy to appear hotspot query congestion, present specification is in order to solve
This difficult point proposes a kind of multistage fragment optimization method.Multistage fragment function can both have been managed same using same table
Traffic issues simplify service logic, and the physical isolation of different business data can also be realized in a table, increase safety.
Embodiment one
A kind of date storage method for running on above equipment or the network architecture is provided in the present embodiment, and Fig. 1 is root
According to the flow chart of the date storage method of the embodiment of the present invention, as shown in Figure 1, the process includes the following steps:
Step S102 determines multiple preset fields or field combination for storing the multi-level table of data to be stored；
Step S104 will be deposited respectively with multiple preset field or the corresponding part data to be stored of field combination
Chu Zhiyu preset field or the corresponding data memory node of field combination.
Through the above steps, the multiple preset fields or field combination for determining multi-level table for storing data, according to more
The predetermined order of a preset field or field combination obtains relevant to each preset field or field combination in data to be stored
Data portion stores the data portion to data memory node corresponding with the preset field or field combination.Using above-mentioned
Scheme stores data to be stored in a multi-level table, even if data to be stored load is huge, when subsequent lookup can be at this
The data of needs are got in multi-level table, it is not necessary to go in multiple tables to inquire data, solve storing data information in the related technology
Multiple tables may be used and cumbersome stream the problem of lead to using trouble, when significantly reducing storing data and searching data
Journey.
Optionally, it will be stored respectively with multiple preset field or the corresponding part data to be stored of field combination
To data memory node corresponding with preset field or field combination, comprising: determine multiple preset fields in the multi-level table or
The priority of field combination；According to multiple preset field or the priority of field combination, successively store and preset field or word
The corresponding part data to be stored of Duan Zuhe is to data memory node.
Optionally, it according to multiple preset field or the priority of field combination, successively stores and preset field or field
Corresponding part data to be stored is combined to data memory node, comprising: the preset field or field of storage and the first priority
Combine corresponding first part's data to be stored；In other data to be stored in addition to first part's data to be stored
In, determine corresponding with the preset field of the second priority or field combination second part data to be stored, wherein this is first excellent
First grade is superior to second priority.
Optionally, it will be stored respectively with multiple preset field or the corresponding part data to be stored of field combination
After to data memory node corresponding with preset field or field combination, in storage and the first preset field or field combination pair
After the part data to be stored to data memory node answered, wait depositing according to first preset field or field combination and the part
Data are stored up, determine the first sublist corresponding with first preset field or field combination in the multi-level table.It should be noted that this
The multiple sublists formed in embodiment are a part of multi-level table, constitute multi-level table.
Optionally, it carries out storing the multi-level table in the following manner, and/or, multiple sublists of the multi-level table: pass through table
Metadata structure TABLE_LIST_EX internal storage structure is stored.
Optionally it is determined that before the multiple preset fields or field combination of the multi-level table for being used to store data to be stored, it should
Method further include: the multi-level table is built by condition case when sentence.
Optionally, it will be stored respectively with multiple preset field or the corresponding part data to be stored of field combination
Before to data memory node corresponding with preset field or field combination, this method further include: obtain multiple preset field
Or the corresponding relationship of field combination and data memory node.
It is described in detail below with reference to the preferred embodiment of the present invention.
Multistage fragment table has distribution two concepts of attribute and distribution node, can be by table point according to different distribution attributes
Are as follows: Hash hash table, duplication table, list table and range range table, distribution node are then to indicate which number is tables of data be all distributed in
According on memory node.Multistage fragment table can need to construct multiple distribution keys according to different business in a table, to difference
Business datum support a variety of distribution type, business datum is distributed on different nodes according to distribution key and distribution type,
Realize the function of multiple field multistage fragments.Multistage fragment table can effectively reduce hot localised points problem, particularly with business
The situation of scene complexity can effectively solve the problems, such as hotspot query congestion by creating multistage fragment table, make data query fast
Faster, the time is shorter for degree, using becoming simpler.
The invention adopts the following technical scheme:
Distributed data base multistage fragment function major technique of the present invention are as follows:
Multi-level table can be divided into according to the distribution attribute of table by duplication table, hash table, range table and list in the present invention
Table.The multistage fragment table (i.e. the multi-level table of above-described embodiment) is based on case when sentence and is realized.In embodiment below
There is specific record.
The core content of multistage slicing algorithm: multistage fragment grammer is based on case when and is realized, according to different points
Piece field (field combination) and distribution policy are created that multi-level table.Multi-level table is according to different fields (field combination) and distribution plan
Slightly by the data distribution of same business to same data memory node, the data distribution of different business is deposited to different data
It stores up on node, realizes the physical isolation of data, simplify query statement.
For multistage fragment function:
1. fragment is according to part, the combination that can be independent field, field combination or field；
2. fragment is independent field, support to take out the fragment field information needed by subchain substring；
It is known as multi-level table by the table that multistage slicing algorithm creates, multi-level table can need to choose not according to different business
With distribution field, according to different distribution policies (duplication, hash, list, range) by data distribution in table to different nodes,
It builds table rule: when creating multistage fragment table, needing first to select a field (field combination), according to this field (field combination)
In conjunction with case when sentence by data distribution to database purchase node, this is first order sublist；It needs to select again according to business
New field (field combination) is selected in conjunction with case when sentence, distribution policy building tabulation, hash table, range table and list
Table, by data distribution to new database purchase node, referred to as second level sublist；And so on, it can at most construct Pyatyi
Sublist, afterbody are known as final stage sublist, other grades are known as intergrade sublist, intergrade sublist can only be list table or
Range table, final stage can be duplication table, hash table, list table and range table, these sublists constitute a multi-level table, in business
Level is shown as a table.Multi-level table can solve the indeterminable more hotspot query congestion problems of single-stage table, and raising executes speed
Degree.
There are two types of distributed multi-stage fragment grammers, as follows:
Grammer one:
Grammer two:
Wherein, the meaning of tri- parameters of case_value, when_value, statement_list is as follows:
The meaning of case_value includes at least one of: 1) field name；2) structure (+,-, *, /)；3)
Time, date, hour, minute, day, month, year and substr (substring) function；
The meaning of when_value includes at least one of: 1) value value；
The meaning of statement_list includes at least one of: 1) case branch；2) group value；3) multiple groups are distributed
Strategy；
Fig. 2 is the data distribution schematic diagram of distributed data base multi-level table according to the preferred embodiment of the invention, such as Fig. 2 institute
Show, if to create a multi-level table t1, visioning procedure is as follows:
The partial service of multi-level table is specified according to the distribution field (field combination) 1 of t1 and is distributed to database by step 1
On memory node 1, referred to as level-one sublist；
Step 2 is unsatisfactory for the business of level-one sublist condition according to the distribution field (field combination) 2 of t1 according to distribution plan
It slightly specifies and is distributed on data memory node 2, referred to as second level sublist；
Step 3, the business for being unsatisfactory for conditions above are distributed to storage according to the distribution field (field combination) 3 of t1 is specified
On node 3, referred to as three-level sublist, and so on.
You need to add is that distribution field combination can also regard a new distribution field as.
Fig. 3 is the hierarchical chart of multi-level table according to the preferred embodiment of the invention, as shown in figure 3, first layer, according to word
Section or field combination carry out list/range distribution；The second layer carries out list/range distribution according to field or field combination 2；
Third layer carries out replicating/hash/list/range distribution according to field or field combination 3.For multi-level table, tradition
Distributed data base table be referred to as single-stage table, multi-level table, single-stage table and sublist are all using unified in multistage fragment function
Internal storage structure TABLE_LIST_EX.
Fig. 4 is the structural schematic diagram of TABLE_LIST_EX according to the preferred embodiment of the invention, as shown in Figure 4:
1, the TABLE_LIST_EX for the final stage sublist that the metadata structure TABLE_LIST_EX of table needs to administer it into
Row life cycle management (creation is counted and destroyed)；
2, it may determine that current table is multistage by the enumerated value of the member variable m_tableLevel of TABLE_LIST_EX
Table, single-stage table still pass through filtered sublist (MULTI_LEVEL_TAB, SINGLE_LEVEL_TAB, SUB_LEVEL_
TAB)。
Fig. 5 is the relation schematic diagram according to the preferred embodiment of the invention between multistage fragment functional module, such as Fig. 5 institute
Show, execute following steps between SQL layer and metadata layer:
Step 1, original interface for obtaining table structure do not have to variation, for obtaining cluster ID, library, table etc., but return
Table may be single-stage table or multi-level table；
Step 2 returns to hierarchical table, and operation layer needs calling interface to judge whether it is multi-level table, then holds if it is multi-level table
Otherwise row step 3 is executed according to original operation flow；
Step 3, the metadata interface that the non-final stage field value list of multi-level table is all passed to table；
Step 4, meta data block call data locating module (the data alignment layers in figure), find corresponding final stage table letter
It ceases and the metadata structure for creating corresponding sublist returns to structured query language (Structured Query Language, letter
Referred to as SQL) layer.
Fig. 6 is the system interaction timing diagram of multistage slicing scheme according to the preferred embodiment of the invention, as shown in fig. 6, packet
Include following steps:
Step 1, SQL layer call existing acquisition table metadata interface function, including cluster ID, library and table etc.；
Step 2, the metadata structure TABLE_LIST_EX returned may be two kinds of table: multi-level table or single-stage table；
Step 3 judges then to jump to step 4 if it is multi-level table, no to then follow the steps 9；
The non-final stage value of table is passed to metadata interface function progress location Calculation by step 4；You need to add is that end
Grade value is the correlation of final stage list, and non-final stage value does not include the correlation values of the storage of the multi-level table of final stage list.
Step 5, the sublist information that SQL layer request is calculated by location Calculation interface；
Step 6 returns to sublist information, including location information
Step 7, foundation information creating sub-table structure TABLE_LIST_EX；
Step 8 returns to sublist TABLE_LIST_EX pointer；
Step 9, SQL layer business execute original single-stage surface low journey using the sublist pointer or single-stage list index.
It further illustrates combined with specific embodiments below:
Using certain business of bank as grammer example, the multi-level table of a banking information, specific structure such as Fig. 7 institute are built
Show, Fig. 7 is the banking example block diagram of the multi-level table of specific embodiment according to the present invention:
What is illustrated first is the following information of database, database name bank, multistage table name info, and field has legal person in table
Attribute: Corporate_Property, public and private type: Private_type, group's information: Corporate_Information,
Customer ID: Customer_Number.
Multi-level table info's builds table statement are as follows:
As shown in the above, specify the meaning that an end grade is 4 layers of multistage fragment table can be as follows in upper example,
I.e. Fig. 7 includes the following contents:
First layer:
List distribution is carried out according to Corporate_Property, specifically, according to field Corporate_Property
The humanized record for " China Citic Bank London " of method is distributed on data memory node g9, is by Corporate_Property
The record in " China Citic Bank New York " is distributed on data memory node g10, other record distribution situations refer to the second layer；
The second layer:
List distribution is carried out according to Private_type, specifically, being by public and private type according to field Private_type
The data of " to private " carry out hash distribution further according to the Customer_Number field of third layer, are distributed to according to hash rule
On data memory node g1, g2, g3, g4, g5, other data distribution situations refer to third layer；
Third layer:
If it is determined that public and private type is then to carry out list distribution according to Corporate_Information to other than private,
Specially according to field Corporate_Information by group's information be " Minmetals Group " or " Ever Bright Group " data
It is distributed on data memory node g6, other data distribution situations refer to the 4th layer；
If it is determined that public and private type is " to private ", hash distribution is carried out according to field Customer_Number, by data point
Cloth is to data memory node g1, g2, g3, on g4, g5.
4th layer:
Hash distribution is carried out according to field Customer_Number, by data distribution to data memory node g7, on g8.
The utility model has the advantages that compared with traditional distributed data base list table, can only pass through one using the method for the invention
It opens table and realizes Service Data Management, while being able to achieve the data isolation of physical level, multistage fragment function is simple by complicated business scene
The scene for only needing a table that can realize is turned to, therefore achieves progress in the performance for promoting distributed Query Processing System,
Achieve the purpose that improve distributed query speed.
The present invention creates multistage fragment table in distributed data base, and data different classes of in a business are divided respectively
Cloth is into the different sections of a logical table, to simplify service logic, business only needs to provide a SQL statement, multistage
Fragment table inherent logic is it may determine that and be pin-pointed to specific data interval.
Through the above description of the embodiments, those skilled in the art can be understood that according to above-mentioned implementation
The method of example can be realized by means of software and necessary general hardware platform, naturally it is also possible to by hardware, but it is very much
In the case of the former be more preferably embodiment.Based on this understanding, technical solution of the present invention is substantially in other words to existing
The part that technology contributes can be embodied in the form of software products, which is stored in a storage
In medium (such as ROM/RAM, magnetic disk, CD), including some instructions are used so that a terminal device (can be mobile phone, calculate
Machine, server or network equipment etc.) execute method described in each embodiment of the present invention.
Embodiment two
A kind of data storage device is additionally provided in the present embodiment, and the device is real for realizing above-described embodiment and preferably
Mode is applied, the descriptions that have already been made will not be repeated.As used below, the soft of predetermined function may be implemented in term " module "
The combination of part and/or hardware.Although device described in following embodiment is preferably realized with software, hardware, or
The realization of the combination of software and hardware is also that may and be contemplated.
According to an embodiment of the invention, providing a kind of data storage device, comprising:
Determining module, for determining multiple preset fields or field combination for storing the multi-level table of data to be stored；
Memory module, for respectively will be with the multiple preset field or the corresponding part of field combination number to be stored
According to storing to data memory node corresponding with preset field or field combination.
It should be noted that above-mentioned modules can be realized by software or hardware, for the latter, Ke Yitong
Following manner realization is crossed, but not limited to this: above-mentioned module is respectively positioned in same processor；Alternatively, above-mentioned modules are with any
Combined form is located in different processors.
Embodiment three
According to another embodiment of the invention, a kind of processor is additionally provided, the processor is used to run program,
In, described program executes method described in above-mentioned any one of alternative embodiment when running.
Example IV
According to another embodiment of the invention, a kind of storage medium is additionally provided, the storage medium includes storage
Program, wherein described program executes method described in above-mentioned any one of alternative embodiment when running.
Obviously, those skilled in the art should be understood that each module of the above invention or each step can be with general
Computing device realize that they can be concentrated on a single computing device, or be distributed in multiple computing devices and formed
Network on, optionally, they can be realized with the program code that computing device can perform, it is thus possible to which they are stored
It is performed by computing device in the storage device, and in some cases, it can be to be different from shown in sequence execution herein
Out or description the step of, perhaps they are fabricated to each integrated circuit modules or by them multiple modules or
Step is fabricated to single integrated circuit module to realize.In this way, the present invention is not limited to any specific hardware and softwares to combine.
The foregoing is only a preferred embodiment of the present invention, is not intended to restrict the invention, for the skill of this field
For art personnel, the invention may be variously modified and varied.All within the spirits and principles of the present invention, made any to repair
Change, equivalent replacement, improvement etc., should all be included in the protection scope of the present invention.
Claims (10)
1. a kind of date storage method characterized by comprising
Determine the multiple preset fields or field combination for storing the multi-level table of data to be stored；
Respectively will with the multiple preset field or the corresponding part data to be stored of field combination, store to predetermined word
Section or the corresponding data memory node of field combination.
2. the method according to claim 1, wherein respectively will be each with the multiple preset field or field combination
Self-corresponding part data to be stored is stored to data memory node corresponding with preset field or field combination, comprising:
Determine the priority of the multiple preset fields or field combination in the multi-level table；
According to the multiple preset field or the priority of field combination, successively store corresponding with preset field or field combination
Part data to be stored is to data memory node.
3. according to the method described in claim 2, it is characterized in that, according to the preferential of the multiple preset field or field combination
Grade successively stores part corresponding with preset field or field combination data to be stored to data memory node, comprising:
Store first part's data to be stored corresponding with the preset field of the first priority or field combination；
It is determining pre- with the second priority in other described data to be stored in addition to first part's data to be stored
If field or the corresponding second part data to be stored of field combination, wherein first priority is superior to described
Two priority.
4. the method according to claim 1, wherein respectively will be each with the multiple preset field or field combination
Self-corresponding part data to be stored is stored to data memory node corresponding with preset field or field combination, described
Method further include:
After storing part data to be stored to data memory node corresponding with the first preset field or field combination, foundation
First preset field or field combination and the part data to be stored determine default with described first in the multi-level table
Field or corresponding first sublist of field combination.
5. according to the method described in claim 4, it is characterized in that, carry out storing the multi-level table in the following manner, and/
Or, multiple sublists of the multi-level table:
It is stored by the metadata structure TABLE_LIST_EX internal storage structure of table.
6. the method according to claim 1, wherein determining the multiple of the multi-level table for storing data to be stored
Before preset field or field combination, the method also includes:
The multi-level table is built by condition case when sentence.
7. the method according to claim 1, wherein respectively will be each with the multiple preset field or field combination
Self-corresponding part data to be stored is stored to before data memory node corresponding with preset field or field combination, described
Method further include:
Obtain the corresponding relationship of the multiple preset field or field combination and data memory node.
8. a kind of data storage device characterized by comprising
Determining module, for determining multiple preset fields or field combination for storing the multi-level table of data to be stored；
Memory module, for respectively will with the multiple preset field or the corresponding part data to be stored of field combination,
It stores to data memory node corresponding with preset field or field combination.
9. a kind of storage medium, which is characterized in that the storage medium includes the program of storage, wherein when described program is run
Execute method described in 1 to 7 any one of the claims.
10. a kind of processor, which is characterized in that the processor is for running program, wherein on being executed when described program is run
State method described in any one of claim 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 true CN109918369A (en) | 2019-06-21 |
| CN109918369B 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) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110472216A (en) * | 2019-08-19 | 2019-11-19 | 北京明略软件系统有限公司 | Determination method, apparatus, storage medium and the electronic device of field |
| CN113704306A (en) * | 2021-08-31 | 2021-11-26 | 上海观安信息技术股份有限公司 | Database data processing method and device, storage medium and electronic equipment |
| CN114625798A (en) * | 2020-12-14 | 2022-06-14 | 金篆信科有限责任公司 | Data retrieval method and device, electronic equipment and storage medium |
| CN115396319A (en) * | 2021-05-19 | 2022-11-25 | 中国移动通信集团有限公司 | Data stream fragmentation method, device, equipment and storage medium |
Citations (6)
| 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 |
| US20170075657A1 (en) * | 2014-05-27 | 2017-03-16 | Huawei Technologies Co.,Ltd. | Clustering storage method and apparatus |
| 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 |
-
2017
- 2017-12-13 CN CN201711337671.7A patent/CN109918369B/en active Active
Patent Citations (6)
| 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 |
| US20170075657A1 (en) * | 2014-05-27 | 2017-03-16 | Huawei Technologies Co.,Ltd. | Clustering storage method and apparatus |
| 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 |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110472216A (en) * | 2019-08-19 | 2019-11-19 | 北京明略软件系统有限公司 | Determination method, apparatus, storage medium and the electronic device of field |
| CN110472216B (en) * | 2019-08-19 | 2022-12-06 | 北京明略软件系统有限公司 | Method and device for determining field, storage medium and electronic device |
| CN114625798A (en) * | 2020-12-14 | 2022-06-14 | 金篆信科有限责任公司 | Data retrieval method and device, electronic equipment and storage medium |
| CN115396319A (en) * | 2021-05-19 | 2022-11-25 | 中国移动通信集团有限公司 | Data stream fragmentation method, device, equipment and storage medium |
| CN115396319B (en) * | 2021-05-19 | 2023-10-27 | 中国移动通信集团有限公司 | Data stream slicing method, device, equipment and storage medium |
| CN113704306A (en) * | 2021-08-31 | 2021-11-26 | 上海观安信息技术股份有限公司 | Database data processing method and device, storage medium and electronic equipment |
| CN113704306B (en) * | 2021-08-31 | 2024-01-30 | 上海观安信息技术股份有限公司 | Database data processing method and device, storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109918369B (en) | 2024-01-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109918369A (en) | Date storage method and device | |
| CN102521334B (en) | Data storage and query method based on classification characteristics and balanced binary tree | |
| CN110245470A (en) | Intelligent data desensitization method, device, computer equipment and storage medium | |
| TW200532495A (en) | Systems and methods for fine grained access control of data stored in relational databases | |
| CN103631924B (en) | A kind of application process and system of distributive database platform | |
| CN105989076A (en) | Data statistical method and device | |
| CN109063196A (en) | Data processing method, device, electronic equipment and computer readable storage medium | |
| CN102722553A (en) | Distributed type reverse index organization method based on user log analysis | |
| CN106569896B (en) | A kind of data distribution and method for parallel processing and system | |
| US20080270352A1 (en) | Modifying entry names in directory server | |
| CN103617276A (en) | Method for storing distributed hierarchical RDF data | |
| CN109271458A (en) | A kind of network of personal connections querying method and system based on chart database | |
| CN105608228B (en) | A kind of efficient distributed RDF data storage method | |
| CN112015741A (en) | Method and device for storing massive data in different databases and tables | |
| US20220253419A1 (en) | Multi-record index structure for key-value stores | |
| CN109376142A (en) | Data migration method and terminal device | |
| CN110109874A (en) | A kind of non-stop layer distributed document retrieval method based on block chain | |
| CN110232291A (en) | Intelligent data desensitization method, device, computer equipment and storage medium | |
| CN112148738A (en) | Hash collision processing method and system | |
| CN108573063A (en) | A kind of data query method and system | |
| Ding et al. | MO-Tree: an efficient forwarding engine for spatiotemporal-aware pub/sub systems | |
| CN102214214B (en) | Method and device for processing data relationship and mobile communication terminal | |
| CN109254962A (en) | A kind of optimiged index method and device based on T- tree | |
| CN108959584B (en) | Community structure-based method and device for processing graph data | |
| CN107016050A (en) | Data processing method and device |
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 | ||
| 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. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |