Rapid event matching method in event model

Abstract

A fast event matching method in event model. Its steps are divided into two parts of event order and event match, and they are as follows. Event order: the event order processing on the data structure of event matching arithmetic is the pretreating course of event order, that is when the event server receives new event order, it needs to renew predicate words list, interface list and order list; event match: on the basis of pretreating of data structure and event order, it just needs to have matching test to the received event in predicate words list line by line. It processes the right direction match of the order area and the promulgating value, and also processes the converse match of the order area and the promulgating value and the symmetrical match of he order area and the promulgating area; the present invention aims at the requirement of needing dynamic symmetrical event match support in distributed virtual environment, and puts forward a kind of improved fast event match arithmetic on the basis of present two kinds of arithmetic. The arithmetic synthesizes the advantages of the two kinds of arithmetic, and improves the match speed and efficiency.

Description

technical field [0001] The invention relates to the communication problem in the distributed virtual environment, in particular to the fast event matching method in the event model, and to the communication mode of the event model with the characteristics of asynchrony, dynamicity, many-to-many and anonymity. technical background [0002] Distributed Virtual Environment (DVE) technology has become a popular subject in the computer field, and has been successfully applied in many fields such as military affairs, medicine, architecture, education and entertainment. [1] Singh G, Serra L. Brick Net: A Software Toolkit for Network Based Virtual Worlds (Software Toolkit for Distributed Virtual Environments), Presence, 1994, 3(1): pp.19-34. [0003] The event model (Event Model) is independent of the application to provide an event-based communication structure, the event (Event) [2] M.Haahr, R.Meier, P.Nixon, V.Cahill and E.Jul, Filtering and Scalability in the ECO Distributed Ev...

AI Technical Summary

Problems solved by technology

[0010] The existing two types of matching algorithms have their own shortcomings: for example, the algorithm based on the predicate index cannot use the correlation between different attributes to assist in matching, thereby improving the matching efficiency; while the event matching algorithm based on the decision network needs to build a static matching tree Or binary decision diagrams, which do not meet the needs of dynamic event matching, are difficult to update dynamically, and are generally only suitable for static event models

In addition, current algorithms can only adapt to asymmetric event matching, and cannot solve the problem of symmetric event matching in distributed virtual environments

Images