Notification of event handlers in broadcast or propagation mode by event
management services in a computer system
    1.
    发明授权
    Notification of event handlers in broadcast or propagation mode by event management services in a computer system 失效
    通过计算机系统中的事件管理服务在广播或传播模式下通知事件处理程序

    公开(公告)号:US5305454A

    公开(公告)日:1994-04-19

    申请号:US744850

    申请日:1991-08-12

    CPC分类号: G06F9/4812 G06F9/542

    摘要: 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. This technique saves processing time in situations where some or all of the event handlers in the sequence (after the first event handler) may not benefit from the event notification; in such a case, the event notification is not propagated to them.

    摘要翻译: 计算机操作系统管理各个程序内的多个事件处理程序感兴趣的事件。 事件处理程序按顺序排列,用于接收事件发生的顺序通知。 当事件发生时,序列中的第一个事件处理程序被通知,然后处理该事件。 然后,第一个事件处理程序确定序列中的第二个事件处理程序是否应该被通知事件。 如果是这样,序列中的第二个事件处理程序接收到事件通知,处理事件,然后确定是否应该通知序列中的第三个事件处理程序。 以这种方式,事件通知可以从序列中的事件处理程序传播到事件处理程序,但是接收通知的序列中的任何事件处理程序可以阻止事件通知的后续传播。 这种技术在序列中的某些或全部事件处理程序(第一个事件处理程序之后)可能不会从事件通知中受益的情况下,节省处理时间; 在这种情况下,事件通知不传播给他们。

    Hybrid tree array data structure and method
    2.
    发明授权
    Hybrid tree array data structure and method 失效
    混合树阵列数据结构与方法

    公开(公告)号:US6029170A

    公开(公告)日:2000-02-22

    申请号:US977700

    申请日:1997-11-25

    IPC分类号: G06F17/30

    摘要: 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.

    摘要翻译: 本发明的优选实施例提供了一种用于存储和访问数据的方法和装置。 优选实施例混合树阵列数据库提供使用树数据库搜索技术执行快速搜索的能力,以及使用阵列搜索技术搜索所有用户数据字段的能力。 特别地,作为典型树数据库的快速键搜索和作为典型阵列数据库的所有数据字段的顺序阵列搜索被提供在单个数据库中,而不需要将用户数据复制并存储在两个单独的数据库中。 因此,优选实施例提供搜索灵活性,而不需要管理单独阵列和树数据库所固有的过多存储要求和复杂性。 优选实施例还提供了允许数据库的各个用户使用树或阵列搜索技术搜索数据而不需要任何关于混合树阵列数据库的双重性质的详细知识的优点。