Graph-based searching for data stream

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.