Abstract: The preferred embodiment of the present invention provides a method and apparatus for storing and accessing data. The preferred embodiment hybrid tree-array database provides the ability to perform fast searching using tree database search techniques and the ability to search all user data fields using array search techniques. In particular, fast key searching as a typical tree database and sequential array searching of all data fields as a typical array database are provided in a single database, without requiring the user data be duplicated and stored in two separate databases. Thus, the preferred embodiment provides searching flexibility without the excessive storage requirements and complexity inherent in managing separate array and tree databases. The preferred embodiment also provides the advantage of allowing individual users of the database to search the data using either tree or array search techniques without requiring any detailed knowledge of the dual nature of the hybrid tree-array database.

Abstract: A computer operating system manages events of interest to a plurality of event handlers within respective programs. The event handlers are arranged in a sequence for the purpose of receiving sequential notification of an occurrence of the event. When the event occurs, the first event handler in the sequence is notified, and it then handles the event. Then, the first event handler determines if the second event handler in the sequence should be notified of the event. If so, the second event handler in the sequence receives the event notification, handles the event, and then determines if the third event handler in the sequence should be notified. In this manner, the event notification can be propagated from event handler to event handler in the sequence, but any event handler in the sequence which receives the notification can block subsequent propagation of the event notification.