CN106802927A - A kind of date storage method and querying method - Google Patents
A kind of date storage method and querying method Download PDFInfo
- Publication number
- CN106802927A CN106802927A CN201611198826.9A CN201611198826A CN106802927A CN 106802927 A CN106802927 A CN 106802927A CN 201611198826 A CN201611198826 A CN 201611198826A CN 106802927 A CN106802927 A CN 106802927A
- Authority
- CN
- China
- Prior art keywords
- data
- stored
- level
- storage method
- date storage
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of date storage method and querying method, date storage method includes according to the incidence relation of level being stored in data to be stored in the Multiway Tree Structure for pre-setting, and data to be stored then are resolved into N number of level according to the position relationship of data bit.By such storage mode, in follow-up query process is carried out, whole data storages need not be traveled through, only need to the hierarchical relationship according to each data bit in data to be checked, traversal Multiway Tree Structure, maximum cycle-index will not increase for the node level of multiway tree, and cycle-index with increasing for data volume.Therefore, the date storage method that the present invention is provided can reduce the workload of subsequent query, so as to reduce query time and improve search efficiency.
Description
Technical field
The present invention relates to field of computer technology, more particularly to a kind of date storage method and querying method.
Background technology
With the popularization of mobile phone, the user of magnanimity is occurred in that, therefore also become increasingly complex for the management of phone number.Example
Such as, using mobile phone ad promotions are carried out due to some lawless persons or lures consumer to associate, so as to cause consumer
There is huge loss.Therefore, these phone numbers can be carried out storage and constitute a blacklist by operator or consumer,
When needing to carry out normal communication service, destination number is compared with the blacklist of storage, if existed in blacklist
With destination number identical number, illustrate that destination number just needs to filter out this destination number in the range of blacklist, then,
If in blacklist do not exist with destination number identical number, illustrate that destination number not in the range of blacklist, is then not required to
This destination number is filtered out, normal communication service can be carried out with this destination number.
In the prior art, the storage method of use is exactly simply to store in a specified area each phone number.
Because the number in blacklist is very more, it is understood that there may be up to ten million, therefore, after being stored with above-mentioned storage mode, such as
Fruit needs to inquire about certain number, then need to travel through substantial amounts of number, even whole numbers.If 100 numbers
Code, then maximum cycle is exactly 100 times, if 1000 numbers, then maximum cycle is exactly 1000 times, it is obvious that
If the other number of millions, then maximum cycle-index is exactly ten million time.
In sum, existing storage mode causes that follow-up inquiry work is very cumbersome, can take a substantial amount of time, and
And increasing with data, the cycle-index of inquiry is also being continuously increased, and the performance impact for server is very big.Therefore,
It is those skilled in the art's problem demanding prompt solution that query time how to be reduced to improve the efficiency of inquiry.
The content of the invention
It is an object of the invention to provide a kind of date storage method and data query method, this method can overcome subsequently to be looked into
Ask intricate operation, the problem for taking considerable time, and will not increasing with data, and increase inquiry cycle-index.Cause
This, this method can reduce query time to improve the efficiency of inquiry.
In order to solve the above technical problems, the present invention provides a kind of date storage method, including：
Data to be stored are resolved into N number of level according to the position relationship of data bit；
The data to be stored are stored in the Multiway Tree Structure for pre-setting according to the incidence relation of level；
Wherein, the node level in the multiway tree is corresponding with N number of level, and N is positive integer, and equal to or less than institute
State the data bits of data to be stored.
Preferably, the data to be stored are the digital information comprising long number.
Preferably, the digital information is 10 binary datas.
Preferably, it is described data to be stored are resolved into N number of level according to the position relationship of data bit to specifically include：
The data to be stored are compressed according to pre-defined rule to generate corresponding new data to be stored；
The new data to be stored are resolved into N number of level according to the position relationship of data bit.
Preferably, the data to be stored are the phone number comprising 11 bit digitals.
Preferably, the pre-defined rule is the conversion of predetermined system, then the new data to be stored are the data to be stored
Result after being changed according to predetermined system.
Preferably, the predetermined system is converted to the conversion of 16 systems or the conversion of 32 systems or the conversion of 64 systems.
Preferably, the data to be stored are the alphabetical information comprising multidigit letter.
Preferably, the sequencing of N number of level is identical with the reading order of the data to be stored.
In order to solve the above technical problems, the present invention provides a kind of data query method, based on data storage described above
Method, including：
Data to be checked are resolved into N number of level according to the relation of data bit；
The data to be checked are traveled through into the Multiway Tree Structure according to the incidence relation of level, until the multiway tree knot
Untill not including corresponding data bit in m-th node level in structure or inquiring the data to be checked；Wherein, M is small
In or equal to N.
Date storage method provided by the present invention, including data to be stored are stored in advance according to the incidence relation of level
In the Multiway Tree Structure of setting, data to be stored are then resolved into N number of level according to the position relationship of data bit.By so
Storage mode, in follow-up query process is carried out, it is not necessary to the whole data storages of traversal, it is only necessary to according to number to be checked
The hierarchical relationship of each data bit in, travels through Multiway Tree Structure, and maximum cycle-index is the node level of multiway tree, and
And cycle-index will not increase with increasing for data volume.Therefore, after the date storage method that the present invention is provided can be reduced
The workload of continuous inquiry, so as to reduce query time and improve search efficiency.
Additionally, a kind of data query method that the present invention is also provided is based on date storage method described above, in inquiry
During, the method need not travel through whole data storages, it is only necessary to be closed according to the level of each data bit in data to be checked
System, travels through Multiway Tree Structure, and maximum cycle-index is the node level of multiway tree, and cycle-index will not be with number
Increase according to increasing for amount.Therefore, the data query method that the present invention is provided can reduce the workload of inquiry, so as to reduce look into
Inquiry time and raising search efficiency.
Brief description of the drawings
In order to illustrate more clearly the embodiments of the present invention, the accompanying drawing to be used needed for embodiment will be done simply below
Introduce, it should be apparent that, drawings in the following description are only some embodiments of the present invention, for ordinary skill people
For member, on the premise of not paying creative work, other accompanying drawings can also be obtained according to these accompanying drawings.
Fig. 1 is a kind of flow chart of date storage method provided in an embodiment of the present invention；
A kind of data store organisation schematic diagram that Fig. 2 is provided for inventive embodiments；
The flow chart of Fig. 3 another date storage methods for the embodiment of the present invention is provided；
Fig. 4 is a kind of storage organization schematic diagram through after overcompression provided in an embodiment of the present invention；
Fig. 5 is a kind of flow chart of data query method provided in an embodiment of the present invention.
Specific embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation is described, it is clear that described embodiment is only a part of embodiment of the invention, rather than whole embodiments.Based on this
Embodiment in invention, those of ordinary skill in the art are not under the premise of creative work is made, and what is obtained is every other
Embodiment, belongs to the scope of the present invention.
Core of the invention is to provide a kind of date storage method and data query method, and this method can overcome subsequently to be looked into
Ask intricate operation, the problem for taking considerable time, and will not increasing with data, and increase inquiry cycle-index.Cause
This, this method can reduce query time to improve the efficiency of inquiry.
In order that those skilled in the art more fully understand the present invention program, with reference to the accompanying drawings and detailed description
The present invention is described in further detail.
Fig. 1 is a kind of flow chart of date storage method provided in an embodiment of the present invention.As shown in figure 1, including：
S10：Data to be stored are resolved into N number of level according to the position relationship of data bit.
It is understood that data to be stored can be the digital information comprising long number or be comprising multidigit letter
Alphabetical information.For example, if the data of 10 systems for digital information, then the content in data bit is exactly 0-9, data
Content in position is numeral, if the data of 16 systems, then the content in data bit is exactly 0-F, then interior in data bit
Hold in addition to 0-9 numerals, also including the several letters of A-F, but the several letters of A-F are also digital information.Furthermore it is also possible to be 2
The data of system or 32 systems, the present embodiment is repeated no more.
In the present embodiment, resolve into N number of level according to the position relationship of data bit and must assure that each data bit original
Position relationship in data with decompose after hierarchical relationship when identical.If for example, data bit is N, resolving into N number of level
If, if then first data of data bit is in first level, second data of data bit must be second layer
Level, the data of the 3rd data bit must be the 3rd level, by that analogy；If likewise, first data of data bit
In last level, then second data of data bit must be in penultimate level, and the data of the 3rd data bit must
Must be in third last level, by that analogy.Isolation only in this way, just can guarantee that each data bit in initial data
Position relationship and position relationship in decomposition texture be identical.
It should be noted that the data bit being outlined above has N, then it is that one kind is implemented to resolve into N number of level
Form, in another embodiment, can also be every two, or the forms such as every three, and the present embodiment is repeated no more.Decompose
Level it is more, then need the number of times of the inquiry of circulation more, but each layer of node is less, i.e. the query time of same layer
Will be less.
S11：Data to be stored are stored in the Multiway Tree Structure for pre-setting according to the incidence relation of level, wherein, it is many
Node level in fork tree is corresponding with N number of level, and N is positive integer, and equal to or less than the data bits of data to be stored.
Multiway Tree Structure is the tree for standing upside down, and has multiple node levels in multiway tree, node level here with treat
N number of level that data storage is resolved into mutually is corresponded to.
In order to allow those skilled in the art more to understand technical scheme provided by the present invention, one is provided in the present embodiment
Simply example is illustrated.If data to be stored are the digital information of 6, and are 10 systems, such as 412012,
412013rd, 415357 and 415358.This four data are decomposed according to step S10, for example, is resolved into 6 grades.Fig. 2 is
A kind of data store organisation schematic diagram that inventive embodiments are provided.If as shown in Fig. 2 the maximum data position is first level
Words, then highest order (being 4) in each data to be stored store first node level in Multiway Tree Structure, here 4
The maximum data position of individual data to be stored is 1, therefore, there is no need to bifurcated.According to the position relationship of data bit, first is waited to deposit
Store up second data bit of data, second data bit of second data to be stored, second of the 3rd data to be stored
Second data bit of data bit and the 4th data to be stored is second node level in Multiway Tree Structure, here
4 the second of data to be stored data bit are 1, therefore, there is no need to bifurcated.According to the position relationship of data bit, first
3rd data bit of data to be stored, the 3rd data bit of second data to be stored, the of the 3rd data to be stored
Three data bit and the 4th the 3rd of data to be stored the data bit are the 3rd node level in Multiway Tree Structure,
Here 4 the 3rd of data to be stored the data bit have two kinds, and respectively 2 or 5, therefore, multiway tree will carry out bifurcated, i.e., the 3rd
Individual node level has two nodes.Remaining is decomposed and stores similar, and the present embodiment is repeated no more.
Using above-mentioned storage mode, when data query is carried out, by data to be checked according to level incidence relation time
Multiway Tree Structure is gone through, is treated until not including corresponding data bit or inquiring in the m-th node level in Multiway Tree Structure
Untill inquiry data；Wherein, M is less than or equal to N.Because the less effect for inquiry of data is simultaneously obvious in Fig. 2, but if
If data are more, such as maximum can be 999999, then need to repeat to inquire about up to ten thousand times, or even be only possible to inquire more times
Related data, therefore the number of times of cyclic query is very more, and it is not relevant between each data, if to be inquired about
Data are at last or if not existing, then the inquiry times for needing are maximum.But if using this storage method, then only
Needs are inquired about successively according to Multiway Tree Structure.If necessary to 440896 this data of inquiry whether in memory range, then
Whether first node level in only needing to Multiway Tree Structure is inquired about comprising first data bit 4, if this is saved
4 are included in point level, then carries out the inquiry of next node level, next data bit is 4, no longer second node level
In, then illustrate in the data to be checked no longer memory range, also avoid the need for carrying out follow-up query steps again.Using this storage
Mode, it is only necessary to inquire about 2 times, but, it is necessary to travel through the whole numbers in memory range for existing storage mode
According to can just determine whether there is data to be checked, therefore this storage mode is capable of the number of times of smaller inquiry.
The date storage method that the present embodiment is provided, including data to be stored are stored in advance according to the incidence relation of level
In the Multiway Tree Structure of setting, data to be stored are then resolved into N number of level according to the position relationship of data bit.By so
Storage mode, in follow-up query process is carried out, it is not necessary to the whole data storages of traversal, it is only necessary to according to number to be checked
The hierarchical relationship of each data bit in, travels through Multiway Tree Structure, and maximum cycle-index is the node level of multiway tree, and
And cycle-index will not increase with increasing for data volume.Therefore, after the date storage method that the present invention is provided can be reduced
The workload of continuous inquiry, so as to reduce query time and improve search efficiency.
In specific implementation, the data for often storing are very more, how bring huge pressure to memory space
The consumption for reducing memory space is another big problem that those skilled in the art face.
In the present embodiment, before by data storage to be stored to Multiway Tree Structure, data to be stored are compressed, from
And the consumption of memory space is reduced, detailed process is as follows.
The flow chart of Fig. 3 another date storage methods for the embodiment of the present invention is provided.The step S10 on the basis of Fig. 1
Specifically include：
S100：Data to be stored are compressed according to pre-defined rule to generate corresponding new data to be stored.
S101：New data to be stored are resolved into N number of level according to the position relationship of data bit.
It is understood that depending on being needed according to actual conditions using which kind of pre-defined rule, such as pre-defined rule is predetermined
System is changed, then new data to be stored are the result after data to be stored are changed according to predetermined system.Predetermined system is converted to 16
System is changed or the conversion of 32 systems or the conversion of 64 systems.If for example, data to be stored inherently 16 systems, therefore,
If being nonsensical using the conversion of 16 systems, it is impossible to realize the compression of data.
In a kind of specific embodiment, data to be stored are the phone number comprising 11 bit digitals.China is big
The phone number in land is comprising 11 bit digitals, with 1 beginning.For such data, we can carry out the data turn of 64 systems
Change.For example, being " heHVA0 " after carrying out 64 system conversions for " 18500000000 ", it is obvious that data bit is by original 11
Position, becomes present 6, so if be not compressed, then when data search is carried out, it is necessary to circulate 11 times, and through overvoltage
After contracting, then circulation 6 times is only needed to.Fig. 4 is that a kind of storage organization through after overcompression provided in an embodiment of the present invention is illustrated
Figure.
Used as preferred embodiment, the sequencing of N number of level is identical with the reading order of data to be stored.For example,
Storage schematic diagram shown in Fig. 2 or Fig. 4.
In the case where being stored with above-mentioned storage method, the present invention also provides a kind of data query method.Fig. 5 is real for the present invention
A kind of flow chart of data query method of example offer is provided.The data query method is based on the data storage described in above-described embodiment
Method, including：
S20：Data to be checked are resolved into N number of level according to the relation of data bit；
S21：Data to be checked are traveled through into Multiway Tree Structure according to the incidence relation of level, until the in Multiway Tree Structure
Untill not including corresponding data bit in M node level or inquiring data to be checked, wherein, M is less than or equal to N.
Because the data query method is based on the date storage method described in above-described embodiment, therefore, date storage method
Corresponding embodiment is repeated no more.For a data to be checked, if not comprising data correspondence in the 3rd node level
Data bit, then can stop this inquiry, otherwise, successively to each node level inquire about.
The data query method that the present embodiment is provided, based on date storage method, the storage method is included number to be stored
Be stored in the Multiway Tree Structure for pre-setting according to the incidence relation according to level, then by data to be stored according to data bit position
The relation of putting resolves into N number of level.In query process, it is not necessary to the whole data storage of traversal, it is only necessary to according to number to be checked
The hierarchical relationship of each data bit in, travels through Multiway Tree Structure, and maximum cycle-index is the node level of multiway tree, and
And cycle-index will not increase with increasing for data volume.Therefore, the data query method that the present invention is provided can be reduced to be looked into
The workload of inquiry, so as to reduce query time and improve search efficiency.
Data storage method provided by the present invention and querying method are described in detail above.In specification each
Embodiment is described by the way of progressive, and what each embodiment was stressed is the difference with other embodiment, each
Between embodiment identical similar portion mutually referring to.For device disclosed in embodiment, because it is public with embodiment
The method opened is corresponding, so description is fairly simple, related part is referring to method part illustration.It should be pointed out that for
For those skilled in the art, under the premise without departing from the principles of the invention, if can also be carried out to the present invention
Dry to improve and modify, these are improved and modification is also fallen into the protection domain of the claims in the present invention.
Claims (10)
1. a kind of date storage method, it is characterised in that including：
Data to be stored are resolved into N number of level according to the position relationship of data bit；
The data to be stored are stored in the Multiway Tree Structure for pre-setting according to the incidence relation of level；
Wherein, the node level in the multiway tree is corresponding with N number of level, and N is positive integer, and is treated equal to or less than described
The data bits of data storage.
2. date storage method according to claim 1, it is characterised in that the data to be stored are comprising long number
Digital information.
3. date storage method according to claim 2, it is characterised in that the digital information is 10 binary datas.
4. date storage method according to claim 3, it is characterised in that it is described by data to be stored according to data bit
Position relationship resolves into N number of level and specifically includes：
The data to be stored are compressed according to pre-defined rule to generate corresponding new data to be stored；
The new data to be stored are resolved into N number of level according to the position relationship of data bit.
5. date storage method according to claim 4, it is characterised in that the data to be stored are comprising 11 bit digitals
Phone number.
6. date storage method according to claim 5, it is characterised in that the pre-defined rule is the conversion of predetermined system,
Then the new data to be stored are the result after the data to be stored are changed according to predetermined system.
7. date storage method according to claim 6, it is characterised in that the predetermined system is converted to the conversion of 16 systems
32 system conversion or 64 systems conversion.
8. date storage method according to claim 1, it is characterised in that the data to be stored are comprising multidigit letter
Alphabetical information.
9. the date storage method according to claim 1-8 any one, it is characterised in that the priority of N number of level
Order is identical with the reading order of the data to be stored.
10. a kind of data query method, based on the date storage method described in claim 1-9 any one, it is characterised in that
Including：
Data to be checked are resolved into N number of level according to the relation of data bit；
The data to be checked are traveled through into the Multiway Tree Structure according to the incidence relation of level, until in the Multiway Tree Structure
M-th node level in do not include corresponding data bit or inquire the data to be checked untill；
Wherein, M is less than or equal to N.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611198826.9A CN106802927A (en) | 2016-12-22 | 2016-12-22 | A kind of date storage method and querying method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611198826.9A CN106802927A (en) | 2016-12-22 | 2016-12-22 | A kind of date storage method and querying method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106802927A true CN106802927A (en) | 2017-06-06 |
Family
ID=58984958
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611198826.9A Pending CN106802927A (en) | 2016-12-22 | 2016-12-22 | A kind of date storage method and querying method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106802927A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109861965A (en) * | 2018-12-05 | 2019-06-07 | 苏州蜗牛数字科技股份有限公司 | A kind of voxel Terrain Data Compression method and system |
| CN110209686A (en) * | 2018-02-22 | 2019-09-06 | 北京嘀嘀无限科技发展有限公司 | Storage, querying method and the device of data |
| CN111340623A (en) * | 2020-02-21 | 2020-06-26 | 上海优扬新媒信息技术有限公司 | Data storage method and device |
| CN114691694A (en) * | 2022-04-08 | 2022-07-01 | 广东七件事网络科技有限公司 | Tree data storage and processing method and system |
| CN115687366A (en) * | 2022-12-08 | 2023-02-03 | 深圳市智多兴投控科技有限公司 | Method for constructing logistics main channel and related equipment |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101057293A (en) * | 2004-11-08 | 2007-10-17 | 皇家飞利浦电子股份有限公司 | Bit detection for multitrack digital data storage |
| CN101499094A (en) * | 2009-03-10 | 2009-08-05 | 焦点科技股份有限公司 | Data compression storing and retrieving method and system |
| CN102567419A (en) * | 2010-12-31 | 2012-07-11 | ***股份有限公司 | Mass data storage device and method based on tree structure |
| CN103995855A (en) * | 2014-05-14 | 2014-08-20 | 华为技术有限公司 | Method and device for storing data |
| CN104123288A (en) * | 2013-04-24 | 2014-10-29 | 阿里巴巴集团控股有限公司 | Method and device for inquiring data |
| CN104765866A (en) * | 2015-04-24 | 2015-07-08 | 武汉噢易云计算有限公司 | Method and system for administrative division data gathering based on tree structure |
| CN104978372A (en) * | 2014-04-09 | 2015-10-14 | 正文科技股份有限公司 | Multimedia information processing method, multimedia device and multimedia network system |
-
2016
- 2016-12-22 CN CN201611198826.9A patent/CN106802927A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101057293A (en) * | 2004-11-08 | 2007-10-17 | 皇家飞利浦电子股份有限公司 | Bit detection for multitrack digital data storage |
| CN101499094A (en) * | 2009-03-10 | 2009-08-05 | 焦点科技股份有限公司 | Data compression storing and retrieving method and system |
| CN102567419A (en) * | 2010-12-31 | 2012-07-11 | ***股份有限公司 | Mass data storage device and method based on tree structure |
| CN104123288A (en) * | 2013-04-24 | 2014-10-29 | 阿里巴巴集团控股有限公司 | Method and device for inquiring data |
| CN104978372A (en) * | 2014-04-09 | 2015-10-14 | 正文科技股份有限公司 | Multimedia information processing method, multimedia device and multimedia network system |
| CN103995855A (en) * | 2014-05-14 | 2014-08-20 | 华为技术有限公司 | Method and device for storing data |
| CN104765866A (en) * | 2015-04-24 | 2015-07-08 | 武汉噢易云计算有限公司 | Method and system for administrative division data gathering based on tree structure |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110209686A (en) * | 2018-02-22 | 2019-09-06 | 北京嘀嘀无限科技发展有限公司 | Storage, querying method and the device of data |
| CN111742308A (en) * | 2018-02-22 | 2020-10-02 | 北京嘀嘀无限科技发展有限公司 | System and method for data storage and query |
| CN109861965A (en) * | 2018-12-05 | 2019-06-07 | 苏州蜗牛数字科技股份有限公司 | A kind of voxel Terrain Data Compression method and system |
| CN109861965B (en) * | 2018-12-05 | 2021-06-18 | 苏州蜗牛数字科技股份有限公司 | Voxel terrain data compression method and system |
| CN111340623A (en) * | 2020-02-21 | 2020-06-26 | 上海优扬新媒信息技术有限公司 | Data storage method and device |
| CN111340623B (en) * | 2020-02-21 | 2023-10-24 | 度小满科技(北京)有限公司 | Data storage method and device |
| CN114691694A (en) * | 2022-04-08 | 2022-07-01 | 广东七件事网络科技有限公司 | Tree data storage and processing method and system |
| CN115687366A (en) * | 2022-12-08 | 2023-02-03 | 深圳市智多兴投控科技有限公司 | Method for constructing logistics main channel and related equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106802927A (en) | A kind of date storage method and querying method | |
| US9390134B2 (en) | Regular expression matching method and system, and searching device | |
| EP2924594B1 (en) | Data encoding and corresponding data structure in a column-store database | |
| CN102521334B (en) | Data storage and query method based on classification characteristics and balanced binary tree | |
| CN107111623A (en) | Parallel historical search and coding for the compression based on dictionary | |
| CN106407201A (en) | Data processing method and apparatus | |
| CN106469282A (en) | data access authority control method and device | |
| CN103475584B (en) | Three-state content addressing memory (TCAM) querying method and device | |
| CN107562743B (en) | Data storage method and device, and data search request processing method and device | |
| US11928599B2 (en) | Method and device for model compression of neural network | |
| CN105515997B (en) | The higher efficiency range matching process of zero scope expansion is realized based on BF_TCAM | |
| CN101848248B (en) | Rule searching method and device | |
| CN104025520A (en) | Lookup table creation method and query method, and controller, forwarding device and system therefor | |
| CN104899214B (en) | A kind of data processing method and system established input and suggested | |
| CN110825706B (en) | Data compression method and related equipment | |
| CN106649217A (en) | Data matching method and device | |
| CN104579970A (en) | Strategy matching method and device of IPv6 message | |
| CN110263104A (en) | JSON character string processing method and device | |
| CN105574076B (en) | A kind of key-value pair storage organization and method based on Bloom Filter | |
| CN102710491A (en) | Lossless real-time line-rate filtering using pcap style filters and hardware assisted patricia trees | |
| CN102799423B (en) | Method and the device of dynamic approach is performed in JSF | |
| CN116760661A (en) | Data storage method, apparatus, computer device, storage medium, and program product | |
| CN116301656A (en) | Data storage method, system and equipment based on log structure merging tree | |
| CN103902554B (en) | Data access method and device | |
| CN115408547A (en) | Dictionary tree construction method, device, equipment and storage medium |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170606 |
|
| RJ01 | Rejection of invention patent application after publication |