CN110096555A - A kind of the table matched processing method and device of distributed system - Google Patents
A kind of the table matched processing method and device of distributed system Download PDFInfo
- Publication number
- CN110096555A CN110096555A CN201910308704.8A CN201910308704A CN110096555A CN 110096555 A CN110096555 A CN 110096555A CN 201910308704 A CN201910308704 A CN 201910308704A CN 110096555 A CN110096555 A CN 110096555A
- Authority
- CN
- China
- Prior art keywords
- expression
- matching
- key
- child
- table matching
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Multi Processors (AREA)
- Computer And Data Communications (AREA)
Abstract
The embodiment of the invention discloses the table matched processing methods and device of a kind of distributed system, if method includes: to judge to know in distributed system that the table matching expression as core logic path, is placed in the child nodes of the first stack top element current in stack by preset table matching expression；Expression formula matching successively is carried out to each child's expression formula of the table matching expression, and context is detected according to matching result set key；If after the table matching expression matching, there are key assignments codes for the key detection context, then generates key row adaptation and the table of the distributed system is matched.The embodiment of the present invention selects optimal key row adaptation to match the table of distributed system by judgement table matching expression with the presence or absence of core logic path, has matched effective dynamic data, has obtained accurate calculated result；Unnecessary row matching is eliminated simultaneously, is reduced the time complexity of table matching algorithm, has been ensured the normal operation of distributed system.
Description
Technical Field
The embodiment of the invention relates to the technical field of computers, in particular to a table matching processing method and device for a distributed system.
Background
The existing table matching algorithm is generally realized by adopting a progressive traversal algorithm, and the time complexity is in direct proportion to the number of rows. The time complexity can also be tolerated when the number of rows is small. When the number of rows is large, the time complexity becomes large. Particularly for an application scenario of a network security engine pattern matching resource pool, each piece of original data needs to execute a table matching algorithm, and a line-by-line traversal algorithm becomes a system bottleneck.
Therefore, the line-by-line traversal table matching algorithm in the prior art is time-consuming and cannot meet the real-time performance of a distributed system.
Disclosure of Invention
Because the existing method has the above problems, the embodiments of the present invention provide a table matching processing method and apparatus for a distributed system.
In a first aspect, an embodiment of the present invention provides a table matching processing method for a distributed system, including:
if the table matching expression preset in the distributed system is judged and known to be a core logic path, the table matching expression is placed in a child node of a current first stack top element in a stack;
sequentially carrying out expression matching on each child expression of the table matching expression, and setting a key detection context according to a matching result;
and if the key detection context has key value codes after the table matching expression matching is finished, generating a key row matcher and matching the table of the distributed system.
In a second aspect, an embodiment of the present invention further provides a table matching processing apparatus for a distributed system, including:
the expression judging module is used for placing the table matching expression in a child node of a current first stack top element in the stack if judging that the table matching expression preset in the distributed system is the core logic path;
the expression matching module is used for sequentially carrying out expression matching on each child expression of the table matching expression and setting a key detection context according to a matching result;
and the table matching generation module is used for generating a key row matcher to match the table of the distributed system if the key detection context has a key value code after the table matching expression matching is finished.
In a third aspect, an embodiment of the present invention further provides an electronic device, including:
at least one processor; and
at least one memory communicatively coupled to the processor, wherein:
the memory stores program instructions executable by the processor, which when called by the processor are capable of performing the above-described methods.
In a fourth aspect, an embodiment of the present invention further provides a non-transitory computer-readable storage medium storing a computer program, which causes the computer to execute the above method.
According to the technical scheme, the table matching method and the device select the optimal key row matcher to match the table of the distributed system by judging whether the table matching expression has the core logic path or not, so that effective dynamic data are matched, and an accurate calculation result is obtained; meanwhile, unnecessary row matching is removed, the time complexity of a table matching algorithm is reduced, and the normal operation of a distributed system is guaranteed.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a schematic flowchart illustrating a table matching processing method of a distributed system according to an embodiment of the present invention;
fig. 2 is a schematic flowchart of a table matching processing method of a distributed system according to another embodiment of the present invention;
fig. 3 is a schematic structural diagram of a table matching processing apparatus of a distributed system according to an embodiment of the present invention;
fig. 4 is a logic block diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The following further describes embodiments of the present invention with reference to the accompanying drawings. The following examples are only for illustrating the technical solutions of the present invention more clearly, and the protection scope of the present invention is not limited thereby.
Fig. 1 shows a flowchart of a table matching processing method of a distributed system provided in this embodiment, including:
s101, if the table matching expression preset in the distributed system is judged and known to be a core logic path, the table matching expression is placed in a child node of a current first stack top element in a stack.
The table matching expression is a logic expression used for configuring and matching the dynamic data table and is composed of a plurality of child expressions, the result of the table matching expression is of a Boolean type, true represents a matched table matching expression, and false represents a non-matched table matching expression. The data in the dynamic data table generally refers to a system-configurable external resource pool, such as a network address, a port, a host, a web link, and the like, and the dynamic data table is used for configuring a data source of a table matching algorithm, loading the configurable external resource pool table, and caching the external resource pool table into a memory to form a dynamic data value. The table matching algorithm is used for processing distributed tasks related to the dynamic data table.
The core logic path comprises two types of logic expressions and comparison expressions, and the expressions except the two types are not the core logic path.
The stack is used to store table matching expressions and their child expressions. Due to the special storage structure of the stack, its top-of-stack element is constantly changing, i.e. each newly added element will become a new top-of-stack element.
And the first stack top element is an expression of last stacking.
S102, carrying out expression matching on each child expression of the table matching expression in sequence, and setting a key detection context according to a matching result.
Specifically, because the table matching expression includes a plurality of child expressions, expression matching needs to be performed on each child expression in sequence, a matching result is generated after each child expression is matched, and if the matching result meets the requirement, a key is set to detect the context.
The key detection context is a parameter shared in this embodiment, and represents a result of key (key) detection. Corresponding to this, the row (row) detection is the detection technique used in the row-by-row traversal table matching algorithm adopted in the prior art.
S103, if the key detection context has key value codes after the table matching expression matching is finished, generating a key row matcher and matching the tables of the distributed system.
Specifically, when any child expression of the table matching expression satisfies the table matching expression, the key detects that a key value code exists in the context, and the existence of the key value code indicates that the key row matcher can be used for replacing a common row matcher in the prior art to perform table matching of the distributed system.
The key row matcher adopts a key-based table matching pattern algorithm to perform table matching.
In the embodiment, the optimal key row matcher is selected to match the tables of the distributed system by judging whether the table matching expression has a core logic path or not, so that effective dynamic data are matched, and an accurate calculation result is obtained; meanwhile, unnecessary row matching is removed, the time complexity of a table matching algorithm is reduced, and the normal operation of a distributed system is guaranteed.
Further, on the basis of the above method embodiment, S102 specifically includes:
if the first child expression of the table matching expression is a logic expression and the current state of the row matcher key selector is a state needing detection, detecting whether a left child node and a right child node of the first child expression are core logic paths, if one or all of the left child node and the right child node of the first child expression are core logic paths, placing the first child expression in a child node of a current second stack top element in a stack, and performing expression matching on each child expression of the first child expression.
If a second child expression of the table matching expression is a comparison expression and the node types of a left child node and a right child node of the second child expression are different, performing key comparison expression detection on the second child expression; the node type comprises a row value function node or a key value node.
And if the key value codes exist in the key value nodes during the key comparison expression detection, generating a key comparison expression, setting the key value codes for the key detection context according to the key comparison expression, and setting the state of the row matcher key selector to be a detection-unnecessary state.
The logic expression and the comparison expression are both core logic paths, the logic expression is a meaningful expression which connects the relational expression or the logic quantity by using a logic operator, and the comparison expression is an expression which checks whether a constant value, an attribute value or a method result is equal to, not equal to, larger than or smaller than another value.
The line matcher key selector is used for identifying specific conditions of line matching and key selection, and the key detection context is one of identification parameters of the line matcher key selector.
The line matcher key selector includes two states: a detection required state and an unnecessary detection state. When the row matcher key selector needs to detect the state, the table matching processing method provided by the embodiment is executed, namely whether the table of the distributed system can be matched by using a key row matcher is determined; and when the row matcher key selector is in a state which does not need to be detected, the table of the distributed system is directly matched by adopting a common matcher without judging.
It should be noted that, in the execution process of this embodiment, after setting a key value code for the key detection context, the state of the row matcher key selector needs to be set to the detection-unnecessary state; when the table matching expression is judged to be the core logic path, the state of the row matcher key selector needs to be set to a state needing to be detected, and the state of the row matcher key selector is updated in time, so that a matcher which can be selected by table matching of the distributed system can be determined accurately in the following step, that is, on the basis of the method embodiment, S101 may specifically include:
and if the table matching expression preset in the distributed system is judged and known to be the core logic path, the table matching expression is placed in the child node of the current first stack top element in the stack, and the current state of the row matcher key selector is set to be the state needing to be detected.
The key comparison expression is a key-based comparison expression.
The key value code is a code which can adopt a key row matcher to carry out table matching for the representation expression.
The first child expression is a child expression which is a logic expression in child expressions of the table matching expression.
The second child expression is a child expression of a comparison expression in child expressions of the table matching expression.
Specifically, as shown in fig. 2, after configuring the table matching expression, configuring the parameter dynamic data table, the table matching expression, and the table matching collection measurement, and determining whether the table matching expression is a core logic path, the table matching expression is stacked, the table matching expression is set as a child node of a top element of the stack, and the row matcher key selector is set as a child expression to be detected and recursively accesses the expression; when the child expression is a logic expression, if the child expression is an AND operation, and the row matcher key selector is in a state needing to be detected, if the child node is a core logic path, the logic expression is stacked, the child node of the logic expression is set as the child node of the current stack top element, and then left and right child nodes of the child node are recursively accessed; when the child expression is a comparison expression, only the "comparison expression" of the "equal (or)" type meets the requirement of the core logic expression, if the child node at the top of the stack contains the "comparison expression", and one of the left and right child nodes of the "comparison expression" is a row value function (function for acquiring a certain field in a dynamic data row) node, and the other is a key value (function for acquiring a certain field of source event data) node, whether the child node is the key comparison expression needs to be detected; when detecting a key comparison expression, initializing a key detection context of a row matcher key selector by using rowValueAstNode and keyValueAstNode, then accessing a key value node to obtain a key value code, judging whether the key value node contains a row value function same as the rowValueAstNode or not, and if not, generating the key comparison expression; when generating the key comparison expression, accessing rowValueAstNode, setting the key value of the key detection context as the parameter of the row value function, setting the key value code of the key detection context as the key value code, and setting the state of the row matcher key selector as the state without detection.
The method for table matching processing in the distributed system provided by the embodiment has the advantages of being distributed-oriented, correct in result, low in time complexity and the like, and is divided into three parts: the method comprises the steps of table matching expression configuration, core logic expression judgment and table matching mode selection, wherein the table matching expression configuration is used for setting a dynamic data table, a table matching expression and a table matching collection strategy.
The table matching collection strategy is used for collecting the dynamic data row strategy when the matching expression is configured, and the strategy can be configured to be none, all, first and last. none indicates no collection, all indicates that all rows are required for a collection symbol, first indicates the first row required for a collection symbol, and last indicates the last row required for a collection symbol.
Further, on the basis of the above embodiment of the method, the method further comprises:
and S104, if the key detection context does not have a key value code after the table matching expression is matched, generating a common matcher and matching the table of the distributed system.
Specifically, after the table matching expression is matched, the key detection context does not have a key value code, which indicates that the table matching expression and the child expression thereof cannot match the table of the distributed system by using the key row matcher, so that a conventional common row matcher can be selected to match the table of the distributed system.
The table matching processing method provided by the embodiment solves the problems that the line-by-line traversal table matching algorithm is time-consuming and cannot meet the real-time performance of the distributed streaming system, can accurately judge the core logic expression, selects the appropriate table matching mode algorithm, and can obtain the table matching result more quickly on the premise of meeting the table matching accuracy, thereby ensuring the real-time performance of the distributed streaming system.
Fig. 3 is a schematic structural diagram illustrating a table matching processing apparatus of a distributed system according to this embodiment, where the apparatus includes: an expression judging module 301, an expression matching module 302 and a table matching generating module 303, wherein:
the expression judging module 301 is configured to, if it is judged that a table matching expression preset in the distributed system is a core logic path, place the table matching expression in a child node of a current first stack top element in the stack;
the expression matching module 302 is configured to perform expression matching on each child expression of the table matching expression in sequence, and set a key detection context according to a matching result;
the table matching generation module 303 is configured to generate a key row matcher to match the table of the distributed system if the key detection context has a key value code after the table matching expression matching is finished.
Specifically, if the expression judging module 301 judges that a table matching expression preset in the distributed system is a core logic path, the table matching expression is placed in a child node of a current first stack top element in the stack; the expression matching module 302 sequentially performs expression matching on each child expression of the table matching expression, and sets a key detection context according to a matching result; the table matching generation module 303 generates a key row matcher to match the table of the distributed system if the key detection context has a key value code after the table matching expression matching is finished.
In the embodiment, the optimal key row matcher is selected to match the tables of the distributed system by judging whether the table matching expression has a core logic path or not, so that effective dynamic data are matched, and an accurate calculation result is obtained; meanwhile, unnecessary row matching is removed, the time complexity of a table matching algorithm is reduced, and the normal operation of a distributed system is guaranteed.
Further, on the basis of the foregoing device embodiment, the expression matching module 302 is specifically configured to detect whether a left child node and a right child node of the first child expression are core logic paths if the first child expression of the table matching expression is a logic expression and the current state of the row matcher key selector is a state that needs to be detected, place the first child expression on a child node of a current second stack top element in a stack if one or both of the left child node and the right child node of the first child expression are core logic paths, and perform expression matching on each child expression of the first child expression.
Further, on the basis of the above device embodiment, the expression matching module 302 is specifically configured to:
if a second child expression of the table matching expression is a comparison expression and the node types of a left child node and a right child node of the second child expression are different, performing key comparison expression detection on the second child expression; the node type comprises a row value function node or a key value node;
and if the key value codes exist in the key value nodes during the key comparison expression detection, generating a key comparison expression, setting the key value codes for the key detection context according to the key comparison expression, and setting the state of the row matcher key selector to be a detection-unnecessary state.
Further, on the basis of the above device embodiment, the expression determining module 301 is specifically configured to, if it is determined that a table matching expression preset in the distributed system is a core logic path, place the table matching expression in a child node of a current first stack top element in the stack, and set a current state of the row matcher key selector as a state to be detected.
Further, on the basis of the above embodiment of the apparatus, the apparatus further comprises:
and the table matching module is used for generating a common matcher to match the table of the distributed system if the key detection context does not have a key value code after the table matching expression is matched.
The table matching processing apparatus of the distributed system described in this embodiment may be used to implement the above method embodiments, and the principle and technical effect are similar, which are not described herein again.
Referring to fig. 4, the electronic device includes: a processor (processor)401, a memory (memory)402, and a bus 403;
wherein,
the processor 401 and the memory 402 complete communication with each other through the bus 403;
the processor 401 is configured to call program instructions in the memory 402 to perform the methods provided by the above-described method embodiments.
The present embodiments disclose a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, enable the computer to perform the methods provided by the above-described method embodiments.
The present embodiments provide a non-transitory computer-readable storage medium storing computer instructions that cause the computer to perform the methods provided by the method embodiments described above.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
It should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (12)
1. A table matching processing method for a distributed system is characterized by comprising the following steps:
if the table matching expression preset in the distributed system is judged and known to be a core logic path, the table matching expression is placed in a child node of a current first stack top element in a stack;
sequentially carrying out expression matching on each child expression of the table matching expression, and setting a key detection context according to a matching result;
and if the key detection context has key value codes after the table matching expression matching is finished, generating a key row matcher and matching the table of the distributed system.
2. The method according to claim 1, wherein said sequentially performing expression matching on each child expression of said table matching expression comprises:
if the first child expression of the table matching expression is a logic expression and the current state of the row matcher key selector is a state needing detection, detecting whether a left child node and a right child node of the first child expression are core logic paths, if one or all of the left child node and the right child node of the first child expression are core logic paths, placing the first child expression in a child node of a current second stack top element in a stack, and performing expression matching on each child expression of the first child expression.
3. The method according to claim 1, wherein said sequentially performing expression matching on each child expression of said table matching expression, and setting a key detection context according to a matching result specifically comprises:
if a second child expression of the table matching expression is a comparison expression and the node types of a left child node and a right child node of the second child expression are different, performing key comparison expression detection on the second child expression; the node type comprises a row value function node or a key value node;
and if the key value codes exist in the key value nodes during the key comparison expression detection, generating a key comparison expression, setting the key value codes for the key detection context according to the key comparison expression, and setting the state of the row matcher key selector to be a detection-unnecessary state.
4. The method according to claim 1, wherein if it is determined that a table matching expression preset in the distributed system is a core logic path, placing the table matching expression in a child node of a current first stack top element in a stack specifically includes:
and if the table matching expression preset in the distributed system is judged and known to be the core logic path, the table matching expression is placed in the child node of the current first stack top element in the stack, and the current state of the row matcher key selector is set to be the state needing to be detected.
5. The method of claim 1, further comprising:
and if the key detection context does not have a key value code after the table matching expression is matched, generating a common matcher and matching the table of the distributed system.
6. A table matching processing apparatus for a distributed system, comprising:
the expression judging module is used for placing the table matching expression in a child node of a current first stack top element in the stack if judging that the table matching expression preset in the distributed system is the core logic path;
the expression matching module is used for sequentially carrying out expression matching on each child expression of the table matching expression and setting a key detection context according to a matching result;
and the table matching generation module is used for generating a key row matcher to match the table of the distributed system if the key detection context has a key value code after the table matching expression matching is finished.
7. The apparatus of claim 6, wherein the expression matching module is specifically configured to, if a first child expression of the table matching expression is a logical expression and a current state of a row matcher key selector is a state requiring detection, detect whether a left child node and a right child node of the first child expression are core logic paths, and if one or both of the left child node and the right child node of the first child expression are core logic paths, place the first child expression on a child node of a current second stack top element in a stack, and perform expression matching on each child expression of the first child expression.
8. The apparatus of claim 6, wherein the expression matching module is specifically configured to:
if a second child expression of the table matching expression is a comparison expression and the node types of a left child node and a right child node of the second child expression are different, performing key comparison expression detection on the second child expression; the node type comprises a row value function node or a key value node;
and if the key value codes exist in the key value nodes during the key comparison expression detection, generating a key comparison expression, setting the key value codes for the key detection context according to the key comparison expression, and setting the state of the row matcher key selector to be a detection-unnecessary state.
9. The apparatus of claim 6, wherein the expression determination module is specifically configured to, if it is determined that a table matching expression preset in the distributed system is a core logic path, place the table matching expression in a child node of a current first stack top element in a stack, and determine a current state of the row matcher key selector as a state that needs to be detected.
10. The apparatus of claim 6, further comprising:
and the table matching module is used for generating a common matcher to match the table of the distributed system if the key detection context does not have a key value code after the table matching expression is matched.
11. An electronic device, comprising:
at least one processor; and
at least one memory communicatively coupled to the processor, wherein:
the memory stores program instructions executable by the processor, the processor invoking the program instructions to perform the method of any of claims 1 to 5.
12. A non-transitory computer-readable storage medium storing a computer program that causes a computer to perform the method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910308704.8A CN110096555B (en) | 2019-04-17 | 2019-04-17 | Table matching processing method and device for distributed system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910308704.8A CN110096555B (en) | 2019-04-17 | 2019-04-17 | Table matching processing method and device for distributed system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110096555A true CN110096555A (en) | 2019-08-06 |
| CN110096555B CN110096555B (en) | 2021-09-03 |
Family
ID=67445074
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910308704.8A Active CN110096555B (en) | 2019-04-17 | 2019-04-17 | Table matching processing method and device for distributed system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110096555B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6505191B1 (en) * | 1998-07-24 | 2003-01-07 | Jarg Corporation | Distributed computer database system and method employing hypertext linkage analysis |
| CN101477523A (en) * | 2008-11-24 | 2009-07-08 | 北京邮电大学 | Index structure and retrieval method for ultra-large fingerprint base |
| CN101719156A (en) * | 2009-12-30 | 2010-06-02 | 南开大学 | System of seamless integrated pure XML query engine in relational database |
| CN101996250A (en) * | 2010-11-15 | 2011-03-30 | 中国科学院计算技术研究所 | Hadoop-based mass stream data storage and query method and system |
| CN102253990A (en) * | 2011-07-05 | 2011-11-23 | 广东星海数字家庭产业技术研究院有限公司 | Interactive application multimedia data query method and device |
| US20150205727A1 (en) * | 2014-01-17 | 2015-07-23 | Netapp, Inc. | Set-associative hash table organization for efficient storage and retrieval of data in a storage system |
| CN104991905A (en) * | 2015-06-17 | 2015-10-21 | 河北大学 | Method for mathematical expression retrieval based on hierarchical indexing |
| CN105740337A (en) * | 2016-01-22 | 2016-07-06 | 东南大学 | Rapid event matching method in content-based publishing subscription system |
| CN106095809A (en) * | 2016-05-30 | 2016-11-09 | 广东凯通科技股份有限公司 | Data matching method and system |
| CN107992577A (en) * | 2017-12-04 | 2018-05-04 | 北京奇安信科技有限公司 | A kind of Hash table data conflict processing method and device |
| US20180276289A1 (en) * | 2017-03-22 | 2018-09-27 | International Business Machines Corporation | Efficient database query aggregation of variable length data |
-
2019
- 2019-04-17 CN CN201910308704.8A patent/CN110096555B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6505191B1 (en) * | 1998-07-24 | 2003-01-07 | Jarg Corporation | Distributed computer database system and method employing hypertext linkage analysis |
| CN101477523A (en) * | 2008-11-24 | 2009-07-08 | 北京邮电大学 | Index structure and retrieval method for ultra-large fingerprint base |
| CN101719156A (en) * | 2009-12-30 | 2010-06-02 | 南开大学 | System of seamless integrated pure XML query engine in relational database |
| CN101996250A (en) * | 2010-11-15 | 2011-03-30 | 中国科学院计算技术研究所 | Hadoop-based mass stream data storage and query method and system |
| CN102253990A (en) * | 2011-07-05 | 2011-11-23 | 广东星海数字家庭产业技术研究院有限公司 | Interactive application multimedia data query method and device |
| US20150205727A1 (en) * | 2014-01-17 | 2015-07-23 | Netapp, Inc. | Set-associative hash table organization for efficient storage and retrieval of data in a storage system |
| CN104991905A (en) * | 2015-06-17 | 2015-10-21 | 河北大学 | Method for mathematical expression retrieval based on hierarchical indexing |
| CN105740337A (en) * | 2016-01-22 | 2016-07-06 | 东南大学 | Rapid event matching method in content-based publishing subscription system |
| CN106095809A (en) * | 2016-05-30 | 2016-11-09 | 广东凯通科技股份有限公司 | Data matching method and system |
| US20180276289A1 (en) * | 2017-03-22 | 2018-09-27 | International Business Machines Corporation | Efficient database query aggregation of variable length data |
| CN107992577A (en) * | 2017-12-04 | 2018-05-04 | 北京奇安信科技有限公司 | A kind of Hash table data conflict processing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110096555B (en) | 2021-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113342500B (en) | Task execution method, device, equipment and storage medium | |
| CN104268229B (en) | Resource obtaining method and device based on multi-process browser | |
| US9454561B2 (en) | Method and a consistency checker for finding data inconsistencies in a data repository | |
| CN110955390B (en) | Data processing method, device, electronic equipment and storage medium | |
| WO2021128171A1 (en) | Formal verification method and device for chip, and storage medium | |
| CN113360300B (en) | Interface call link generation method, device, equipment and readable storage medium | |
| CN115529229B (en) | Fault location method, device and equipment | |
| CN115048285B (en) | Method, device, equipment and medium for acquiring test data | |
| US7921220B2 (en) | Reducing occurrences of two-phase commits in a multi-node computing system | |
| US20140359365A1 (en) | Integrated Configuration Management and Monitoring for Computer Systems | |
| CN117709255B (en) | Test method, device, equipment and medium for indirect access register | |
| CN112380127A (en) | Test case regression method, device, equipment and storage medium | |
| CN110096555A (en) | A kind of the table matched processing method and device of distributed system | |
| CN113360522A (en) | Method and device for quickly identifying sensitive data | |
| CN111817895B (en) | Master control node switching method, device, equipment and storage medium | |
| CN110262950A (en) | Abnormal movement detection method and device based on many index | |
| CN115718745A (en) | Data quality detection method and device based on DAG graph task scheduling | |
| CN112069059A (en) | Test case generation method and system based on maximum likelihood estimation | |
| CN112783673A (en) | Method and device for determining call chain, computer equipment and storage medium | |
| CN113505115B (en) | A method, device and electronic device for batch importing data | |
| CN110554910A (en) | Method and apparatus for optimizing distributed computing performance | |
| CN110781194B (en) | Application program table data processing method and device, electronic equipment and storage medium | |
| US20250200011A1 (en) | Information processing system | |
| CN111105059B (en) | Attribute conflict discovery method, device and computer-readable storage medium | |
| CN107729211A (en) | A kind of condition responsive method of MCU system |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: Room 332, 3 / F, Building 102, 28 xinjiekouwei street, Xicheng District, Beijing 100088 Applicant after: QAX Technology Group Inc. Address before: 100015 15, 17 floor 1701-26, 3 building, 10 Jiuxianqiao Road, Chaoyang District, Beijing. Applicant before: BEIJING QIANXIN TECHNOLOGY Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |