CN110109914A - A kind of data storage of application drive and indexing means - Google Patents
A kind of data storage of application drive and indexing means Download PDFInfo
- Publication number
- CN110109914A CN110109914A CN201810039941.4A CN201810039941A CN110109914A CN 110109914 A CN110109914 A CN 110109914A CN 201810039941 A CN201810039941 A CN 201810039941A CN 110109914 A CN110109914 A CN 110109914A
- Authority
- CN
- China
- Prior art keywords
- field
- data
- node
- tree
- value
- 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
- 238000013500 data storage Methods 0.000 title description 2
- 238000000034 method Methods 0.000 claims description 33
- 238000003780 insertion Methods 0.000 claims description 7
- 230000037431 insertion Effects 0.000 claims description 7
- 239000000203 mixture Substances 0.000 claims description 5
- 235000013399 edible fruits Nutrition 0.000 claims 1
- 229910002056 binary alloy Inorganic materials 0.000 description 3
- 238000007493 shaping process Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000000151 deposition Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 238000004321 preservation Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/221—Column-oriented storage; Management thereof
-
- 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)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of storage of the data of application drive and indexing means.Data are by column storage, single file storage content only includes a field, there is a flag bit before each field, other corresponding fields also have corresponding flag bit, the different field of same record possesses identical line number mark in different files, indexing means use the form of B+ tree, three fields for including using file name are as the data for establishing B+ tree, the maximum value for taking the field range of this document is key, first five position of initial time is that value establishes a B+ tree, the minimum value for taking the field range of this document is key, latter five of initial time are that value establishes a B+ tree；It inquires the time of the field while inquiring two B+ trees, query result is combined into range, in addition field designator navigates to file, finally remove inquiry particular content hereof.The present invention improves the service efficiency of memory space, provides higher index rate.
Description
Technical field
The present invention relates to a kind of storage of the data of application drive and indexing means, belong to technical field of data processing.
Background technique
With the growth of internet information, a large amount of data need to be to be stored, also just needs more hard disc apparatus.Data
Amount constantly increases, and the type of data is also constantly increasing.Ticket is as one of numerous data, and data volume is increased
Meanwhile the field in format of billing is also constantly extending.
Different application types is different to the storage of data and analysis demand, is according to different data types
Different schemes is customized, it undoubtedly more can be efficient than unified storage platform.Application drive just refers to be different application
The storage scheme of demand customization differentiation.
Various dimensions refer to multiple angles.User quick, efficient can be obtained certainly by specific method
The data for the special angle that oneself needs, this is of great advantage to subsequent work.It is subsequent analysis do not need again to data into
Row secondary operation, so that it may obtain carrying out analyzing specific basic data.
Call bill data faces two kinds of situations at present: one is previously stored in traditional relational, and traditional database is being handled
When short-term data relatively flexibly, have absolute advantage.But when facing mass data, storing mode is to subsequent data
Analysis can not extend efficient help；Second is that using the scheme of distributed treatment, certain general distributed skills are directlyed adopt
Art is guaranteed in data scale and query rate, but higher cost, does not excavate the due valence of call bill data sufficiently
Value.
In order to improve the application value of call bill data, cope with the extension of ticket field, suitable storage and index side are found
Method becomes particularly important.
Summary of the invention
In view of this, the present invention provides a kind of storage of the data of application drive and indexing means, with the growth of information,
User is higher and higher to the frequency of use of data, provides a kind of side effectively flexibly indexed on the basis of storage
Method.This method can improve the service efficiency of memory space, can also provide higher index rate.
The present invention solves above-mentioned technical problem by following technological means:
A kind of date storage method of application drive of the invention, data are stored by column, not completely independent between each column,
Single file storage content only includes a field, there is a flag bit before each field, indicates that the field is located at this document
Which storage content, other corresponding fields also have corresponding flag bit, and the different field of same record is different
Possess identical line number mark in file；
File name includes three fields: field designator, the initial time for storing this document, the field are in this document
Range, the starting time field for storing this document guarantee the uniqueness of this document, and field designator and the field are in this document
Range field ensures the foundation of subsequent index.
A kind of data index method of application drive, indexing means use the form of B+ tree comprising:
Three fields for including using file name take the maximum value of the field range of this document as the data for establishing B+ tree
For key, first five position of initial time is that value establishes a B+ tree, likewise, taking the minimum value of the field range of this document to be
Latter five of key, initial time establish a B+ tree for value；
It inquires the time of the field while inquiring two B+ trees, query result is combined into range, in addition field designator is fixed
File is arrived in position, finally removes inquiry particular content hereof.
A kind of date storage method of application drive places flag bit before three field contents, as soon as every acquisition information,
It will be compared by the field contents of coding with the data in correspondence memory, it, just will be new if having existed identical content
The corresponding flag bit after coding of the field contents of acquisition is added to before already existing field, if there is no interior
Hold, will just be added in correspondence memory after new field and flag bit coding.
A kind of data index method of application drive, based on memory in data have been written into file, obtain the leaf of B+ tree
There are two types of modes for child node, first is that obtaining from memory variable, monitor memory dynamic at any time, obtain when executing and file operation being written
Initial time and field range are got, second is that directly obtaining from file name；
The time in filename and field range are obtained, standard time length position 10 divides each five of the field in position two, together
When unpack field range maximum value and minimum value, maximum value and first five position of time form a dictionary, maximum value position key,
First five position of time be value, one dictionary of rear five compositions of minimum value and time, minimum value key, latter five of the time
For value；
Leaf node of the key-value key-value pair that will acquire as B+ tree, establishes two B+ trees.When inquiry simultaneously
It is inquired in two B+ trees, the result inquired is formed into field range, in addition field designator, is searched corresponding in listed files
File.
The foundation of B+ tree and more new technological process is as follows:
Step 1: judging whether the key-value is leaf node, if then turning to step 3, is not, turns to step 2；
Step 2: judging leaf node number, sub-node type, if node number is greater than 1, use binary search
Compare the size of key if interstitial content is 1, then judge node type in insertion position；If node type is leaf
Node then turns to step 3, if node type is n omicronn-leaf child node, continues step 2；
Step 3: judging the state of leaf node, if node state is sky, is inserted into data, is not sky, then judges leaf
The number of child node, when leaf node number be greater than 1, then use binary search insertion position, then turn to step 4, work as leaf
Child node number is equal to 1, then directly to step 4；
Step 4: compare the size of leaf node and data, judges whether leaf node is full, if leaf node is less than,
Data are inserted into, if leaf node is full, the division of B+ tree is carried out, turns to step 5；
Step 5: creation father node, if it is, insertion data are saved if not node number, node type is then judged
Point is less than, then is inserted into data, and node is full then to continue step 5.
Data are divided into the file storage of specified size by the present invention, and time field, data association message storage are arrived
Filename, it is ensured that the uniqueness of file and certain information content；
Using binary representation flag bit, the length of filename is reduced；
When the content difference of the same field is not that very greatly, can effectively save hard drive space to differential technique using preceding；
It is established and is indexed using B+ tree, even if data volume increases, search efficiency will not be reduced significantly；
By the way of column storage, Field Inquiry and the extraction of needs can be flexibly chosen.
Beneficial effects of the present invention: with the growth of information, user is higher and higher to the frequency of use of data, provides one
The method that kind is effectively flexibly indexed on the basis of storage, this method can improve the service efficiency of memory space,
Higher index rate can be provided.
Detailed description of the invention
The invention will be further described with reference to the accompanying drawings and examples.
Fig. 1 is a kind of method flow diagram for storing data that the embodiment of the present invention 1 provides；
Fig. 2 is a kind of method flow diagram for foundation index that the embodiment of the present invention 2 provides；
Fig. 3 is foundation and the update flow chart of B+ tree.
Specific embodiment
Below with reference to attached drawing, the present invention is described in detail, and as shown in Figure 1,2 and 3: the present embodiment is to make this hair
Bright purposes, technical schemes and advantages are clearer, make below in conjunction with attached drawing to embodiment of the present invention further detailed
Description.
A kind of date storage method of application drive, data are stored by column, not completely independent, single file between each column
Storage content only includes a field, there is a flag bit before each field, indicate the field be located at this document which
Storage content, other corresponding fields also have corresponding flag bit, and the different field of same record is gathered around in different files
There is identical line number mark；
File name includes three fields: field designator, the initial time for storing this document, the field are in this document
Range, the starting time field for storing this document guarantee the uniqueness of this document, and field designator and the field are in this document
Range field ensures the foundation of subsequent index.
A kind of data index method of application drive, indexing means use the form of B+ tree comprising:
Three fields for including using file name take the maximum value of the field range of this document as the data for establishing B+ tree
For key, first five position of initial time is that value establishes a B+ tree, likewise, taking the minimum value of the field range of this document to be
Latter five of key, initial time establish a B+ tree for value；
It inquires the time of the field while inquiring two B+ trees, query result is combined into range, in addition field designator is fixed
File is arrived in position, finally removes inquiry particular content hereof.
A kind of date storage method of application drive places flag bit before three field contents, as soon as every acquisition information,
It will be compared by the field contents of coding with the data in correspondence memory, it, just will be new if having existed identical content
The corresponding flag bit after coding of the field contents of acquisition is added to before already existing field, if there is no interior
Hold, will just be added in correspondence memory after new field and flag bit coding.
A kind of data index method of application drive, based on memory in data have been written into file, obtain the leaf of B+ tree
There are two types of modes for child node, first is that obtaining from memory variable, monitor memory dynamic at any time, obtain when executing and file operation being written
Initial time and field range are got, second is that directly obtaining from file name；
The time in filename and field range are obtained, standard time length position 10 divides each five of the field in position two, together
When unpack field range maximum value and minimum value, maximum value and first five position of time form a dictionary, maximum value position key,
First five position of time be value, one dictionary of rear five compositions of minimum value and time, minimum value key, latter five of the time
For value；
Leaf node of the key-value key-value pair that will acquire as B+ tree, establishes two B+ trees.When inquiry simultaneously
It is inquired in two B+ trees, the result inquired is formed into field range, in addition field designator, is searched corresponding in listed files
File.
Embodiment 1
A kind of method of storing data, by taking call bill data as an example.Referring to Fig. 1, wherein this method comprises:
It obtains ticket and is stored in memory, set file size threshold value, when ticket size reaches threshold value in memory, just generate one
File, file designation mode are the value range (hexadecimal) of the field identification+time+field in this document.Field identification
Since 0,0 indicates first character section, and 1 indicates second field etc..There was only shaping and character string two in view of ticket field type
Kind form, file content are uniformly converted to binary system preservation.
101: obtaining ticket content from outside, each ticket specifies a flag bit, indicates that this ticket is in the block
Which data in depositing, then by column storage.
The coding mode of the flag bit are as follows: will mark to be converted to binary system, by six be a Duan Zucheng since low level
The 6th of one eight, digit deficiency filling 0, highest order is always 1, and secondary low level indicates the flag bit byte length, 0 table
Show that length position 1,1 indicates length position 2, includes this byte.If flag bit is 156, it is represented in binary as 0b10011100, length is super
It crosses 6 but less than 12, indicates the mark bit length position 2, into 0b110000100b10011100 after converting.
Ticket field type is divided into shaping and character string.Shaping and character string are all converted into binary representation.Then lead to
Cross specified coding mode:
A kind of situation be field variation less, a smallest value can be artificially set, by it is preceding calculated to differential technique after
The difference for minimum value of the new field contents in face.Such as international mobile subscriber identity (IMSI), minimum settable position
460000000000000, the difference of new field contents and the value is then calculated, subsequent coding is carried out；
Another situation is that field variation is obvious, can be not provided with minimum value, or default minimum value position 0, then
Next code is carried out,
Specific coding mode position: after field contents are converted to binary system, since low level, every seven are a Duan Zucheng
The 7th of one eight, highest order position 0 always.
The combination of flag bit and field contents: placing flag bit before field contents, as soon as every acquisition ticket information, it will be through
The field contents for crossing coding are compared with the data in correspondence memory, if having existed identical content, just will newly obtain
The corresponding flag bit after coding of field contents be added to before already existing field, if there is no content,
It will just be added in correspondence memory after new field and flag bit coding.
While carrying out field contents comparison, two variables are set in memory, indicate block word stored in memory
The maximum value and minimum value of section, initial value is all 0.When getting new field contents can by comparing: be first with it is specific in
The comparison of appearance, if the field contents have existed, without the comparison of max min, if including the field contents
It is not present, then compared with being most worth and is replaced the value in depositing.
102: obtain the timestamp (after 1970 epoch by floating-point number of seconds) of current time, totally ten.According to ticket word
Number of segment mesh indicates since 0 to each ticket field accordingly, 1 respective flag 0 of field, 2 respective flag 1 of field etc..Moment
The range size of more newer field.
103: the threshold value of one memory block of setting, when memory block reaches the threshold value, then by current field designator, starting when
Between, field range be set as filename, this document is written into the data in the block memory.
Embodiment 2
The embodiment of the invention provides a kind of methods for establishing index.Referring to fig. 2, this method comprises:
This method be based on memory in data have been written into file, obtain mode there are two types of the leaf nodes of B+ tree, one
It is to be obtained from memory variable, monitors memory dynamic at any time, get initial time and field when executing and file operation being written
Range, second is that directly being obtained from file name.
201: obtaining the time in filename and field range.Standard time length position 10 divides the field of position two each five
Position, while the maximum value and minimum value of unpack field range, maximum value and first five position of time form a dictionary, maximum value position
Key, first five position of time are value, one dictionary of rear five compositions of minimum value and time, minimum value key, after the time
Five are value.
202: the key-value key-value pair that previous step is obtained establishes two B+ trees as the leaf node of B+ tree.Inquiry
When inquired in two B+ trees simultaneously, by the result inquired composition field range, in addition field designator, in listed files
It is middle to search corresponding file.
The foundation of B+ tree and renewal process such as Fig. 3, detailed process are as follows:
S1: judge whether the key-value is leaf node, if then turning to S3, is not, turns to S2；
S2: judging leaf node number, sub-node type, if node number is greater than 1, is inserted into using binary search
Compare the size of key if interstitial content is 1, then judge node type in position；If node type is leaf node,
S3 is then turned to, if node type is n omicronn-leaf child node, continues S2；
S3: judging the state of leaf node, if node state is sky, is inserted into data, is not sky, then judges leaf knot
The number of point then uses binary search insertion position, then turns to S4, when leaf node when leaf node number is greater than 1
Number is equal to 1, then directly to S4；
S4: comparing the size of leaf node and data, judges whether leaf node is full, if leaf node is less than, inserts
Enter data, if leaf node is full, carries out the division of B+ tree, turn to S5；
S5: creation father node, if it is, insertion data, if not then judging node number, node type, node
It is less than, then data are inserted into, node is full then to continue S5.
Finally, it is stated that the above examples are only used to illustrate the technical scheme of the present invention and are not limiting, although referring to compared with
Good embodiment describes the invention in detail, those skilled in the art should understand that, it can be to skill of the invention
Art scheme is modified or replaced equivalently, and without departing from the objective and range of technical solution of the present invention, should all be covered at this
In the scope of the claims of invention.
Claims (5)
1. a kind of date storage method of application drive, it is characterised in that: data are stored by column, between each column not exclusively solely
Vertical, single file storage content only includes a field, there is a flag bit before each field, indicates that the field is located at this article
Which storage content of part, other corresponding fields also have corresponding flag bit, and the different field of same record is in difference
File in possess identical line number mark；
File name includes three fields: field designator, the initial time for storing this document, the model of the field in this document
It encloses, the starting time field for storing this document guarantees the uniqueness of this document, field designator and the model of the field in this document
Enclosing field ensures the foundation of subsequent index.
2. a kind of data index method of application drive according to claim 1, it is characterised in that: indexing means use B+
The form of tree comprising:
Three fields for including using file name take the maximum value of the field range of this document to be as the data for establishing B+ tree
Key, first five position of initial time are that value establishes a B+ tree, likewise, taking the minimum value of the field range of this document to be
Latter five of key, initial time establish a B+ tree for value；
It inquires the time of the field while inquiring two B+ trees, query result is combined into range, in addition field designator navigates to
File finally removes inquiry particular content hereof.
3. a kind of date storage method of application drive according to claim 1, it is characterised in that: before three field contents
Flag bit is placed, as soon as every acquisition information, will be compared by the field contents of coding with the data in correspondence memory, such as
Fruit has existed identical content, is just added to the corresponding flag bit after coding of the field contents newly obtained
Before existing field, if there is no content, it will just be added in correspondence memory after new field and flag bit coding.
4. a kind of data index method of application drive according to claim 2, it is characterised in that: the number in based on memory
According to file is had been written into, mode that there are two types of the leaf nodes of acquisition B+ tree monitors memory first is that obtaining from memory variable at any time
Dynamically, initial time and field range are got when executing and file operation being written, second is that directly obtaining from file name；
The time in filename and field range, standard time length position 10 are obtained, two fields each five is divided into, takes simultaneously
First five position of the maximum value and minimum value of field range out, maximum value and time form a dictionary, maximum value position key, time
First five position be value, one dictionary of rear five compositions of minimum value and time, latter five of minimum value key, time are
value；
Leaf node of the key-value key-value pair that will acquire as B+ tree, establishes two B+ trees.Simultaneously two when inquiry
It is inquired in B+ tree, the result inquired is formed into field range, adds field designator, searched in listed files corresponding literary
Part.
5. a kind of data index method of application drive according to claim 4, it is characterised in that: the foundation of B+ tree and more
New technological process is as follows:
Step 1: judging whether the key-value is leaf node, if then turning to step 3, is not, turns to step 2；
Step 2: judging leaf node number, sub-node type, if node number is greater than 1, be inserted into using binary search
Compare the size of key if interstitial content is 1, then judge node type in position；If node type is leaf node,
Step 3 is then turned to, if node type is n omicronn-leaf child node, continues step 2；
Step 3: judging the state of leaf node, if node state is sky, is inserted into data, is not sky, then judges leaf knot
Point number, when leaf node number be greater than 1, then use binary search insertion position, step 4 is then turned to, when leaf knot
Point number is equal to 1, then directly to step 4；
Step 4: comparing the size of leaf node and data, judge whether leaf node is full, if leaf node is less than, is inserted into
Data carry out the division of B+ tree if leaf node is full, turn to step 5；
Step 5: creation father node, if it is, insertion data, if not node number, node type is then judged, node is not
It is full, then data are inserted into, node is full then to continue step 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810039941.4A CN110109914A (en) | 2018-01-16 | 2018-01-16 | A kind of data storage of application drive and indexing means |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810039941.4A CN110109914A (en) | 2018-01-16 | 2018-01-16 | A kind of data storage of application drive and indexing means |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110109914A true CN110109914A (en) | 2019-08-09 |
Family
ID=67483451
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810039941.4A Pending CN110109914A (en) | 2018-01-16 | 2018-01-16 | A kind of data storage of application drive and indexing means |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110109914A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5613105A (en) * | 1993-06-30 | 1997-03-18 | Microsoft Corporation | Efficient storage of objects in a file system |
| CN1464436A (en) * | 2002-06-26 | 2003-12-31 | 联想(北京)有限公司 | Data storing and query combination method in a flush type system |
| CN102508913A (en) * | 2011-11-17 | 2012-06-20 | 张真 | Cloud computing system with data cube storage index structure |
| CN102722449A (en) * | 2012-05-24 | 2012-10-10 | 中国科学院计算技术研究所 | Key-Value local storage method and system based on solid state disk (SSD) |
| US8812554B1 (en) * | 2012-03-22 | 2014-08-19 | Projectx, International Ltd. | Method and system for storing shared data records in relational database |
| CN105117417A (en) * | 2015-07-30 | 2015-12-02 | 西安交通大学 | Read-optimized memory database Trie tree index method |
| CN107515901A (en) * | 2017-07-24 | 2017-12-26 | 中国科学院信息工程研究所 | A kind of chain type daily record storage organization and its Hash Index Structure, data manipulation method and server, medium |
-
2018
- 2018-01-16 CN CN201810039941.4A patent/CN110109914A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5613105A (en) * | 1993-06-30 | 1997-03-18 | Microsoft Corporation | Efficient storage of objects in a file system |
| CN1464436A (en) * | 2002-06-26 | 2003-12-31 | 联想(北京)有限公司 | Data storing and query combination method in a flush type system |
| CN102508913A (en) * | 2011-11-17 | 2012-06-20 | 张真 | Cloud computing system with data cube storage index structure |
| US8812554B1 (en) * | 2012-03-22 | 2014-08-19 | Projectx, International Ltd. | Method and system for storing shared data records in relational database |
| CN102722449A (en) * | 2012-05-24 | 2012-10-10 | 中国科学院计算技术研究所 | Key-Value local storage method and system based on solid state disk (SSD) |
| CN105117417A (en) * | 2015-07-30 | 2015-12-02 | 西安交通大学 | Read-optimized memory database Trie tree index method |
| CN107515901A (en) * | 2017-07-24 | 2017-12-26 | 中国科学院信息工程研究所 | A kind of chain type daily record storage organization and its Hash Index Structure, data manipulation method and server, medium |
Non-Patent Citations (1)
| Title |
|---|
| 曲朝阳;孙立擎;许劭庆;蔺树全;尹相爱;: "基于B+树的电力大数据分布式索引", 东北电力大学学报, no. 05 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9870382B2 (en) | Data encoding and corresponding data structure | |
| CN111629081B (en) | Internet Protocol (IP) address data processing method and device and electronic equipment | |
| CN106777387B (en) | HBase-based Internet of things big data access method | |
| CN102110132A (en) | Uniform resource locator matching and searching method, device and network equipment | |
| CN113434557B (en) | Method, device, equipment and storage medium for querying range of label data | |
| CN106815260B (en) | Index establishing method and equipment | |
| CN102521375B (en) | Directory service data retrieval method and directory service data retrieval system | |
| WO2018001085A1 (en) | Data storage method and device, data lookup request processing method and device | |
| CN105740410A (en) | Data statistics method based on Hbase secondary index | |
| CN110413711A (en) | A kind of variance data acquisition methods and its storage medium | |
| CN103746851A (en) | Method and device for realizing counting of independent user number | |
| CN111475511A (en) | Data storage method, data access method, data storage device, data access device and data access equipment based on tree structure | |
| CN107766512B (en) | Log data storage method and log data storage system | |
| CN110109914A (en) | A kind of data storage of application drive and indexing means | |
| EP3282372A1 (en) | Method and apparatus for storing data | |
| CN112269726A (en) | Data processing method and device | |
| CN114025024B (en) | Data transmission method and device | |
| CN110928902A (en) | Query method and system for acquiring cloud platform terminal data aiming at paging | |
| CN106156197A (en) | The querying method of a kind of data base and device | |
| CN110990640B (en) | Data determination method, device, equipment and computer readable storage medium | |
| CN108959584A (en) | A kind of method and device of the processing diagram data based on community structure | |
| CN112954082B (en) | Domain name registration IP address query method and device | |
| CN113656438A (en) | Data query method and device of data tree | |
| WO2004081710A3 (en) | System and method for storing and accessing data in an interlocking trees datastore | |
| CN116821177B (en) | Equipment data query method and device, electronic 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 |