Content retrieval method based on XML meaning

Abstract

A content retrieval method based on XML meaning comprises the following steps: event ordering and temporal matching; event ordering: event ordering processing on a data structure of an event matching algorithm refers to an event matching preprocessing process; when event service receives a new event order, a predicate table, an interface list, and an event list need to be updated; event matching: on the basis of the data structure and event ordering preprocessing, the matching test of the received event is carried out line by line in the predicate table. Forward matching of an ordering region and an issue value, backward matching of an issue region and an ordering value, and symmetrical matching of the issue region and the ordering region are carried out; the invention aims at dynamic symmetry event matching support requirements in a distributed virtual environment, and provides an improved fast event matching algorithm based on two existing algorithms; the improved algorithm can combine advantages of two existing algorithms, and can improve the matching speed and efficiency.

Description

technical field [0001] The invention relates to communication problems in a distributed virtual environment, in particular to a fast query matching method in an event model, and relates to a communication mode of an event model with characteristics such as asynchrony, dynamicity, many-to-many and anonymity. [0002] technical background [0003] 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, medicine, architecture, education and entertainment. Singh G, Serra L.Brick Net: A Software Toolkit for Network Based Virtual Worlds (a software toolkit for distributed virtual environments), Presence, 1994, 3(1): pp.19-34. The Event Model is an application-independent structure for providing event-based communication , event (Event) [2] M.Haahr, R.Meier.P.Nixon, V.Cahill and E.Jul, Filterring and Scalability in the ECO Distributed Event Model (ECO Distributed Event M...

AI Technical Summary

Problems solved by technology

[0011] 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