A method, system, and computer program product for graph-based searching for one or more data streams is disclosed. A computer-implemented method comprises extracting a plurality of tuples from one or more data streams. The method further comprises generating a graph for the plurality of tuples in which a node represents a tuple of the plurality of tuples and an edge represents a correlation between the node and another node, and the edge is generated based at least partly on one or more predetermined queries for the one or more data streams. The method further comprises traversing the graph based on the one or more predetermined queries. Accordingly, embodiments of the present disclosure can improve the search speed by use of the graph-based searching for one or more data streams.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A computer-implemented method comprising: extracting a plurality of tuples from one or more data streams; generating a graph for the plurality of tuples in which a node represents a tuple of the plurality of tuples and an edge represents a correlation between the node and another node, the edge being generated based at least partly on one or more predetermined queries for the one or more data streams; and traversing the graph based on the one or more predetermined queries: wherein the traversing the graph comprises: determining a first node in the plurality of nodes which is traversed first; and transferring a traverse event from the first node to a second node based on the set of queries; updating a set of queries and a query result in the traverse event; determining whether the updated set of queries is empty; in response to determining that the updated set of queries is empty, updating the query result in the traverse event; and outputting the updated query result.
2. The method of claim 1 , wherein the generating the graph comprises: generating a plurality of attributes of the node, the plurality of attributes including an identification, content of the tuple, and an index of at least one predetermined query of the one or more predetermined queries which is associated with the tuple.
3. The method of claim 2 , wherein the generating the graph further comprises: identifying a field of the tuple, the field of the tuple being associated with the predetermined query; extracting a value of the field from the tuple; and generating the edge between the node and the other node based at least partly on the value of the field.
4. The method of claim 3 , wherein the generating the edge between the node and the other node comprises: generating one or more groups based on a value of each of one or more fields associated with the one or more predetermined queries, one of the one or more groups satisfying a correlation condition for one of the one or more predetermined queries; and generating the edge between the node and the other node based on the one or more groups.
5. The method of claim 1 , wherein the extracting a plurality of tuples from one or more data streams further comprises: identifying a non-correlation query in the one or more predetermined queries, the non-correlation query representing a query associated with a single tuple in the plurality of tuples; performing the non-correlation query on the plurality of tuples; and updating the plurality of tuples based on the performing of the non-correlation query.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
May 17, 2019
August 3, 2021
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.