# Patent

## Title
System and method for managing data streams

## Abstract

A system for a data stream management system includes a filter transport aggregate for a high speed input data stream with a plurality of packets each packet comprising attributes. The system includes an evaluation system to evaluate the high speed input data stream and partitions the packets into groups the attributes and a table, wherein the table stores the attributes of each packets using a hash function. A phantom query is used to define partitioned groups of packets using attributes other than those used to group the packets for solving user queries without performing the user queries on the high speed input data stream.

## Background
CROSS REFERENCE TO RELATED APPLICATIONS
This application claims priority to U.S. patent application Ser. No. 11/240,518 filed on Sep. 30, 2005 entitled System and Method for Managing Data Streams,” issued on Dec. 8, 2009 as U.S. Pat. No. 7,631,074. The entire disclosure of the prior application is considered as being part of the disclosure of the accompanying applications and hereby expressly incorporated by reference herein.
The present application claims priority to co-pending U.S. Provisional Patent Application Ser. No. 60/687,977 filed on Jun. 7, 2005.
FIELD
The present embodiments relate generally to the problem of efficiently computing multiple aggregations over high speed data streams.
BACKGROUND
Prior approaches to sharing computation for multiple aggregation queries over data streams have used common sub-expression analysis.
A need exists for the identification and maintenance of additional phantoms, especially for the Gigascope architecture. A need exists for a principled approach to the optimized evaluation of multiple aggregation queries, which are very common in data stream management systems. Gigascope currently evaluates multiple aggregation queries independently, with no shared computation. The key difficulty is in identifying the specific phantoms to maintain. The wrong choice in phantoms to maintain would result in additional work with no consequent benefit being gained.
Historically databases store lots of data, in collections of tables, each of which is a set of records. Using query languages such as SQL, information can be combined from multiple tables. More recently, the volume of data that we are able to collect such as IP (Internet Protocol) data, sensor data or other types of data, is so large that the data can't all be stored but one still wants to be able to compute the results of a query over the data.
As an example, consider IP data at the packet level. Each packet was sent at a particular time, from a particular source IP address, and to a particular destination IP address. One user may be interested in finding out how many packets came from a source IP during a specific time interval. The differences these queries are in which combinations of fields they want the information reported on, such as source IP, destination IP, and the like.
The present embodiments meet these needs.



BRIEF DESCRIPTION OF THE DRAWINGS
The detailed description will be better understood in conjunction with the accompanying drawings as follows:
FIG. 1 depicts an abstract model of Gigascope type query architecture.
FIG. 2 depicts processing multiple aggregation queries sharing the computation that is common to each one.
FIG. 3 depicts three examples of phantom query tree usable with the present embodiments.
FIG. 4 depicts an example of a phantom query graph.



The present embodiments are detailed below with reference to the listed Figures.
DETAILED DESCRIPTION OF THE EMBODIMENTS
Before explaining the present embodiments in detail, it is to be understood that the embodiments are not limited to the particular embodiments and that it can be practiced or carried out in various ways.
The present embodiments are directed at queries over high speed information that can be processed faster and more cost effectively than performing each query individually. All present embodiments are for a datastream management systems. The datastream management systems comprise a filter transform aggregate, and a high speed input data stream with a plurality of packets, wherein each packet is a record comprising multiple attributes.
The attributes can include a source port for which there are over 65,000 possible values and a source IP for which there are over 1 billion possible values for a total of 65 trillion combinations of values for these two attributes.
The datastream management systems can include an evaluation system to evaluate the high speed input data stream, which partition the packets based on the values of a groups of attributes. The result of the evaluation is maintained in a table, consisting of a record for each combination of values for the group of attributes. A hash function can be used to identify the record corresponding to a particular combination of values. The evaluation system can be an SQL evaluation system, an Oracle evaluation system, or combinations thereof.
The groups of attributes can have like IP addresses and like source ports or combinations thereof. The groups can also be combined by the number of attributes present in each packet and the value of each attribute can be different within the packet. Examples of attributes include source IP addresses, source ports, destination ports, destination IP addresses, time lengths, and combinations thereof.
The datastream management systems can include a phantom query. The phantom query groups packets using attributes other than those used to group the packets for solving user queries without performing the user queries on the high speed input data stream. The phantom query produces a output. The user queries can then be performed on an output from the phantom query. The phantom query can comprise a member selected from the group consisting of a request for source port, a request for destination port, a destination IP, a source IP, and combinations thereof.
The filter transform aggregate can include a low level filter transform aggregate and a high level filter transform aggregate. The filter transform aggregate query processing node can include a low level filter transform aggregate (LFTA) node and a high level filter transform aggregate (LFTA) node. The filter aggregate can includes from about 10,000 packets (low level filter transform aggregate) to about 1,000,000 packets (high level filter transform aggregate).
An embodied method of datastream management entails creating a filter transform aggregate. The filter transform aggregate can include three or more levels of filter transform aggregates. Creating the filter transform aggregate can entail creating a low level filter transform aggregate and a high level filter transform aggregate.
The data stream consists of a plurality of packets, wherein each packet includes one or more attributes. An evaluation is performed on the data stream. The packets are partitioned into groups based on attributes.
The embodied methods continue by creating a table in memory based on the attributes of each packet using a hash function. A phantom query is produced for a defined partitioned group of packets using attributes other than those used to group the packets for solving user queries. By applying the phantom query to the high speed data stream, two or more user queries can be subsequently solved simultaneously. The methods can be used to perform two or more user queries based on the output from the phantom query.
For example, a user might have wanted to look at multiple queries on a high volume data stream; the embodied methods allow a few phantoms to be maintained in order to look at the input stream. The output from the phantom queries can be used to solve the user's queries.
The low level query nodes (or LFTAs) perform simple operations such as selection, projection and aggregation on a high speed stream, greatly reducing the volume of the data that is fed to the high level query nodes (or HFTAs). The HFTAs can then perform more complex processing on the reduced volume (and speed) of data obtained from the LFTA.
The present embodiments compute multiple aggregation queries that differ only in their grouping attributes. The present embodiments can be beneficial to additionally compute and maintain phantoms at the LFTA. Phantoms are fine-granularity aggregation queries that, while not of interest to the user, allow for shared computation between multiple aggregation queries over a high speed data stream.
The present embodiments can be used to investigate the problem of identifying beneficial configurations of phantoms and user-queries in an LFTA.
As an example, a Gigascope from AT&T Labs splits a (potentially complex) query over high speed tuple data streams into two parts: (i) simple low-level queries (at the LFTA) over high speed data streams, which serve to reduce data volumes, and (ii) (potentially complex) high-level queries (at the HFTA) over the low speed data streams seen at the HFTA. LFTAs can be processed on a Network Interface Card (NIC), which has both processing capability and limited memory (a few MBs). HFTAs can be processed in a host machine's main memory, which can be hundreds of MB to several GB.
A single aggregation query Q0 can be processed in Gigascope by considering a data stream relation R (for example, IP packet headers) four attributes A, B, C, and D (for example source IP, source port, destination IP, destination port), in addition to a time attribute.
With reference to the figures, FIG. 1 depicts an abstracted model of Gigascope. ML corresponds to the LFTA, and MH corresponds to the HFTA. Q0 is processed in Gigascope as follows. When a data stream record in R arrives, the data stream record is observed at ML. ML maintains a hash table consisting of a specified number of entries. Each entry is a {group, count} pair. Each group identifies the most recently observed group that hashes to this entry and count keep track of the number of times that group has been recently observed without observing other groups that hash to the same entry.
Since MH has much more space and a much reduced volume of data to process, processing at MH does not dominate the total cost. The overall bottlenecks are the cost of looking up the hash table in ML, and possible update in case of a collision. This whole operation, called a probe, has a nearly constant cost c1.
The operation of transferring an entry from M_L to M_h, called an eviction, has a nearly constant cost c2. Usually, c2 is much higher than c1 because the transfer from ML to MH is more expensive than a probe in ML.
FIG. 2 depicts processing multiple aggregation queries sharing the computation that is common to each one and thereby reduce the overall processing cost. For example, a hash table can be maintained for the relation ABC in ML as shown in FIG. 2. If given the counts of each group in ABC, the counts of each group of A, B and C can be derived from the hash table. The intuition is that, when a new record arrives, instead of probing three hash tables A, B and C, the hash table ABC would only be probed. The probes on A, B and C can be delayed until the point when an entry is evicted from ABC. The hash tables are omitted when the context is clear. Since the aggregation queries of A, B and C are derived from hash table ABC, ABC is described as feeding A, B and C. Although ABC is not of interest to the user, the maintenance can help reduce the overall cost. This relation can be referred to as a phantom. A, B and C, whose aggregate information is of user interest, are each called a query. Both queries and phantoms are called relations.
Consider the cost for processing n records. Without the phantom, three hash tables are probed for each incoming record, wherein x1n evictions from each table occur. The total cost is, therefore:

E1=3nc1+3x1nc2  (1)

With a phantom, only hash table ABC is probed for each incoming record, wherein x2n evictions occur. For each of these evictions, a probe A, B and C is done. Hence x′1x2n evictions are derived from each probe. The total cost is:

E2=nc1+3x2nc1+3x′1x2nc2  (2)

Comparing Equations 1 and 2, difference of E1 and E2 is as follows:

E1−E2=[(2−3x2)c1+3(x1−x′1x2)c2]n  (3)

If x2 is small enough so that both (2−3x2) and (x1−x′1x2) are larger than 0, E2 will be smaller than E1; therefore, instantiation of the phantom benefits the total cost. If x2 is not small enough so that one of (2−3x2) and (x1−x′1x2) is larger than 0 but the other is less than 0, E1−E2 depends on the relationship of c1 and c2.
In reference to FIG. 3 and FIG. 4, for stream relation R with four attributes A, B, C, and D, the queries are AB, BC, BD and CD. Phantom ABC can be initiated, wherein phantom ABC feeds AB and BC as shown in FIG. 3. A shaded box is a phantom and a non-shaded box is a query. Alternatively, phantom BCD can be initiated, wherein phantom BCD feeds BC, BD and CD as shown in FIG. 3, Further, phantom BCD and phantom ABCD can be initiated, wherein ABCD feeds AB and BCD as shown in FIG. 3. Only three alternatives are discussed, but many other possibilities can be performed. A phantom that feeds less than two relations is never beneficial. So by combining two or more queries, all possible phantoms can be obtained and can be plotted in a relation feeding graph as in FIG. 4. Each node in the graph is a relation and each directed edge shows a feed relationship between two nodes, that is, the parent feeds the child. The feed relationship can be “short circuited”, that is, a node can be directly fed by any of its ancestors in the graph. For example, AB can be fed directly by ABCD without having ABC or ABD instantiated.
Aggregation queries usually include a specification of temporal epochs of interest. For example, in the query “for every destination IP, destination port and 5 minute interval, report the average packet length”, the “5 minute interval” is the epoch of interest. During stream processing within an epoch (e.g., a specific 5 minute interval), the aggregation query hash tables need to be maintained, for each record in the stream. At the end of an epoch, all the hash tables of the user queries at the LFTA need to be evicted to the HFTA to complete the user query computations. Thus, two components to the cost exists: intra-epoch cost, and end-of-epoch cost.
Intra-Epoch Cost—Let Em is the maintenance cost of all the hash tables during an epoch T, the maintenance cost for short. Em includes updating all hash tables for the raw relations when a new record in the stream is processed. If (and only if) a collision in hash tables for the raw relations occurs, the hash tables of the relations they feed are updated. This process repeats until the hash tables for the leaf level. Each of these updates has a cost of c1.
If there are collisions in the hash tables for the leaf (user) queries, evictions to the HFTAs are incurred; each with the cost of c2. The total maintenance cost is, therefore:




  
    
      
        
          E
          m
        
        =
        
          
            
              ∑
              
                R
                ∈
                I
              
            
            ⁢
            
              
                J
                R
              
              ⁢
              
                c
                1
              
            
          
          +
          
            
              ∑
              
                R
                ∈
                L
              
            
            ⁢
            
              
                J
                R
              
              ⁢
              
                x
                R
              
              ⁢
              
                c
                2
              
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




I is a configuration; L is the set of all leaves in I; FR is the number of tuples fed to relation R during epoch T; and xR is the collision rate of the hash table for R. FR is derived as follows.




  
    
      
        
          J
          R
        
        =
        
          {
          
            
              
                
                  n
                  T
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    R
                  
                  ∈
                  W
                
              
            
            
              
                
                  
                    J
                    a
                  
                  ⁢
                  
                    x
                    a
                  
                
              
              
                else
              
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




W is the set of all raw relations; nT is the number of tuples observed in T; Fa is the number of tuples fed to the parent of R in I; and xa is the collision rate of the hash table for the parent of R in I. If Fa=nT and xa=1 when R is a raw relation, Equation 4 can be rewritten as follows.




  
    
      
        
          E
          m
        
        =
        
          
            [
            
              
                
                  ∑
                  
                    R
                    ∈
                    I
                  
                
                ⁢
                
                  
                    (
                    
                      
                        ∏
                        
                          
                            R
                            ′
                          
                          ∈
                          
                            A
                            R
                          
                        
                      
                      ⁢
                      
                        x
                        R
                        ′
                      
                    
                    )
                  
                  ⁢
                  
                    c
                    1
                  
                
              
              +
              
                
                  ∑
                  
                    R
                    ∈
                    L
                  
                
                ⁢
                
                  
                    (
                    
                      
                        ∏
                        
                          
                            R
                            ′
                          
                          ∈
                          
                            A
                            R
                          
                        
                      
                      ⁢
                      
                        x
                        R
                        ′
                      
                    
                    )
                  
                  ⁢
                  
                    x
                    R
                  
                  ⁢
                  
                    c
                    2
                  
                
              
            
            ]
          
          ⁢
          
            n
            T
          
        
      
    
    
      
        (
        6
        )
      
    
  




AR is the set of all ancestors of R in I. The term nT is determined by the data stream and is not affected by the configuration. The per record cost is:




  
    
      
        
          e
          m
        
        =
        
          [
          
            
              
                ∑
                
                  R
                  ∈
                  I
                
              
              ⁢
              
                
                  (
                  
                    
                      ∏
                      
                        
                          R
                          ′
                        
                        ∈
                        
                          A
                          R
                        
                      
                    
                    ⁢
                    
                      x
                      R
                      ′
                    
                  
                  )
                
                ⁢
                
                  c
                  1
                
              
            
            +
            
              
                ∑
                
                  R
                  ∈
                  L
                
              
              ⁢
              
                
                  (
                  
                    
                      ∏
                      
                        
                          R
                          ′
                        
                        ∈
                        
                          A
                          R
                        
                      
                    
                    ⁢
                    
                      x
                      R
                      ′
                    
                  
                  )
                
                ⁢
                
                  x
                  R
                
                ⁢
                
                  c
                  2
                
              
            
          
          ]
        
      
    
    
      
        (
        7
        )
      
    
  




The terms c1 and c2 are constants determined by the LFTA/HFTA architecture of the DSMS. The cost is only affected by the feeding relationship and collision rates of the hash tables.
End-of-Epoch Cost—The update cost at the end of epoch T as Eu (the update cost for short) includes the cost of the following operations. From the raw level to the leaf level of the feeding graph of the configuration, each hash table is scanned. Each item in the hash table is propagated to hash tables of the lower level relations they feed. Finally, the leaf level hash table is scanned and each item in the leaf level hash table is evicted to the HFTA, MH. Using an analysis similar to the one for intraepoch costs and taking the possibilities of collisions during this phase into account, the update cost Eu can be expressed as follows:




  
    
      
        
          
            ∑
            
              
                R
                ∈
                I
              
              ,
              
                R
                ∉
                W
              
            
          
          ⁢
          
            
              [
              
                
                  ∑
                  
                    
                      R
                      ′
                    
                    ∈
                    
                      A
                      R
                    
                  
                
                ⁢
                
                  (
                  
                    
                      M
                      
                        R
                        ′
                      
                    
                    *
                    
                      
                        ∏
                        
                          
                            
                              R
                              ′′
                            
                            ∈
                            
                              
                                A
                                
                                  R
                                  ′
                                
                              
                              ⋃
                              
                                R
                                ′
                              
                            
                          
                          ,
                          
                            
                              R
                              ′′
                            
                            ∉
                            W
                          
                        
                      
                      ⁢
                      
                        x
                        R
                        ′′
                      
                    
                  
                  )
                
              
              ]
            
            ⁢
            
              c
              1
            
          
        
        +
        
          
            ∑
            
              R
              ∈
              L
            
          
          ⁢
          
            
              [
              
                
                  M
                  R
                
                +
                
                  
                    ∑
                    
                      
                        R
                        ′
                      
                      ∈
                      
                        A
                        R
                      
                    
                  
                  ⁢
                  
                    (
                    
                      
                        M
                        
                          R
                          ′
                        
                      
                      *
                      
                        
                          ∏
                          
                            
                              
                                R
                                ′′
                              
                              ∈
                              
                                
                                  A
                                  
                                    R
                                    ′
                                  
                                
                                ⋃
                                
                                  R
                                  ′
                                
                              
                            
                            ,
                            
                              
                                R
                                ′′
                              
                              ∉
                              W
                            
                          
                        
                        ⁢
                        
                          x
                          R
                          ′′
                        
                      
                    
                    )
                  
                
              
              ]
            
            ⁢
            
              c
              2
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




MR is the size of the hash table of relation R, and W is the set of all raw relations.
The present embodiments involve picking the right kind of phantom query. In picking the right phantom query, the system aggregates the user queries. The present embodiments provide a cost savings because of the two level architecture, but the present embodiments are not dependent on a two level architecture.
A user is interested in source IP, or source IP and destination IP, or source IP and source Port. The standard query technique stores and searches these separately. The present embodiments use phantom queries to discover the new search that was not originally asked for, but the output from the phantom can be used to create the answer to the user query.
While these embodiments have been described with emphasis on the embodiments, it should be understood that within the scope of the appended claims, the embodiments might be practiced other than as specifically described herein.

## Claims

1. A memory storing a set of instructions executable by a processor, the instructions operable to:
a. administer a data stream with a plurality of packets, using a filter transform aggregate, wherein each packet comprises a plurality of attributes;
b. partition the plurality of packets into groups based on similar attributes;
b. create a table in memory based on the attributes of the plurality of packets; and
c. make a phantom query for a defined partitioned group of packets using attributes other than those used to group the packets, to solve at least two user queries.

2. The memory of claim 1, wherein the step of creating the filter transform aggregate comprises creating a low level filter transform aggregate and a high level filter transform aggregate.

3. The memory of claim 1, wherein the step of creating the filter transform aggregate further comprises creating at least three levels of filter transform aggregates.

4. The memory of claim 1, wherein the filter aggregate comprises from about 10,000 packets to about 1,000,000 packets.

5. The memory of claim 1, wherein the at least two user queries are performed on an output from the phantom query.

6. The memory of claim 1, wherein the data stream is a high speed input data stream.

7. The memory of claim 1, wherein the evaluation is performed by an SQL evaluation system, an Oracle evaluation system, or combinations thereof.

8. The memory of claim 1, wherein the attributes are source IP addresses, source ports, destination ports, destination IP addresses, time lengths, or combinations thereof.

9. The memory of claim 1, wherein the phantom query comprises a member selected from the group consisting of a request for source port, a request for destination port, an IP destination address, IP origination address, and combinations thereof.

10. A datastream management system comprising:
a. a filter transform aggregate for managing a high speed input data stream with a plurality of packets, wherein each packet comprises at least one attribute, and wherein the filter transform aggregate comprises:
i. an evaluation system to partition the plurality of packets into groups using similar attributes;
ii. a table to store the attributes of the plurality of packets; and
iii. computer instruction to form a phantom query, wherein the phantom query uses a partitioned group of packets with attributes different than those used to group the plurality of packets into groups for solving user queries;

b. a memory storing the filter transform aggregate; and
c. a processor operating the filter transform aggregate.

11. The system of claim 10, wherein the attributes are source IP addresses, source ports, destination ports, destination IP addresses, time lengths, or combinations thereof.

12. The system of claim 10, wherein the evaluation system is an SQL evaluation system, an Oracle evaluation system, or combinations thereof.

13. The system of claim 10, wherein the filter transform aggregate further comprises a low level filter transport aggregate and a high level filter transform aggregate.

14. The system of claim 10, wherein the filter transform aggregate comprises from about 10,000 packets to about 1,000,000 packets.

15. The system of claim 10, wherein the phantom query comprises a member selected from the group consisting of a request for source port, a request for destination port, an IP destination address, IP origination address, and combinations thereof.

16. The system of claim 10, wherein the user queries are performed on an output from the phantom query.

17. A memory storing a set of instructions executable by a processor, the instructions operable to:
a. create a low level filter transform aggregate;
b. create a high level filter transform aggregate;
c. administer a high input data stream with a plurality of packets, wherein each packet comprises a plurality of attributes;
d. partition the plurality of packets into groups using similar attributes;
e. create a table in memory based on the attributes of each packets; and
d. make a phantom query for a partitioned group of packets using attributes different than those used to group the plurality of packets to solve simultaneously at least two user queries by applying the phantom query to the high input data stream.

18. The memory of claim 17, wherein the at least two user queries are performed on an output from the phantom query.

19. The memory of claim 17, wherein the attributes are source IP addresses, source ports, destination ports, destination IP addresses, time lengths, and combinations thereof.

20. The memory of claim 17, wherein the phantom query comprises a member selected from the group consisting of a request for source port, a request for destination port, an IP destination address, IP origination address, and combinations thereof.