CN106095809B - Data matching method and system - Google Patents
Data matching method and system Download PDFInfo
- Publication number
- CN106095809B CN106095809B CN201610375870.6A CN201610375870A CN106095809B CN 106095809 B CN106095809 B CN 106095809B CN 201610375870 A CN201610375870 A CN 201610375870A CN 106095809 B CN106095809 B CN 106095809B
- Authority
- CN
- China
- Prior art keywords
- matching
- data
- query
- query attribute
- node
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 230000006870 function Effects 0.000 claims description 64
- 238000001914 filtration Methods 0.000 abstract description 7
- 238000005516 engineering process Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 241001122767 Theaceae Species 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Images
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/242—Query formulation
-
- 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/2455—Query execution
- G06F16/24552—Database cache management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The application relates to a data matching method and a system, wherein the method comprises the following steps: obtaining matching conditions, wherein the matching conditions comprise one or more of the following matching information: one or more query attributes, query attribute values, matching operations of query attribute values, or logical operations between a plurality of the query attributes; generating a matching tree by using the matching condition, wherein the matching tree records the query attribute value, the position of the query attribute in the original data, a matching function for matching the query attribute and/or the logic operation; and finding out data matched with the matching conditions in the original data by utilizing the matching tree. According to the embodiment of the application, the matching tree for matching data can be automatically generated according to the matching conditions, so that the problem of diversity of query requirements can be solved, and flexible data matching or filtering can be realized.
Description
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a data matching method and system.
Background
When data query is performed, data loaded in the memory needs to be filtered according to the matching condition to obtain data matched with the matching condition. In the conventional technology, the filtering logic is usually written according to the matching conditions, and due to the requirement difference of different matching conditions, the code needs to be modified to obtain the filtering logic of the matching conditions each time the data is queried.
Disclosure of Invention
In order to overcome the problems in the related art, the application provides a data matching method and a data matching system.
According to a first aspect of embodiments of the present application, there is provided a data matching method, including:
obtaining matching conditions, wherein the matching conditions comprise one or more of the following matching information: one or more query attributes, query attribute values, matching operations of query attribute values, or logical operations between a plurality of the query attributes;
generating a matching tree by using the matching condition, wherein the matching tree records the query attribute value, the position of the query attribute in the original data, a matching function for matching the query attribute and/or the logic operation;
and finding out data matched with the matching conditions in the original data by utilizing the matching tree.
According to a second aspect of embodiments of the present application, there is provided a data matching system, including:
a matching condition obtaining module, configured to obtain a matching condition, where the matching condition includes one or more of the following matching information: one or more query attributes, query attribute values, matching operations of query attribute values, or logical operations between a plurality of the query attributes;
a matching tree generating module, configured to generate a matching tree using the matching condition, where the matching tree records the query attribute value, the location of the query attribute in the original data, and a matching function or logical operation for matching the query attribute;
and the data matching module is used for searching the data matched with the matching conditions in the original data by utilizing the matching tree.
The technical scheme provided by the embodiment of the application can have the following beneficial effects:
the scheme provided by the embodiment of the application can be applied to data filtering, querying or matching of data in the memory. For the original data loaded in the memory, matching information can be obtained according to the matching conditions, and a matching tree is automatically generated, and the matching tree carries the matching information, so that the data matched with the matching conditions can be searched in the original data by utilizing the matching tree. According to the method and the device, the matching tree for matching the data can be automatically generated according to the matching conditions, so that the problem of diversity of query requirements can be solved, and flexible data matching or filtering can be realized.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application.
Fig. 1 is a flow chart illustrating a data matching method according to an exemplary embodiment of the present application.
FIG. 2 is a diagram illustrating a matching tree structure according to an exemplary embodiment of the present application.
Fig. 3 is a block diagram of a data matching system shown in the present application according to an example embodiment.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It is to be understood that although the terms first, second, third, etc. may be used herein to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the present application. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
As shown in fig. 1, fig. 1 is a flowchart of a data matching method shown in the present application according to an exemplary embodiment, which includes the following steps 101 to 103:
in step 101, a matching condition is obtained. The matching condition comprises one or more of the following matching information: one or more query attributes, query attribute values, matching operations of query attribute values, or logical operations between a plurality of the query attributes.
In step 102, a matching tree is generated using the matching conditions. The matching tree records the query attribute value, the position of the query attribute in the original data, a matching function for matching the query attribute, or the logical operation.
In step 103, the matching tree is used to find out the data matching the matching condition in the original data.
The scheme provided by the embodiment of the application can be applied to data filtering, querying or matching of data in the memory. For the original data loaded in the memory, matching information can be obtained according to the matching conditions, and a matching tree is automatically generated, and the matching tree carries the matching information, so that the data matched with the matching conditions can be searched in the original data by utilizing the matching tree. According to the method and the device, the matching tree for matching the data can be automatically generated according to the matching conditions, so that the problem of diversity of query requirements can be solved, and flexible data matching or filtering can be realized.
In the embodiment of the application, the original data can be preloaded in the memory. Taking a data file recording student information as an example for explanation, it is assumed that tens of thousands of pieces of student data are recorded in the data file, and the student data includes information such as a school number, a name, a gender, an institution, a professional name, a telephone number, a year of birth, a month of birth, and the like.
The "student" data file may be:
| number learning | Name (I) | Hospital system | Professional | Sex | Year and month of birth |
| 12311 | Zhang three | Computer school | Computer network technology | For male | 199105 |
| 12312 | Li four | Institute of bioscience | Biological science | Woman | 199006 |
| 12313 | Wangwu tea | Institute of literature and study | Chinese language and literature | Woman | 199108 |
| 12314 | Zhao liu xi | Computer school | Software development | For male | 199012 |
The first line is an attribute name, the second line to the fifth line represent four pieces of student data, and each piece of student data records an attribute value corresponding to each attribute. The data files are shown in a table form, and when the data files are loaded in the memory (in the embodiment of the application, the data files loaded in the memory are called original data), the data files are stored in the computer disk in a form of "12311 three-computer institute computer network technology men 19910512312 li four biological science institute biological science mai 19900612313 wang five institute chinese language and literature mai 19910812314 zhao six institute of computer science software development men 199012", the example is still described with specific attribute values for clarity, but in practical application, the data are coded and serialized and stored in the disk in corresponding computer codes.
In specific implementation, the data matching the matching condition can be searched from the original data according to the obtained multiple matching conditions. As an example, the matching condition may be specifically "123 scholar", "three name", "year of birth > 1990 and academy" computer school "or" 13605553159 ", or the like.
In the matching condition "scholar 123" in the above example, "scholar" is a query attribute, "123" is a query attribute value, "and" ═ is a matching operation, and only one query attribute is included in the matching condition. In the matching condition "year and month of birth > 1990 and academy ═ computer school", the "year and month of birth" and "academy" are query attributes, the "1990" and "computer school" are query attribute values, and the ">" and "═ are matching operations, the matching condition includes two query attributes, and the" is a logical operation between the two. The matching condition "13605553159" includes only one query attribute value. In practical application, the required matching information can be obtained according to the matching condition actually input by the user.
As can be seen from the above analysis, in the embodiment of the present application, the matching information related to the matching condition includes:
inquiring the attribute; for example, the attribute "school number" of the query required in the matching condition "school number 123" is used.
Inquiring the attribute value; that is, the attribute value corresponding to the query attribute, for example, matches "123" in the "academic number" 123 "condition. When the matching condition does not include the query attribute, but includes only data such as a number or a character string, the data such as the number or the character string is determined as the query attribute value, for example, the matching condition "123", the matching condition "zhang san", and the like.
Matching operations, i.e., operations between the query attribute and the query attribute value, include equal to, not equal to, greater than or equal to, less than or equal to, or fuzzy matching, etc. For example, the matching condition "123" ═ is equal to the operation, "1990" is greater than the operation, "abc" is included in the name of the matching condition, and the fuzzy matching operation on "abc" is involved in the name of the matching condition.
Data type, namely data type of query attribute value, including number, character string or floating point type; for example, in the matching condition "scholar 123", the data type of the attribute "scholar" is a number, and in the matching condition "name" zhangsan ", the data type of the attribute" zhangsan "is a character string.
A logical operation, that is, when the matching condition includes a plurality of query attributes, a logical operation between the query attributes includes and operation (and) or nor operation (not); for example, the and operation represented by the matching condition "year and month of birth > 1990 and academy ═ computer institute" and "is matched.
After the matching information is obtained in step 101, a matching tree can be created according to the matching information. The matching tree may adopt a tree structure, which records matching information related in the matching condition, and implements fast matching according to the matching information recorded in the matching tree when data is matched. When creating the matching tree, the structure of the matching tree may be determined according to the specific matching information in the matching condition.
As can be seen from the foregoing description of storing the original data, the original data is stored in rows during storage, and each piece of data stores attribute values of different attributes in sequence according to the positions of the attributes in the data. Thus, when a query attribute is included in the matching condition, the location of the query attribute in the original data can be determined and recorded in the matching tree. As an embodiment, the location of the query attribute in the original data may refer to an address offset of the query attribute relative to the original data, and the amount of data recorded in the matching tree may be reduced by recording the address offset.
The matching condition usually includes a query attribute value, and since the data types of different query attribute values are different and the query attribute values have corresponding matching operations, a matching function for matching the query attribute values can be determined. For example, the matching condition "scholar 123", the data type is a number, the matching operation is equal, and thus the corresponding matching function may be "number equal to matching function"; if the matching condition is "name equals three", and the data type of the name attribute is a character string, the matching operation is equal, so the corresponding matching function may be "character string equals to matching function".
As an exemplary embodiment, the declaration of the matching function may be:
bool left value type _ matching method _ right value type (left value pointer, right value pointer).
In practical applications, various matching functions can be configured in advance, for example, the equality comparison of the integer to the integer, and then a corresponding function entity can be programmed in advance to realize the judgment of whether the two integers are equal or not.
The following shows the Int _ eq _ Int function for making two integer-to-integer equality comparisons:
the String _ gt _ String function is shown below for performing String-to-String greater comparisons:
in practical application, specific codes and matching logic in the matching function can refer to related technologies and be flexibly configured as required, and a pointer to the matching function can be configured to select a corresponding function to call according to the content of the expression when required.
In an optional implementation manner, the matching function may be obtained from a pre-configured matching function library according to the data type of the query attribute and the matching operation, and the matching function library stores a plurality of matching functions predetermined according to different data types and matching operations.
In this embodiment, a matching function library for storing a plurality of matching functions may be created in advance, and then the corresponding matching function may be quickly acquired from the matching function library according to the matching condition when creating the matching tree. The matching function is predetermined according to the different data types and the different matching operations. When determining the corresponding matching function, the matching tree may record the address of the matching function in the matching function library, and the number of the addresses is usually small, so that the data space occupied by the matching tree may be reduced.
From the above analysis, the matching tree may record one or more of the following matching information: a query attribute value, a location of the query attribute in the raw data (when the matching condition includes the query attribute), a query attribute value, a matching function for matching the query attribute, or a logical operation (when the matching condition includes two or more query attributes).
In an alternative implementation, when the matching condition includes only one query attribute, the matching tree includes one matching node; when the matching condition includes a plurality of query attributes, the matching tree includes matching nodes and logical nodes; wherein the matching node is a leaf node of the logical node, and the logical node records the following logical operations: and operation, or operation and not operation; the matching node records the position, the pointer address of the matching function and the query attribute value.
In this embodiment of the present application, the matching tree may include two types of nodes: a logical node and a matching node. The logical nodes store logical operations, namely and (and), or (or) and not (not). And the matching node records the matching information corresponding to the query attribute. The matching nodes can be used as child nodes of the logic node, when the logic operation is AND or OR, the logic node has two matching nodes as child nodes, and when the logic operation is not, the logic node has one matching node as child node. It will be appreciated that when only the query attribute value or only one query attribute is included in the match condition, then the match tree does not include logical nodes, only matching nodes.
As shown in fig. 2, the structure of two matching trees is shown. In the matching tree 1, since the matching condition has only one query attribute, it may include only one matching node, in which a matching function (in this embodiment, an address pointer of the function), a school number attribute (in this embodiment, an offset of the attribute with respect to the original data), and an attribute value 123 are recorded according to the matching condition.
In the matching tree 2, since the matching condition relates to two query attributes, and the two query attributes relate to an and operation therebetween, the matching tree relates to one logical node and two matching nodes under the logical node, the logical node records the and operation, and the two matching nodes record matching information related to "academic number 123" and "name a", respectively.
In step 103, the matching tree is used to find out the data matching the matching condition in the original data. After the matching tree is obtained, according to each piece of data in the original data loaded in the memory, the matching tree is used for performing matching operation on the original data to obtain data matched with the matching condition.
For example, when the matching node comprises a matching function and a query attribute value, the matching function is used for carrying out corresponding matching operation on the original data and the query attribute value; when the matching node comprises a matching function, the position of the query attribute in the original data and the query attribute value, performing corresponding matching operation on the data of the original data at the corresponding position and the query attribute value by using the matching function; when the matching tree comprises the logic nodes, after the data matched with each matching node is found out, the data matched with each matching node is subjected to logic operation according to the logic nodes, and the data matched with the matching conditions are obtained.
Corresponding to the embodiments of the foregoing method, the present application also provides embodiments of a data matching system. As shown in fig. 3, fig. 3 is a block diagram of a data matching system shown in the present application according to an exemplary embodiment, the system comprising:
a matching condition obtaining module 31, configured to obtain a matching condition, where the matching condition includes one or more of the following matching information: one or more query attributes, query attribute values, matching operations of query attribute values, or logical operations between a plurality of the query attributes.
A matching tree generating module 32, configured to generate a matching tree using the matching condition, where the matching tree records the query attribute value, the location of the query attribute in the original data, a matching function for matching the query attribute, or the logical operation.
And a data matching module 33, configured to find data matching the matching condition from the original data by using the matching tree.
In an alternative implementation, when the matching condition includes only one query attribute, the matching tree includes one matching node;
when the matching condition includes a plurality of query attributes, the matching tree includes matching nodes and logical nodes;
wherein the matching node is a leaf node of the logical node, and the logical node records the following logical operations: and operation, or operation and not operation; the matching node records the position, the pointer address of the matching function and the query attribute value.
In an alternative implementation, the location of the query attribute in the raw data includes an offset of the query attribute in the raw data.
In an optional implementation manner, the matching function is obtained from a pre-configured matching function library according to the data type and the matching operation of the query attribute, and a plurality of matching functions predetermined according to different data types and matching operations are stored in the matching function library.
In an optional implementation manner, the data matching module is further configured to:
according to each piece of data in the original data loaded in the memory, matching operation is carried out on the original data by using the matching tree, and data matched with matching conditions are obtained;
when the matching node comprises a matching function and a query attribute value, performing corresponding matching operation on the original data and the query attribute value by using the matching function; when the matching node comprises a matching function, the position of the query attribute in the original data and the query attribute value, performing corresponding matching operation on the data of the original data at the corresponding position and the query attribute value by using the matching function; when the matching tree comprises the logic nodes, after the data matched with each matching node is found out, the data matched with each matching node is subjected to logic operation according to the logic nodes, and the data matched with the matching conditions are obtained.
The implementation process of the functions and actions of each module in the system is specifically described in the implementation process of the corresponding step in the method, and is not described herein again.
For the system embodiment, since it basically corresponds to the method embodiment, reference may be made to the partial description of the method embodiment for relevant points. The above-described system embodiments are merely illustrative, wherein the modules described as separate components may or may not be physically separate, and the components shown as modules may or may not be physical modules, may be located in one place, or may be distributed on a plurality of network modules. Some or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of the application. One of ordinary skill in the art can understand and implement it without inventive effort.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It will be understood that the present application is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the scope of protection of the present application.
Claims (4)
1. A method of data matching, the method comprising:
acquiring matching conditions, wherein the matching conditions comprise the following matching information: matching operation of the query attribute, the query attribute value and the query attribute value; wherein, there are one or more said inquiry attribute, in the case of there are multiple inquiry attributes, the said matching information also includes the logical operation among multiple said inquiry attributes;
generating a matching tree by using the matching condition, wherein the matching tree records the query attribute value, the position of the query attribute in original data, a matching function for matching the query attribute or the logic operation; the method comprises the steps that original data are stored in rows during storage, each piece of data can store attribute values of different attributes according to the positions of the attributes in the data in sequence, and the positions of query attributes in the original data comprise offsets of the query attributes in the original data; when the matching condition only comprises one query attribute, the matching tree comprises one matching node; when the matching condition includes a plurality of query attributes, the matching tree includes matching nodes and logical nodes; wherein the matching node is a leaf node of the logical node, and the logical node records the following logical operations: and operation, or operation and not operation; the matching node records the position, the pointer address of the matching function and the query attribute value;
according to each piece of data in the original data loaded in the memory, matching operation is carried out on the original data by using the matching tree, and data matched with matching conditions are obtained;
when the matching node comprises a matching function, a position of the query attribute in the original data and a query attribute value, performing corresponding matching operation on the data of the original data at the corresponding position and the query attribute value by using the matching function; when the matching tree further comprises logic nodes, after data matched with each matching node is found out, logic operation is carried out on the data matched with each matching node according to the logic nodes, and data matched with matching conditions are obtained.
2. The method according to claim 1, wherein the matching function is obtained from a pre-configured matching function library according to the data type and the matching operation of the query attribute, and the matching function library stores a plurality of matching functions predetermined according to different data types and matching operations.
3. A data matching system, the system comprising:
a matching condition obtaining module, configured to obtain a matching condition, where the matching condition includes the following matching information: matching operation of the query attribute, the query attribute value and the query attribute value; wherein, there are one or more said inquiry attribute, in the case of there are multiple inquiry attributes, the said matching information also includes the logical operation among multiple said inquiry attributes;
a matching tree generating module, configured to generate a matching tree using the matching condition, where the matching tree records the query attribute value, the location of the query attribute in the original data, and a matching function or logical operation for matching the query attribute; the method comprises the steps that original data are stored in rows during storage, each piece of data can store attribute values of different attributes according to the positions of the attributes in the data in sequence, and the positions of query attributes in the original data comprise offsets of the query attributes in the original data; when the matching condition only comprises one query attribute, the matching tree comprises one matching node; when the matching condition includes a plurality of query attributes, the matching tree includes matching nodes and logical nodes; wherein the matching node is a leaf node of the logical node, and the logical node records the following logical operations: and operation, or operation and not operation; the matching node records the position, the pointer address of the matching function and the query attribute value;
the data matching module is used for performing matching operation on the original data by using the matching function according to each piece of data in the original data loaded in the memory to obtain data matched with the matching condition;
when the matching node comprises a matching function, a position of the query attribute in the original data and a query attribute value, performing corresponding matching operation on the data of the original data at the corresponding position and the query attribute value by using the matching function; when the matching tree further comprises logic nodes, after data matched with each matching node is found out, logic operation is carried out on the data matched with each matching node according to the logic nodes, and data matched with matching conditions are obtained.
4. The system according to claim 3, wherein the matching function is obtained from a pre-configured matching function library according to the data type and matching operation of the query attribute, and the matching function library stores a plurality of matching functions predetermined according to different data types and matching operations.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610375870.6A CN106095809B (en) | 2016-05-30 | 2016-05-30 | Data matching method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610375870.6A CN106095809B (en) | 2016-05-30 | 2016-05-30 | Data matching method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106095809A CN106095809A (en) | 2016-11-09 |
| CN106095809B true CN106095809B (en) | 2020-02-07 |
Family
ID=57230432
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610375870.6A Active CN106095809B (en) | 2016-05-30 | 2016-05-30 | Data matching method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106095809B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108268620A (en) * | 2018-01-08 | 2018-07-10 | 南京邮电大学 | A kind of Document Classification Method based on hadoop data minings |
| CN109710811B (en) * | 2018-11-28 | 2021-03-02 | 汉海信息技术(上海)有限公司 | User portrait detection method, device and application system |
| CN110069547B (en) * | 2019-03-19 | 2021-10-12 | 天津字节跳动科技有限公司 | Online database table data statistics method, device, medium and electronic equipment |
| CN110096555B (en) * | 2019-04-17 | 2021-09-03 | 奇安信科技集团股份有限公司 | Table matching processing method and device for distributed system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102571469A (en) * | 2010-12-23 | 2012-07-11 | 北京启明星辰信息技术股份有限公司 | Attack detecting method and device |
| CN102567803A (en) * | 2011-12-27 | 2012-07-11 | 中国科学院自动化研究所 | Complex event scheduling system and method based on priority-assigned event graph |
| CN102792297A (en) * | 2010-03-01 | 2012-11-21 | 日本电气株式会社 | Pattern matching device, pattern matching method, and pattern matching system |
| CN103793522A (en) * | 2008-10-20 | 2014-05-14 | 王强 | Method and system for rapidly scanning feature codes |
| CN103841112A (en) * | 2014-03-18 | 2014-06-04 | 杭州华三通信技术有限公司 | Classification rule processing method, device and matching device based on network packet classification |
-
2016
- 2016-05-30 CN CN201610375870.6A patent/CN106095809B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103793522A (en) * | 2008-10-20 | 2014-05-14 | 王强 | Method and system for rapidly scanning feature codes |
| CN102792297A (en) * | 2010-03-01 | 2012-11-21 | 日本电气株式会社 | Pattern matching device, pattern matching method, and pattern matching system |
| CN102571469A (en) * | 2010-12-23 | 2012-07-11 | 北京启明星辰信息技术股份有限公司 | Attack detecting method and device |
| CN102567803A (en) * | 2011-12-27 | 2012-07-11 | 中国科学院自动化研究所 | Complex event scheduling system and method based on priority-assigned event graph |
| CN103841112A (en) * | 2014-03-18 | 2014-06-04 | 杭州华三通信技术有限公司 | Classification rule processing method, device and matching device based on network packet classification |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106095809A (en) | 2016-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106095809B (en) | Data matching method and system | |
| CN112199366A (en) | Data table processing method, device and equipment | |
| CN111125229B (en) | Data blood edge generation method and device and electronic equipment | |
| CN107977396B (en) | Method and device for updating data table of KeyValue database | |
| CN111125214A (en) | Lightweight incremental data synchronization method and device and computer readable medium | |
| CN108427736B (en) | Method for querying data | |
| CN109885614B (en) | Data synchronization method and device | |
| CN113835692B (en) | Dictionary data processing method and device, electronic equipment and computer storage medium | |
| US8090722B2 (en) | Searching related documents | |
| CN110109894B (en) | Method, device, storage medium and equipment for realizing non-relational database | |
| CN110019111B (en) | Data processing method, data processing device, storage medium and processor | |
| US8037088B2 (en) | Change management | |
| CN105701251A (en) | Data export and import method based on object definition | |
| CN110781183A (en) | Method and device for processing incremental data in Hive database and computer equipment | |
| CN108959381B (en) | Data management method and device and electronic equipment | |
| EP3123360B1 (en) | Partition filtering using smart index in memory | |
| CN107103035A (en) | This earth's surface data-updating method and device | |
| CN107609011B (en) | Database record maintenance method and device | |
| CN111198910A (en) | Data fusion method and device | |
| US20200278980A1 (en) | Database processing apparatus, group map file generating method, and recording medium | |
| CN113190218A (en) | Target operation function generation method and device | |
| US9026562B2 (en) | Methods and systems for agnostic data storage | |
| CN115858471A (en) | Service data change recording method, device, computer equipment and medium | |
| CN109376154A (en) | Reading data, wiring method and reading data, writing system | |
| CN110598072B (en) | Feature data aggregation 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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 510663 Room 1001, Room 1101, No. 12, Kehui Third Street, Luogang District Development Zone, Guangzhou City, Guangdong Province Applicant after: Kaitong Technology Co.,Ltd. Address before: 510663 Room 1001, Room 1101, No. 12, Kehui Third Street, Luogang District Development Zone, Guangzhou City, Guangdong Province Applicant before: GUANGDONG KAITONG TECHNOLOGY CO.,LTD. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Data matching method and system Effective date of registration: 20220624 Granted publication date: 20200207 Pledgee: Science City (Guangzhou) green Financing Guarantee Co.,Ltd. Pledgor: Kaitong Technology Co.,Ltd. Registration number: Y2022980008923 |
|
| PC01 | Cancellation of the registration of the contract for pledge of patent right | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20230606 Granted publication date: 20200207 Pledgee: Science City (Guangzhou) green Financing Guarantee Co.,Ltd. Pledgor: Kaitong Technology Co.,Ltd. Registration number: Y2022980008923 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Data matching methods and systems Effective date of registration: 20230821 Granted publication date: 20200207 Pledgee: Science City (Guangzhou) green Financing Guarantee Co.,Ltd. Pledgor: Kaitong Technology Co.,Ltd. Registration number: Y2023980052977 |