Patent Number: 6,253,195

Title: Optimized query tree

Abstract: Systems and methods for constructing and using filtering trees to compare events, data, or other instances of objects defined in an object-oriented schema against one or more query-based definitions. The filtering trees correspond to the logical expressions of one or more query-based definitions, and represent the structure of the computer-executable instructions for comparing events with the definitions. The filtering trees can be traversed so as to simultaneously compare the parameters of an event against multiple logical expressions. The filtering tree is traversed in a top to bottom cascading fashion until a leaf node is encountered in a process that is conceptually equivalent to processing the logical operations associated with the nodes. When a leaf node is encountered, an ordered set of logical values associated with the leaf node indicates which, if any, of the definitions are satisfied by the event. The filtering definitions can be conveniently used to filter events detected by event providers in a computer system so as to identify the event that are to be reported to event subscribers.

Inventors: Hudis; Irena (Bellevue, WA), McCollum; Raymond (Monroe, WA), Novik; Lev (Bellevue, WA)

Assignee: Microsoft Corporation

International Classification: G06F 17/30 (20060101); G06F 017/30 ()

Expiration Date: 06/26/2018