Abstract: Systems and methods for very fast grouping of “similar” SQL queries according to user-supplied similarity criteria. The user-supplied similarity criteria include a threshold quantifying the degree of similarity between SQL queries and common artifacts included in the queries. A similarity-characterizing data structure allows for the very fast grouping of “similar” SQL queries. Because the computation is distributed among multiple compute nodes, a small cluster of compute nodes takes a short time to compute the similarity-characterizing data on a workload of tens of millions of queries. The user can supply the similarity criteria through a UI or a command line tool. Furthermore, the user can adjust the degree of similarity by supplying new similarity criteria. Accordingly, the system can display in real time or near real time, updated SQL groupings corresponding to the newly supplied similarity criteria using the originally computed similarity-characterizing data structure.

Abstract: Systems and methods for very fast grouping of “similar” SQL queries according to user-supplied similarity criteria. The user-supplied similarity criteria include a threshold quantifying the degree of similarity between SQL queries and common artifacts included in the queries. A similarity-characterizing data structure allows for the very fast grouping of “similar” SQL queries. Because the computation is distributed among multiple compute nodes, a small cluster of compute nodes takes a short time to compute the similarity-characterizing data on a workload of tens of millions of queries. The user can supply the similarity criteria through a UI or a command line tool. Furthermore, the user can adjust the degree of similarity by supplying new similarity criteria. Accordingly, the system can display in real time or near real time, updated SQL groupings corresponding to the newly supplied similarity criteria using the originally computed similarity-characterizing data structure.

Abstract: Systems and methods very fast grouping of “similar” SQL queries according to user-supplied similarity criteria are disclosed. The user-supplied similarity criteria includes a threshold quantifying the degree of similarity between SQL queries and common artifacts included in the queries. A similarity-characterizing data structure is disclosed that allows for the very fast grouping of “similar” SQL queries. Because the computation is distributed among multiple compute nodes, a small cluster of compute nodes takes a short time to compute the similarity-characterizing data on a workload of tens of millions of queries. The user can supply the similarity criteria through a UI or a command line tool. Furthermore, in some embodiments, the user can adjust the degree of similarity by supplying new similarity criteria.

Abstract: Systems and methods for very fast grouping of “similar” SQL queries according to user-supplied similarity criteria. The user-supplied similarity criteria include a threshold quantifying the degree of similarity between SQL queries and common artifacts included in the queries. A similarity-characterizing data structure allows for the very fast grouping of “similar” SQL queries. Because the computation is distributed among multiple compute nodes, a small cluster of compute nodes takes a short time to compute the similarity-characterizing data on a workload of tens of millions of queries. The user can supply the similarity criteria through a UI or a command line tool. Furthermore, the user can adjust the degree of similarity by supplying new similarity criteria. Accordingly, the system can display in real time or near real time, updated SQL groupings corresponding to the newly supplied similarity criteria using the originally computed similarity-characterizing data structure.

Abstract: Systems and methods very fast grouping of “similar” SQL queries according to user-supplied similarity criteria are disclosed. The user-supplied similarity criteria includes a threshold quantifying the degree of similarity between SQL queries and common artifacts included in the queries. A similarity-characterizing data structure is disclosed that allows for the very fast grouping of “similar” SQL queries. Because the computation is distributed among multiple compute nodes, a small cluster of compute nodes takes a short time to compute the similarity-characterizing data on a workload of tens of millions of queries. The user can supply the similarity criteria through a UI or a command line tool. Furthermore, in some embodiments, the user can adjust the degree of similarity by supplying new similarity criteria.

Abstract: According to one example embodiment, an EID-NOTIFY packet is defined for use with the Location/Identifier Separation Protocol (LISP). A first-hop network element may send EID-NOTIFY responsive to decoding a data packet from a previously undetected host on its subnetwork. A site network element may receive EID-NOTIFY, and send a MAP-REGISTER message to a mapping system. EID-NOTIFY may have substantially the same format as MAP-NOTIFY. This may enable the site network element to be removed more than one hop from the subnetwork.

Abstract: According to one example embodiment, an EID-NOTIFY packet is defined for use with the Location/Identifier Separation Protocol (LISP). A first-hop network element may send EID-NOTIFY responsive to decoding a data packet from a previously undetected host on its subnetwork. A site network element may receive EID-NOTIFY, and send a MAP-REGISTER message to a mapping system. EID-NOTIFY may have substantially the same format as MAP-NOTIFY. This may enable the site network element to be removed more than one hop from the subnetwork.

Abstract: According to the present invention, methods and apparatus are provided to allow for distribution of fiber channel messages. Messages associated with a variety of applications can be distributed within a single logical fabric to physical connected but logically disconnected fabrics. Interconnecting switches forward messages to neighboring fabrics and aggregate responses before replying to a first fabric.

Abstract: According to the present invention, methods and apparatus are provided to allow for distribution of fibre channel messages. Messages associated with a variety of applications can be distributed within a single logical fabric to physical connected but logically disconnected fabrics. Interconnecting switches forward messages to neighboring fabrics and aggregate responses before replying to a first fabric.