CN105787083A - Data processing method and device - Google Patents
Data processing method and device Download PDFInfo
- Publication number
- CN105787083A CN105787083A CN201610122399.XA CN201610122399A CN105787083A CN 105787083 A CN105787083 A CN 105787083A CN 201610122399 A CN201610122399 A CN 201610122399A CN 105787083 A CN105787083 A CN 105787083A
- Authority
- CN
- China
- Prior art keywords
- data
- associated container
- write
- described data
- data processing
- 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
- G06F16/2457—Query processing with adaptation to user needs
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (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 data processing method. The data processing method includes the steps that data redundancy is eliminated through an associative container, and redundancy-eliminated data is generated into a database; when data is introduced, a query interface is called to query whether the data exists in the associative container or not in a balanced binary tree mode; when the data does not exist in the associative container, a writing-in interface is called to write the data into the database, and when writing is completed, coding ID corresponding to the data is obtained; the ID and the data are associatively saved to the associative container. The invention further discloses a data processing device. By means of the data processing method and device, data processing efficiency is greatly improved.
Description
Technical field
The present invention relates to database technical field, particularly relate to big data processing method and device.
Background technology
In prior art, when database data being carried out the data such as inquiry is extracted, eliminating redundancy, data file import and export and processing, such as vapour is examined big data carry out data write time, problem in order to avoid data redundancy, firstly the need of whether inquiring about in data base written into these data, it is typically with general circulation and adds judgment model, if as by for circulation ... else ... search every data of data base successively till inquiring these data, now, just no longer write the data in data base；Or till lookup full number does not all inquire these data according to storehouse, now write the data in data base.When the data volume in data base is very big, the overlong time of data query can be caused, thus causing that the efficiency that data process is low.
Summary of the invention
Present invention is primarily targeted at a kind of data processing method of proposition and device, it is intended to solve the technical problem that available data treatment effeciency is low.
For achieving the above object, the present invention provides a kind of data processing method, and described data processing method comprises the following steps:
When generating data to data storehouse by associated container, call query interface and adopt balanced binary tree mode inquires about in associated container whether deposited described data；
When associated container does not deposit described data, call write interface by described data write into Databasce, and when write completes, obtain the coding ID that described data are corresponding；
Described ID is preserved to associated container with described data association.
Preferably, the described step by described ID with described data association preservation to associated container includes:
Described data and described ID are assigned to the object mated with described associated container preset；
Described object is stored in described associated container.
Preferably, described object includes the first variable and the second variable, and the step of the described object mated with described associated container being assigned to described data and described ID preset includes:
Described data are assigned to the first variable of described object；
Described ID is assigned to the second variable of described object.
Preferably, described when not depositing described data in associated container, call write interface and the step in described data write into Databasce is included:
When associated container does not deposit described data, it is judged that data base does not write described data；
When not writing described data in judging data base, call write interface by described data write into Databasce.
Preferably, described data processing method further comprises the steps of:
When associated container deposits described data, then do not carry out the write operation of described data.
Additionally, for achieving the above object, the present invention also proposes a kind of data processing equipment, and described data processing equipment includes:
Enquiry module, for when generating data to data storehouse by associated container, calling query interface and adopt balanced binary tree mode inquires about in associated container whether deposited described data；
Processing module, during for not depositing described data in associated container, calls write interface by described data write into Databasce, and when write completes, obtains the coding ID that described data are corresponding；
Memory module, for preserving described ID to associated container with described data association.
Preferably, described memory module includes:
Assignment unit, for being assigned to the object mated with described associated container preset by described data and described ID；
Memory element, for being stored in described associated container by described object.
Preferably, described object includes the first variable and the second variable, and described assignment unit is used for:
Described data are assigned to the first variable of described object；
Described ID is assigned to the second variable of described object.
Preferably, described processing module includes:
Judging unit, during for not depositing described data, it is judged that do not write described data in data base in associated container；
Processing unit, during for not writing described data in judging data base, calls write interface by described data write into Databasce.
Preferably, described processing module is additionally operable to:
When associated container deposits described data, then do not carry out the write operation of described data.
The data processing method of present invention proposition and device, when incoming data, first call query interface and adopt balanced binary tree mode inquires about in associated container whether had these data, when inquiry associated container does not deposit these data, recall write interface and write the data in data base, and when write completes, obtain the coding ID that these data are corresponding, these data are associated with corresponding ID and preserves to associated container, make the data of write and the data consistent of preservation in associated container in data base, ensure that the data not write before the data in presently written data base are all, eliminate the data redundancy problem of data base, and adopt balanced binary tree mode to inquire about the efficiency of data in associated container higher than the efficiency directly inquiring about every data in data base successively, therefore, improve the efficiency that data process.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of data processing method first embodiment of the present invention；
Described ID is preserved the refinement schematic flow sheet to associated container with described data association in data processing method the second embodiment of the present invention by Fig. 2；
Fig. 3 is the high-level schematic functional block diagram of data processing equipment first embodiment of the present invention；
Fig. 4 is the refinement high-level schematic functional block diagram of memory module in data processing equipment the second embodiment of the present invention；
Fig. 5 is the refinement high-level schematic functional block diagram of processing module in data processing equipment the second embodiment of the present invention.
The realization of the object of the invention, functional characteristics and advantage will in conjunction with the embodiments, are described further with reference to accompanying drawing.
Detailed description of the invention
Should be appreciated that specific embodiment described herein is only in order to explain the present invention, is not intended to limit the present invention.
The present invention provides a kind of data processing method, with reference to the schematic flow sheet that Fig. 1, Fig. 1 are data processing method first embodiment of the present invention.
In the present embodiment, this data processing method comprises the following steps:
Step S10, when generating data to data storehouse by associated container, calls query interface and adopts balanced binary tree mode inquires about in associated container whether deposited described data；
Associated container be a kind of realize in balanced binary tree mode, insert any element all by corresponding ranking criteria to determine a kind of container of its position.Conventional associated container includes set, multiset, map and multimap.Wherein, the element of map be " key-value " to two tuple forms, store and read data efficiently by key (key), value then represents the data that institute stores and reads.In the present embodiment, for map associated container, data processing method of the present invention is described in detail.
Such as, definition map associated container m_mText:map<CString, unsignedlong>m_mText, wherein the CString type inside m_mText uses as key, and unsignedlong type is written to, for certain data, the coding ID that these data after data base are corresponding.Meanwhile, being also preset with a write interface in the present embodiment, said write interface is used for writing data in data base.Such as, said write interface is AddItemTocntextTxtGetID (CStringstr).
When by certain data of said write interface AddItemTocntextTxtGetID (CStringstr) incoming character string type, directly described data are not write in corresponding data base, but first call query interface m_mText.find (str) inquires about in associated container whether deposited described data.The bottom of associated container encapsulates a lot of common interfaces of also heavy duty, and query interface m_mText.find (str) is one of them.When incoming data, incoming described data are compared by described query interface m_mText.find (str) with the data of preservation in described associated container m_mText, inquire about in described associated container m_mText whether deposited described data.Wherein, if described data are incoming Article 1 data, namely described associated container m_mText is when being still empty, then directly invokes said write interface AddItemTocntextTxtGetID (CStringstr) and described data are write in described data base.
Owing to described associated container m_mText realizes in balanced binary tree mode, insert and the time complexity of inquiry is all O (logN), (time complexity O (N)) is inquired about successively without data one data as general query in data base, therefore, query script is abnormal efficiently.
Step S20, when not depositing described data in associated container, calls write interface by described data write into Databasce, and when write completes, obtains the coding ID that described data are corresponding；
When described query interface m_mText.find (str) inquires and do not deposit described data in described associated container m_mText, then call said write interface AddItemTocntextTxtGetID (CStringstr) and described data are write in described data base.When described query interface m_mText.find (str) inquires and deposits described data in described associated container m_mText, then do not carry out the write operation of described data, no longer described data are written in described data base.
In the present embodiment, in described data base, each data of write all has the coding ID of a unique correspondence.When calling said write interface AddItemTocntextTxtGetID (CStringstr) and the described data described data base of write being completed, generate the ID that described data are corresponding, described associated container m_mText and obtain the ID that described data are corresponding.
Step S30, preserves described ID to associated container with described data association.
After getting the ID that described data are corresponding, described data are associated with described ID and is stored in described associated container m_mText.Afterwards, it may be judged whether also need to continue to write to other data, if also having other data to write, then circulate described step S10-S30, write every data successively.If not having other data to need to be written with, then closing described data base, data write operation terminates.Therefore, in the present embodiment, the data preserved in described associated container m_mText and the data consistent of write in described data base.Further, the data of write are all the data do not deposited in described associated container m_mText and described data base every time, and therefore, described associated container m_mText and the data in described data base all do not repeat, the problem being absent from data redundancy.
By 20 carriage type of contrast experiment's loading processing (having 17 systems under each carriage type), adopt traditional method that the diagnosis data of all carriage type are exported to the time overhead of data base about half an hour, and adopt the scheme of the present embodiment, the diagnosis data of all carriage type are exported to the time overhead of data base less than 10 seconds, substantially increase data-handling efficiency.
The data processing method that the present embodiment provides, when incoming data, call in query interface inquiry associated container and whether deposited described data, when associated container does not deposit described data, call write interface by described data write into Databasce, and when write completes, obtain the coding ID that described data are corresponding, described ID is preserved to associated container with described data association, make the data of write and the data consistent of preservation in associated container in data base, namely ensure that the data not write before the data in write into Databasce are all, eliminate the data redundancy problem of data base, owing to associated container realizes in balanced binary tree mode, adopt balanced binary tree mode to insert in associated container and to inquire about data efficiency high, therefore, efficiency that data process is greatly improved.
Further, as in figure 2 it is shown, propose data processing method the second embodiment of the present invention based on first embodiment.In the present embodiment, described step S30 includes:
Described data and described ID are assigned to the object mated with described associated container preset by step S31；
Step S32, is stored in described associated container by described object.
In the present embodiment, except being preset with said write interface AddItemTocntextTxtGetID (CStringstr), also it is preset with the object mated with described associated container.Such as, presetting described object is pair object: pair<CString, unsignedlong>pValue.
After getting the ID that described data are corresponding, described data and described ID are assigned to the described object pValue mated with described associated container preset.Described object pValue includes the first variable pValue.first and the second variable pValue.second.Specifically, described step S31 includes:
Described data are assigned to the first variable of described object by step a；
Step b, is assigned to the second variable of described object by described ID.
After getting the ID that described data are corresponding, described data are assigned to the first variable pValue.first of described object pValue, described ID is assigned to the second variable pValue.second of described object pValue.Such as, if described data are " Peripheralaccelerationsensorfrontpassengerpresent ", ID corresponding to described data is the return value after calling and perform interface AddItemTocntextTxtGetID (pValue.first), first variable pValue.first=" Peripheralaccelerationsensorfrontpassengerpresent " described in assignment, the second variable pValue.second=AddItemTocntextTxtGetID (pValue.first) described in assignment.When described object pValue assignment completes, described object pValue is stored in described associated container m_mText, thus completing the write operation of a data.
Further, in the present embodiment, described step S20 includes:
Step c, when not depositing described data in associated container, it is judged that does not write described data in data base；
Step d, when not writing described data in judging data base, calls write interface by described data write into Databasce.
In the present embodiment, when call query interface m_mText.find (str) inquire described associated container m_mText does not deposit described data time, due to the data preserved in described associated container m_mText and the data consistent of write in described data base, therefore, it is judged that described data base does not write described data.Otherwise, when call query interface m_mText.find (str) inquire described associated container m_mText deposits described data time, then judge in described data base written into described data.When judging described data base does not write described data, call said write interface AddItemTocntextTxtGetID (CStringstr) by described data write into Databasce.When judging in described data base written into described data, then do not carry out the write operation of described data, no longer described data are written in described data base.
The data processing method that the present embodiment provides, by the object mated with described associated container being assigned to preset by the ID that described data are corresponding with described data, then the object after assignment is stored in described associated container, also it is stored in described associated container by described data, make full use of associated container " key-value " to two tuple forms, stored efficiently by key and inquire about data, improve the efficiency that data process.
The present invention further provides a kind of data processing equipment, as it is shown on figure 3, the high-level schematic functional block diagram that Fig. 3 is data processing equipment first embodiment of the present invention.
In the present embodiment, this data processing equipment includes:
Enquiry module 10, for when generating data to data storehouse by associated container, calling in query interface inquiry associated container whether deposited described data；
Associated container be a kind of realize in balanced binary tree mode, insert any element all by corresponding ranking criteria to determine a kind of container of its position.Conventional associated container includes set, multiset, map and multimap.Wherein, the element of map be " key-value " to two tuple forms, store and read data efficiently by key (key), value then represents the data that institute stores and reads.In the present embodiment, for map associated container, data processing method of the present invention is described in detail.
Such as, definition map associated container m_mText:map<CString, unsignedlong>m_mText, wherein the CString type inside m_mText uses as key, and unsignedlong type is written to, for certain data, the coding ID that these data after data base are corresponding.Meanwhile, being also preset with a write interface in the present embodiment, said write interface is used for writing data in data base.Such as, said write interface is AddItemTocntextTxtGetID (CStringstr).
When by certain data of said write interface AddItemTocntextTxtGetID (CStringstr) incoming character string type, directly described data are not write in corresponding data base, but call query interface m_mText.find (str) inquires about in associated container whether deposited described data by enquiry module 10.The bottom of associated container encapsulates a lot of common interfaces of also heavy duty, and query interface m_mText.find (str) is one of them.When incoming data, incoming described data are compared by enquiry module 10 with the data of preservation in described associated container m_mText, inquire about in described associated container m_mText whether deposited described data.
Owing to described associated container m_mText realizes in balanced binary tree mode, insert and the time complexity of inquiry is all O (logN), (time complexity O (N)) is inquired about successively without data one data as general query in data base, therefore, enquiry module 10 query script is abnormal efficiently.
Processing module 20, during for not depositing described data in associated container, calls write interface by described data write into Databasce, and when write completes, obtains the coding ID that described data are corresponding；
When enquiry module 10 inquires and do not deposit described data in described associated container m_mText, then processing module 20 calls said write interface AddItemTocntextTxtGetID (CStringstr) by the described data described data base of write.Wherein, if described data are incoming Article 1 data, namely described associated container m_mText is when being still empty, then enquiry module 10 does not need to perform query manipulation, and processing module 20 directly invokes said write interface AddItemTocntextTxtGetID (CStringstr) and described data write in described data base.When enquiry module 10 inquires and deposits described data in described associated container m_mText, then processing module 20 does not carry out the write operation of described data, no longer described data is written in described data base.
In the present embodiment, in described data base, each data of write all has the coding ID of a unique correspondence.When processing module 20 call said write interface AddItemTocntextTxtGetID (CStringstr) by described data write described data base complete time, generate the ID that described data are corresponding, processing module 20 obtains the ID that described data are corresponding.
Memory module 30, for preserving described ID to associated container with described data association.
After processing module 20 gets the ID that described data are corresponding, described data are associated with described ID and are stored in described associated container m_mText by memory module 30.Afterwards, processing module 20 judges whether to also need to continue to write to other data, if also having other data to write, then enquiry module 10, processing module 20 and memory module 30 continue executing with respective operation, write every data successively.If not having other data to need to be written with, then processing module 20 controls described data base closedown, and data write operation terminates.Therefore, in the present embodiment, the data preserved in described associated container m_mText and the data consistent of write in described data base.Further, the data of write are all the data do not deposited in described associated container m_mText and described data base every time, and therefore, described associated container m_mText and the data in described data base all do not repeat, the problem being absent from data redundancy.
By 20 carriage type of contrast experiment's loading processing (having 17 systems under each carriage type), adopt traditional method that the diagnosis data of all carriage type are exported to the time overhead of data base about half an hour, and adopt the scheme of the present embodiment, the diagnosis data of all carriage type are exported to the time overhead of data base less than 10 seconds, substantially increase data-handling efficiency.
nullThe data processing equipment that the present embodiment provides，When incoming data，Enquiry module 10 calls in query interface inquiry associated container whether deposited described data，When associated container does not deposit described data，Processing module 20 calls write interface by described data write into Databasce，And when write completes，Obtain the coding ID that described data are corresponding，Described ID is preserved to associated container by memory module 30 with described data association，Make the data of write and the data consistent of preservation in associated container in data base，Namely ensure that the data not write before the data in write into Databasce are all，Eliminate the data redundancy problem of data base，Owing to associated container realizes in balanced binary tree mode，Adopt balanced binary tree mode to insert in associated container and to inquire about data efficiency high，Therefore，Efficiency that data process is greatly improved.
Further, as shown in Figure 4, based on first embodiment, data processing equipment the second embodiment of the present invention is proposed.In the present embodiment, described memory module 30 includes:
Assignment unit 31, for being assigned to the object mated with described associated container preset by described data and described ID；
Memory element 32, for being stored in described associated container by described object.
In the present embodiment, except being preset with said write interface AddItemTocntextTxtGetID (CStringstr), also it is preset with the object mated with described associated container.Such as, presetting described object is pair object: pair<CString, unsignedlong>pValue.
After processing module 20 gets the ID that described data are corresponding, described data and described ID are assigned to the described object pValue mated with described associated container preset by assignment unit 31.Described object pValue includes the first variable pValue.first and the second variable pValue.second.Specifically, described assignment unit 31 is used for:
Described data are assigned to the first variable of described object；
Described ID is assigned to the second variable of described object.
After processing module 20 gets the ID that described data are corresponding, described data are assigned to the first variable pValue.first of described object pValue by assignment unit 31, and described ID is assigned to the second variable pValue.second of described object pValue.Such as, if described data are " Peripheralaccelerationsensorfrontpassengerpresent "；ID corresponding to described data is the return value after calling and perform interface AddItemTocntextTxtGetID (pValue.first), first variable pValue.first=" Peripheralaccelerationsensorfrontpassengerpresent " described in assignment unit 31 assignment, the second variable pValue.second=AddItemTocntextTxtGetID (pValue.first) described in assignment unit 31 assignment.When described object pValue assignment is completed by assignment unit 31, described object pValue is stored in described associated container m_mText by memory element 32, thus completing the write operation of a data.
Further, in the present embodiment, as it is shown in figure 5, described processing module 20 includes:
Judging unit 21, during for not depositing described data, it is judged that do not write described data in data base in associated container；
Processing unit 22, during for not writing described data in judging data base, calls write interface by described data write into Databasce.
In the present embodiment, when enquiry module 10 inquires and does not deposit described data in described associated container m_mText, due to the data preserved in described associated container m_mText and the data consistent of write in described data base, therefore, it is judged that unit 21 judges not write in described data base described data.Otherwise, when enquiry module 10 inquires and deposits described data in described associated container m_mText, then judging unit 21 judges in described data base written into described data.When judging unit 21 judges not write described data in described data base, processing unit 22 calls said write interface AddItemTocntextTxtGetID (CStringstr) by described data write into Databasce.When judging unit 21 judges in described data base written into described data, then processing unit 22 does not carry out the write operation of described data, no longer described data is written in described data base.
The data processing equipment that the present embodiment provides, by assignment unit 31, the ID that described data are corresponding with described data is assigned to the object mated with described associated container preset, then the object after assignment is stored in described associated container by memory element 32, also it is stored in described associated container by described data, make full use of associated container " key-value " to two tuple forms, stored efficiently by key and inquire about data, improve the efficiency that data process.
These are only the preferred embodiments of the present invention; not thereby the scope of the claims of the present invention is limited; every equivalent structure utilizing description of the present invention and accompanying drawing content to make or equivalence flow process conversion; or directly or indirectly it is used in other relevant technical fields, all in like manner include in the scope of patent protection of the present invention.
Claims (10)
1. a data processing method, it is characterised in that described data processing method comprises the following steps:
When generating data to data storehouse by associated container, call query interface and adopt balanced binary tree mode inquires about in associated container whether deposited described data；
When associated container does not deposit described data, call write interface by described data write into Databasce, and when write completes, obtain the coding ID that described data are corresponding；
Described ID is preserved to associated container with described data association.
2. data processing method as claimed in claim 1, it is characterised in that the described step by described ID with described data association preservation to associated container includes:
Described data and described ID are assigned to the object mated with described associated container preset；
Described object is stored in described associated container.
3. data processing method as claimed in claim 2, it is characterised in that described object includes the first variable and the second variable, and the step of the described object mated with described associated container being assigned to described data and described ID preset includes:
Described data are assigned to the first variable of described object；
Described ID is assigned to the second variable of described object.
4. data processing method as claimed in claim 1, it is characterised in that described when not depositing described data in associated container, calls write interface and the step in described data write into Databasce is included:
When associated container does not deposit described data, it is judged that data base does not write described data；
When not writing described data in judging data base, call write interface by described data write into Databasce.
5. the data processing method as described in any one of claim 1-4, it is characterised in that described data processing method further comprises the steps of:
When associated container deposits described data, then do not carry out the write operation of described data.
6. a data processing equipment, it is characterised in that described data processing equipment includes:
Enquiry module, for when generating data to data storehouse by associated container, calling query interface and adopt balanced binary tree mode inquires about in associated container whether deposited described data；
Processing module, during for not depositing described data in associated container, calls write interface by described data write into Databasce, and when write completes, obtains the coding ID that described data are corresponding；
Memory module, for preserving described ID to associated container with described data association.
7. data processing equipment as claimed in claim 6, it is characterised in that described memory module includes:
Assignment unit, for being assigned to the object mated with described associated container preset by described data and described ID；
Memory element, for being stored in described associated container by described object.
8. data processing equipment as claimed in claim 7, it is characterised in that described object includes the first variable and the second variable, and described assignment unit is used for:
Described data are assigned to the first variable of described object；
Described ID is assigned to the second variable of described object.
9. data processing equipment as claimed in claim 6, it is characterised in that described processing module includes:
Judging unit, during for not depositing described data, it is judged that do not write described data in data base in associated container；
Processing unit, during for not writing described data in judging data base, calls write interface by described data write into Databasce.
10. the data processing equipment as described in any one of claim 6-9, it is characterised in that described processing module is additionally operable to:
When associated container deposits described data, then do not carry out the write operation of described data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610122399.XA CN105787083A (en) | 2016-03-02 | 2016-03-02 | Data processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610122399.XA CN105787083A (en) | 2016-03-02 | 2016-03-02 | Data processing method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105787083A true CN105787083A (en) | 2016-07-20 |
Family
ID=56387997
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610122399.XA Pending CN105787083A (en) | 2016-03-02 | 2016-03-02 | Data processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105787083A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106557583A (en) * | 2016-11-29 | 2017-04-05 | 用友网络科技股份有限公司 | Archival storage and archives storage method |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101315640A (en) * | 2008-07-01 | 2008-12-03 | 中兴通讯股份有限公司 | Directory management method and apparatus |
| CN101699802A (en) * | 2009-10-23 | 2010-04-28 | 北京锐安科技有限公司 | Method for branching mass data |
| CN101819596A (en) * | 2010-04-28 | 2010-09-01 | 烽火通信科技股份有限公司 | Memory-based XML script buffer |
| CN101986649A (en) * | 2010-11-29 | 2011-03-16 | 深圳天源迪科信息技术股份有限公司 | Shared data center used in telecommunication industry billing system |
| CN102521334A (en) * | 2011-12-07 | 2012-06-27 | 广东工业大学 | Data storage and query method based on classification characteristics and balanced binary tree |
| CN102831127A (en) * | 2011-06-17 | 2012-12-19 | 阿里巴巴集团控股有限公司 | Method, device and system for processing repeating data |
| CN103888424A (en) * | 2012-12-20 | 2014-06-25 | 航天信息股份有限公司 | Cluster-type data encryption system and data processing method thereof |
-
2016
- 2016-03-02 CN CN201610122399.XA patent/CN105787083A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101315640A (en) * | 2008-07-01 | 2008-12-03 | 中兴通讯股份有限公司 | Directory management method and apparatus |
| CN101699802A (en) * | 2009-10-23 | 2010-04-28 | 北京锐安科技有限公司 | Method for branching mass data |
| CN101819596A (en) * | 2010-04-28 | 2010-09-01 | 烽火通信科技股份有限公司 | Memory-based XML script buffer |
| CN101986649A (en) * | 2010-11-29 | 2011-03-16 | 深圳天源迪科信息技术股份有限公司 | Shared data center used in telecommunication industry billing system |
| CN102831127A (en) * | 2011-06-17 | 2012-12-19 | 阿里巴巴集团控股有限公司 | Method, device and system for processing repeating data |
| CN102521334A (en) * | 2011-12-07 | 2012-06-27 | 广东工业大学 | Data storage and query method based on classification characteristics and balanced binary tree |
| CN103888424A (en) * | 2012-12-20 | 2014-06-25 | 航天信息股份有限公司 | Cluster-type data encryption system and data processing method thereof |
Non-Patent Citations (1)
| Title |
|---|
| 陈锐 等: "《零基础学数据结构 第二版》", 30 June 2014 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106557583A (en) * | 2016-11-29 | 2017-04-05 | 用友网络科技股份有限公司 | Archival storage and archives storage method |
| CN106557583B (en) * | 2016-11-29 | 2020-07-03 | 用友网络科技股份有限公司 | Archive storage device and archive storage method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105718455B (en) | A kind of data query method and device | |
| US20160140152A1 (en) | Intelligent compiler for parallel graph processing | |
| CA2562281C (en) | Partial query caching | |
| CN104391954B (en) | The processing method and processing device of database journal | |
| US20120166402A1 (en) | Techniques for extending horizontal partitioning to column partitioning | |
| CN104636349B (en) | A kind of index data compression and the method and apparatus of index data search | |
| CN103294822B (en) | A kind of based on active Hash with the high-efficiency caching method of Bloom filter | |
| US20090216755A1 (en) | Indexing Method For Multimedia Feature Vectors Using Locality Sensitive Hashing | |
| CN103761102B (en) | A kind of uniform data service platform and its implementation | |
| CN102880628A (en) | Hash data storage method and device | |
| CN101848248B (en) | Rule searching method and device | |
| CN102193948A (en) | Feature matching method and device | |
| CN106815256A (en) | Set up the method and device of laws and regulations bar fund incidence relation | |
| CN106685902A (en) | User authority management method, client and server | |
| CN101277252A (en) | Method for traversing multi-branch Trie tree | |
| CN106933897A (en) | Data query method and apparatus | |
| CN103870511B (en) | Information inquiry device and method based on shared drive | |
| CN106777170A (en) | Strengthen the medical information document handling system and method for server access speed | |
| CN105787083A (en) | Data processing method and device | |
| CN107992402A (en) | Blog management method and log management apparatus | |
| CN108549666B (en) | Data table sorting method, device, equipment and storage medium | |
| CN106557503A (en) | A kind of method and system of image retrieval | |
| CN109656947A (en) | Data query method, apparatus, computer equipment and storage medium | |
| CN107807976A (en) | IP attribution inquiry methods and device | |
| CN105718478A (en) | Data storage method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160720 |
|
| RJ01 | Rejection of invention patent application after publication |