CN107357910A - A kind of method and device of data comparison - Google Patents
A kind of method and device of data comparison Download PDFInfo
- Publication number
- CN107357910A CN107357910A CN201710585628.6A CN201710585628A CN107357910A CN 107357910 A CN107357910 A CN 107357910A CN 201710585628 A CN201710585628 A CN 201710585628A CN 107357910 A CN107357910 A CN 107357910A
- Authority
- CN
- China
- Prior art keywords
- key values
- record
- hashmap
- data
- values
- 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/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- 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
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 method and device of data comparison, methods described includes：Initial data is preserved into the first HashMap, the data after preservation processing are into the 2nd HashMap；The Key values in the first HashMap and the 2nd HashMap are traveled through respectively, and searches other side and whether there is the Key values, if it does not exist, then judging that data record corresponding to Key values generates change；If it does, judge that whether Value values corresponding to Key values are identical described in Value values corresponding to Key values and the 2nd HashMap in the first HashMap, if identical, judge that data corresponding to the Key values are not changed；If it is different, then judge that data record corresponding to the Key values records for modification.The application has only used two substance circulations rather than double circulation, thus reduces the time of data processing, improves the efficiency of data processing.
Description
Technical field
The present invention relates to areas of information technology, more particularly to a kind of method and device of data comparison.
Background technology
In IT trade, some data can be handled, therefore staff is usually needed to before and after the processing
Data contrasted, find out it is therein change so as to carry out the analysis of next step.For example form is used in Web system
The data of the user configuration of displaying, it is possible to the processing newly such as increased, changed, being deleted to it, being then saved to backstage again,
When these data change, software developer just needs the data after change and initial data to contrast, quick and precisely
The change of data after ground is found out before changing.
This problem is solved at present typically using saving the data among array, is compared between two arrays before and after the processing
Difference, i.e., the array after array where traveling through initial data respectively and processing where data, where initial data is traveled through
During array compared with the array after processing where data, after traversal processing during array where data with initial data institute
Array be compared, according to the comparison of data in this twice array come find out those carried out change data.This side
Method is although feasible, but the time of data processing is longer, and the efficiency of data processing is low.
The content of the invention
It is longer to solve the time of data processing it is an object of the invention to provide a kind of method and device of data comparison,
The problem of efficiency of data processing is low.
Initial data is preserved into the first HashMap, the data after preservation processing are into the 2nd HashMap；
The Key values in the first HashMap and the 2nd HashMap are traveled through respectively, and are searched other side and be whether there is
The Key values, if it does not exist, then judging that data record corresponding to the Key values generates change；If it does, judge institute
State Value corresponding to Key values described in Value values corresponding to Key values described in the first HashMap and the 2nd HashMap
Whether value is identical, if identical, judges that data corresponding to the Key values are not changed；If it is different, then described in judging
Data record corresponding to Key values records for modification.
Alternatively, it is described to judge that data record corresponding to the Key values generates change, including：
If the Key values that the first HashMap is traversed are not present in the 2nd HashMap, the Key values are judged
Corresponding data record is deletion record；
If the Key values that the 2nd HashMap is traversed are not present in the first HashMap, the Key values are judged
Corresponding data record is newly-increased record.
Alternatively, after judging that data record is deletion record corresponding to the Key values, in addition to：By the Key values
Corresponding Value values are added in the array for preserving deletion record, and the array renewal of the preservation deletion record is arrived
In database；
After judging data record corresponding to the Key values for newly-increased record, in addition to：By corresponding to the Key values
Value values are added in the array for preserving newly-increased record, and the array renewal for preserving newly-increased record is arrived into database
In.
Alternatively, after judging that data record corresponding to the Key values records for modification, in addition to：By the Key values
Corresponding Value values are added in the array for preserving modification record, and the array renewal for preserving modification record is arrived
In database.
Present invention also offers a kind of device of data comparison, including：Memory module and judge module；
Wherein, the memory module, for preserving initial data into the first HashMap, the data after preservation processing arrive
In 2nd HashMap；
The judge module, for traveling through the Key values in the first HashMap and the 2nd HashMap respectively, and
Search other side and whether there is the Key values, if it does not exist, then judging that data record corresponding to the Key values generates change；
If it does, judge described in Value values corresponding to Key values described in the first HashMap and the 2nd HashMap
Whether Value values are identical corresponding to Key values, if identical, judge that data corresponding to the Key values are not changed；If
Difference, then judge that data record corresponding to the Key values records for modification.
Alternatively, the judge module includes：Traversal Unit, searching unit, judging unit is deleted, increases judging unit newly,
Change judging unit；
Wherein, the Traversal Unit, for traveling through the Key values in the first HashMap and the 2nd HashMap；
The searching unit, it whether there is the Key values for searching other side；
The deletion judging unit, if for being not present what the first HashMap was traversed in the 2nd HashMap
Key values, then judge that data record is deletion record corresponding to the Key values；
The newly-increased judging unit, if for being not present what the 2nd HashMap was traversed in the first HashMap
Key values, then judge data record corresponding to the Key values for newly-increased record；
The modification judging unit, if the Key values be present for other side, judge Key described in the first HashMap
Whether Value values corresponding to Key values are identical described in Value values corresponding to value and the 2nd HashMap, if identical,
Judge that data corresponding to the Key values are not changed；If it is different, then data record corresponding to the Key values is judged to repair
Change record.
Alternatively, described device also includes：Deletion record preserving module, increases record preserving module newly and modification record preserves
Module；
Wherein, the deletion record preserving module, for judging that data record is deletion record corresponding to the Key values
Afterwards, Value values corresponding to the Key values are added in the array for preserving deletion record；
The newly-increased record preserving module, for after judging data record corresponding to the Key values for newly-increased record,
Value values corresponding to the Key values are added in the array for preserving newly-increased record；
It is described modification record preserving module, for judge data record corresponding to the Key values for change record after,
Value values corresponding to the Key values are added in the array for preserving modification record.
Alternatively, described device also includes：Persistence module, for the array of the preservation deletion record, preservation is new
The array for increasing the array of record and preserving modification record is updated into database.
The method and device of data comparison provided by the present invention, the data after initial data and processing are stored in respectively
In two HashMap, the Key values in the two HashMap are traveled through respectively, and are searched other side and be whether there is the Key values traversed,
The alteration of data is judged according to lookup result.Using HashMap data storages, per data, all corresponding one of record is unique
Identify Key values, and the Key values can directly in HashMap quick obtaining, the Key values in the first HashMap is traveled through,
And when being searched in the 2nd HashMap it, the process of lookup need not be circulated, in traversal second
Key values in HashMap, and when being searched in the first HashMap it, it is same, therefore the method for the present invention and
Device has only used two substance circulations rather than double circulation, thus shortens the time of data processing, improves data processing
Efficiency.
Brief description of the drawings
, below will be to embodiment or existing for the clearer explanation embodiment of the present invention or the technical scheme of prior art
The required accompanying drawing used is briefly described in technology description, it should be apparent that, drawings in the following description are only this hair
Some bright embodiments, for those of ordinary skill in the art, on the premise of not paying creative work, can be with root
Other accompanying drawings are obtained according to these accompanying drawings.
The flow chart of the method for the data comparison that Fig. 1 is provided by the embodiment of the present invention；
The flow chart of the embodiment of the method for the data comparison that Fig. 2 is provided by the embodiment of the present invention；
The structured flowchart of the device for the data comparison that Fig. 3 is provided by the embodiment of the present invention.
Embodiment
The core of the present invention is to provide a kind of method and device of data comparison, longer to solve the time of data processing,
The problem of efficiency of data processing is low.
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.Obviously, described embodiment is only part of the embodiment of the present invention, rather than
Whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art are not making creative work premise
Lower obtained every other embodiment, belongs to the scope of protection of the invention.
Referring to Fig. 1, the flow chart of the method for the data comparison that Fig. 1 is provided by the embodiment of the present invention, including following step
Suddenly：
Step 101：Initial data is preserved into the first HashMap, the data after preservation processing are into the 2nd HashMap.
The data having after handling data can produce change, and some data will not produce change, in order to find out change
Data, first state two HashMap, then by initial data and processing after data be stored in respectively in two HashMap.
What is deposited in HashMap is key-value to Key-Value, is saved the data in HashMap, Key values are unique for data record
Mark, and Value values are the array for including each field in data record.
Step 102：The Key values in the first HashMap and the 2nd HashMap are traveled through respectively, and search other side
With the presence or absence of the Key values, if it does not exist, then judging that data record corresponding to the Key values generates change；If deposit
Judging Key values pair described in Value values corresponding to Key values described in the first HashMap and the 2nd HashMap
Whether the Value values answered are identical, if identical, judge that data corresponding to the Key values are not changed；If it is different, then
Judge that data record corresponding to the Key values records for modification.
By circulating the Key values traveled through respectively in two HashMap, when being often recycled to a Key value, the Key is looked up
Whether value is existed in other side, and Key values are the unique marks of data record, therefore when some Key value exists only in one
When in HashMap, the corresponding data record of the Key values must be changed, but some Key value is present in simultaneously
When in two HashMap, also not necessarily illustrate that this data does not change, but by the Key values in two HashMap
Corresponding Value values are taken out, two Value values by judging taking-up it is whether identical come judge this data whether there occurs
Change.
Saved the data in the embodiment of the present invention in HashMap, find the data changed using Key values and do not have
When having the data changed, and requiring to look up some Key value can directly in HashMap quick obtaining, it is not necessary to enter
Row circulation, therefore during progress data comparison, method of the invention has only used two substances circulations rather than double circulation, thus subtracts
Lack the time of data processing, improve the efficiency of data processing.
Although can interpolate that out that data are changed in embodiments of the present invention, the specific feelings that it can not be changed
Condition is judged, therefore it can be further improved, below face combine the present invention embodiment carry out it is detailed
Thin description.
It refer to Fig. 2, the flow of the embodiment of the method for the data comparison that Fig. 2 is provided by the embodiment of the present invention
Figure, comprises the following steps：
Step 201：Initial data is preserved into the first HashMap.
First HashMap is stated, for preserving initial data.What is deposited in HashMap is key-value to Key-Value,
Initial data is stored in Value, Key values are the unique mark of original data record.
Step 202：Data after preservation processing are into the 2nd HashMap.
Second HashMap is stated, for preserving data after processing.What is deposited in HashMap is key-value to Key-
Value, the data after processing are stored in Value, Key values are the unique mark of data record after processing.
Step 203：Travel through the Key values in the first HashMap.
Because there are some data records, it is necessary to by the Key values in searching loop HashMap, will pass through Key values to mark
Know the state of data record.
Step 204：Search and whether there is Key values in the 2nd HashMap, if it does, into step 206, if do not deposited
Into step 205.
The Key values that searching loop arrives in direct finding step 203 in the 2nd HashMap, judge that it whether there is, step
A Key value is often recycled in 203 it is necessary to be searched once in the 2nd HashMap, the Key values time in the first HashMap
Go through and finish.
Step 205：Judge that data record is deletion record corresponding to Key values.
Step 206：Travel through the Key values in the 2nd HashMap.
Step 207：Search and whether there is Key values in the first HashMap, if it does, into step 209, if do not deposited
Into step 208.
The Key values that searching loop arrives in direct finding step 206 in the first HashMap, judge that it whether there is, step
A Key value is often recycled in 206 it is necessary to be searched once in the 2nd HashMap, the Key values time in the first HashMap
Go through and finish.
Step 208：Judge data record corresponding to Key values for newly-increased record.
Step 209：Judge whether Key values corresponding Value values in the first HashMap and the 2nd HashMap are identical, such as
Fruit is identical, into step 211, if it is not the same, into step 210.
The corresponding Value values of the Key values in first HashMap and the 2nd HashMap are taken out, then compare the two
Whether Value values are identical.
Step 210：Judge that data record corresponding to Key values records for modification.
Step 211：Judge that data record corresponding to Key values is unmodified.
In this embodiment, step 209 performs behind step 207, in addition can also make its
With being performed before step 206 after step 204, accordingly, step 210 and step 211 will also change therewith；And step 203
It can be exchanged with the execution sequence of step 206, accordingly, step 204, step 205, the execution sequence of step 207 and step 208
Also will be exchanged therewith.The exchange of these step execution sequences does not influence the realization of the present invention.
Above-mentioned embodiment can not only quickly judge and find the data of change, can also judge and find change
The concrete condition of data more, even if the data of change are newly-increased data or deleted data, be so advantageous under
It is analyzed in more detail when one step processing data.
The method of data comparison in above-mentioned embodiment can be further improved, improved method is such as
Under：
, can also be by Value values corresponding to the Key values after judging that data record is deletion record corresponding to Key values
It is added in the array for preserving deletion record, and the array of the preservation deletion record is updated into database；
, can also be by Value values corresponding to the Key values after judging data record corresponding to Key values for newly-increased record
It is added in the array for preserving newly-increased record, and the array of the newly-increased record of the preservation is updated into database；
, can also be by Value values corresponding to the Key values after judging that data record corresponding to Key values records for modification
It is added in the array for preserving modification record, and the preservation is changed to the array recorded and updated into database.
The data of these changes are saved in array and updated in database, it is lasting that actually data are carried out
Change is handled, and these transient datas is changed into the perdurable data that can be preserved.Certainly persistence is not done to handle not yet
Influence whether the realization of the present invention.
The method for the data comparison that the embodiment of the present invention is provided can apply in Web system, preceding in Web system
The platform page would generally use the data of form displaying user configuration, and user can be handled it, and the data after processing can protect
Backstage is stored to, the method at this moment contrasted to data is no longer repeated as described in above-mentioned embodiment.Utilize
The method of the data comparison provided of the present invention not only shortens time of data processing, can also effectively be lifted foreground with
The performance of data exchange between backstage.
The device of data comparison provided in an embodiment of the present invention is introduced below, the dress of data comparison described below
Putting can be mutually to should refer to the method for above-described data comparison.
Referring to Fig. 3, the structured flowchart of the device for the data comparison that Fig. 3 is provided by the embodiment of the present invention, data comparison
Device include：Memory module 301 and judge module 302.Wherein judge module 302 includes Traversal Unit 303, searching unit
304, judging unit 305 is deleted, increases judging unit 306 newly, changes judging unit 307.
Wherein, memory module 301 is used to preserve initial data into the first HashMap, the data after preservation processing to the
In two HashMap；
The Traversal Unit 303, for traveling through the Key values in the first HashMap and the 2nd HashMap；
Searching unit 304 whether there is the Key values for searching other side；
If deleting judging unit 305 to be used to the Key values that the first HashMap is traversed be not present in the 2nd HashMap, sentence
Data record corresponding to the Key values of breaking is deletion record；
If newly-increased judging unit 306 is used to the Key values that the 2nd HashMap is traversed be not present in the first HashMap, sentence
Data record corresponding to the Key values of breaking is newly-increased record；
If modification judging unit 307 has Key values for other side, judge in the first HashMap corresponding to the Key values
Whether Value values corresponding to the Key values are identical in Value values and the 2nd HashMap, if identical, judge that the Key values are corresponding
Data do not change；If it is different, then judge that data record corresponding to the Key values records for modification.
In order that transient data is changed into the perdurable data that can be preserved, the data comparison that the embodiment of the present invention is provided
Device can further include：Deletion record preserving module, increase newly record preserving module, modification record preserving module and persistently
Change module；
Wherein, deletion record preserving module is used for after judging that data record is deletion record corresponding to the Key values,
Value values corresponding to the Key values are added in the array for preserving deletion record；
Newly-increased record preserving module is used for after judging data record corresponding to the Key values for newly-increased record, by institute
Value values corresponding to Key values are stated to be added in the array for preserving newly-increased record；
Modification record preserving module is used for after judging that data record corresponding to the Key values records for modification, by institute
Value values corresponding to Key values are stated to be added in the array for preserving modification record；
Persistence module is used to increasing the array of record newly and preserving modification the array of the preservation deletion record, preservation to remember
The array of record is updated into database.
Each embodiment is described by the way of progressive in this specification, what each embodiment stressed be with it is other
The difference of embodiment, between each embodiment same or similar part mutually referring to.For dress disclosed in embodiment
For putting, because it is corresponded to the method disclosed in Example, so description is fairly simple, related part is referring to method part
Explanation.
The method and device of data comparison provided by the present invention are described in detail above.It is used herein
Specific case is set forth to the principle and embodiment of the present invention, and the explanation of above example is only intended to help and understands this
The method and its core concept of invention.It should be pointed out that for those skilled in the art, this hair is not being departed from
On the premise of bright principle, some improvement and modification can also be carried out to the present invention, these are improved and modification also falls into power of the present invention
In the protection domain that profit requires.
Claims (8)
- A kind of 1. method of data comparison, it is characterised in that including：Initial data is preserved into the first HashMap, the data after preservation processing are into the 2nd HashMap；The Key values in the first HashMap and the 2nd HashMap are traveled through respectively, and search other side with the presence or absence of described Key values, if it does not exist, then judging that data record corresponding to the Key values generates change；If it does, judge described Value values corresponding to Key values are described in Value values corresponding to Key values described in one HashMap and the 2nd HashMap It is no identical, if identical, judge that data corresponding to the Key values are not changed；If it is different, then judge the Key values Corresponding data record records for modification.
- 2. the method as described in claim 1, it is characterised in that described to judge that data record corresponding to the Key values generates Change, including：If the Key values that the first HashMap is traversed are not present in the 2nd HashMap, judge that the Key values are corresponding Data record be deletion record；If the Key values that the 2nd HashMap is traversed are not present in the first HashMap, judge that the Key values are corresponding Data record be newly-increased record.
- 3. method as claimed in claim 2, it is characterised in that judging data record corresponding to the Key values for deletion note After record, in addition to：Value values corresponding to the Key values are added in the array for preserving deletion record, and by described in The array for preserving deletion record is updated into database；After judging data record corresponding to the Key values for newly-increased record, in addition to：By Value corresponding to the Key values Value is added in the array for preserving newly-increased record, and the array for preserving newly-increased record is updated into database.
- 4. the method as described in claim 1, it is characterised in that judging data record corresponding to the Key values for modification note After record, in addition to：Value values corresponding to the Key values are added in the array for preserving modification record, and by described in The array for preserving modification record is updated into database.
- A kind of 5. device of data comparison, it is characterised in that including：Memory module and judge module；Wherein, the memory module, for preserving initial data into the first HashMap, the data after preservation processing are to second In HashMap；The judge module, for traveling through the Key values in the first HashMap and the 2nd HashMap respectively, and search Other side whether there is the Key values, if it does not exist, then judging that data record corresponding to the Key values generates change；If In the presence of judging Key values described in Value values corresponding to Key values described in the first HashMap and the 2nd HashMap Whether corresponding Value values are identical, if identical, judge that data corresponding to the Key values are not changed；If it is different, Then judge that data record corresponding to the Key values records for modification.
- 6. device as claimed in claim 5, it is characterised in that the judge module includes：Traversal Unit, searching unit, delete Except judging unit, judging unit is increased newly, change judging unit；Wherein, the Traversal Unit, for traveling through the Key values in the first HashMap and the 2nd HashMap；The searching unit, it whether there is the Key values for searching other side；The deletion judging unit, if the Key traversed for the first HashMap to be not present in the 2nd HashMap Value, then judge that data record is deletion record corresponding to the Key values；The newly-increased judging unit, if the Key traversed for the 2nd HashMap to be not present in the first HashMap Value, then judge data record corresponding to the Key values for newly-increased record；The modification judging unit, if the Key values be present for other side, judge Key values pair described in the first HashMap Whether Value values corresponding to Key values are identical described in the Value values answered and the 2nd HashMap, if identical, judge Data corresponding to the Key values are not changed；If it is different, then judge that data record corresponding to the Key values is remembered for modification Record.
- 7. device as claimed in claim 6, it is characterised in that described device also includes：Deletion record preserving module, increase note newly Record preserving module and modification record preserving module；Wherein, the deletion record preserving module, for judge data record corresponding to the Key values for deletion record it Afterwards, Value values corresponding to the Key values are added in the array for preserving deletion record；The newly-increased record preserving module, for after judging data record corresponding to the Key values for newly-increased record, by institute Value values corresponding to Key values are stated to be added in the array for preserving newly-increased record；It is described modification record preserving module, for judge data record corresponding to the Key values for change record after, by institute Value values corresponding to Key values are stated to be added in the array for preserving modification record.
- 8. device as claimed in claim 7, it is characterised in that described device also includes：Persistence module, for by the guarantor The array for deposit the array of deletion record, preserving the array of newly-increased record and preserve modification record is updated into database.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710585628.6A CN107357910A (en) | 2017-07-18 | 2017-07-18 | A kind of method and device of data comparison |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710585628.6A CN107357910A (en) | 2017-07-18 | 2017-07-18 | A kind of method and device of data comparison |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107357910A true CN107357910A (en) | 2017-11-17 |
Family
ID=60284271
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710585628.6A Pending CN107357910A (en) | 2017-07-18 | 2017-07-18 | A kind of method and device of data comparison |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107357910A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1601515A (en) * | 2003-09-28 | 2005-03-30 | 华为技术有限公司 | Analytical comparison method for divergence between data |
| CN102930049A (en) * | 2012-11-16 | 2013-02-13 | 沈阳美行科技有限公司 | Embedded compiling method of user interest point data capable of supporting increment update |
| CN103778133A (en) * | 2012-10-18 | 2014-05-07 | 阿里巴巴集团控股有限公司 | Database object changing method and device |
| CN105446829A (en) * | 2015-09-29 | 2016-03-30 | 网易（杭州）网络有限公司 | Client program repair method, device and system and server |
| CN105631019A (en) * | 2015-12-29 | 2016-06-01 | 畅捷通信息技术股份有限公司 | Metadata extension method and device |
| EP3113038A1 (en) * | 2015-06-29 | 2017-01-04 | Broadridge Financial Solutions Limited | A data handling method |
-
2017
- 2017-07-18 CN CN201710585628.6A patent/CN107357910A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1601515A (en) * | 2003-09-28 | 2005-03-30 | 华为技术有限公司 | Analytical comparison method for divergence between data |
| CN103778133A (en) * | 2012-10-18 | 2014-05-07 | 阿里巴巴集团控股有限公司 | Database object changing method and device |
| CN102930049A (en) * | 2012-11-16 | 2013-02-13 | 沈阳美行科技有限公司 | Embedded compiling method of user interest point data capable of supporting increment update |
| EP3113038A1 (en) * | 2015-06-29 | 2017-01-04 | Broadridge Financial Solutions Limited | A data handling method |
| CN105446829A (en) * | 2015-09-29 | 2016-03-30 | 网易（杭州）网络有限公司 | Client program repair method, device and system and server |
| CN105631019A (en) * | 2015-12-29 | 2016-06-01 | 畅捷通信息技术股份有限公司 | Metadata extension method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10769147B2 (en) | Batch data query method and apparatus | |
| CN103092867B (en) | Method and system for managing data, and data analyzing device | |
| US11615090B2 (en) | Method, apparatus and system for determining accessible paths between two nodes | |
| CN104008111B (en) | A kind of memory management method and device of data | |
| US20110106843A1 (en) | Method and system for determining node to be materialized | |
| US20180246986A1 (en) | In-memory graph analytics system that allows memory and performance trade-off between graph mutation and graph traversal | |
| CN105740335A (en) | Titan-based enterprise information analysis platform and construction method thereof | |
| CN106777351A (en) | Computing system and its method are stored based on ART tree distributed systems figure | |
| CN103488475B (en) | Multidimensional data analysis system and multidimensional data analysis method | |
| CN107577436A (en) | A kind of date storage method and device | |
| CN106033393A (en) | Method and system for testing application program, and mobile terminal | |
| US20180293330A1 (en) | Malware label inference and visualization in a large multigraph | |
| US10789294B2 (en) | Method and system for performing searches of graphs as represented within an information technology system | |
| CN105426375A (en) | Relationship network calculation method and apparatus | |
| CN107463555B (en) | Method, system and device for deleting intermediate layer data | |
| CN106202102B (en) | Batch data querying method and device | |
| CN107153692B (en) | Method and equipment for matching character strings | |
| US8548980B2 (en) | Accelerating queries based on exact knowledge of specific rows satisfying local conditions | |
| CN107357910A (en) | A kind of method and device of data comparison | |
| CN107239568A (en) | Distributed index implementation method and device | |
| CN113064674A (en) | Method and device for expanding state machine logic, storage medium and electronic device | |
| CN102981964B (en) | The management method of data space and system | |
| CN102456073A (en) | Partial extremum inquiry method | |
| CN110874182B (en) | Processing method, device and equipment for strip index | |
| CN110442604A (en) | Data flow querying method, abstracting method, processing method and relevant apparatus |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20171117 |