Large scale publishing and subscribing pipelined matching method based on noumenon

A publish-subscribe and matching method technology, applied in the computer field, can solve problems such as time-consuming, difficulty in merging RDF subscription graph modes, failure to meet the performance requirements of large-scale publish-subscribe middleware systems, etc., to eliminate redundant matching and improve matching efficiency Effect

CN101510213BInactive Publication Date: 2010-07-21HANGZHOU DIANZI UNIV
0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Publication Date
2010-07-21
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention relates to a matching method for body-based large-scale publish-subscribe pipelines, aiming at solving the problems in the existing matching method which fails to meet the performance requirements of large-scale publish-subscribe middleware systems. The method comprises the following steps of: first establishing an RDF event graph model and an RDF subscribe graph mode; taking each arc in the RDF event graph model and the RDF subscribe graph mode as a basic semantic matching unit to establish a subscribe sentence mode index; and dividing the matching process of the basic semanticunits of the RDF event graph model and the RDF subscribe graph mode into six active processes of the pipeline to form matching pipelines. The six active processes comprises reading in of typed sentences; constraining and matching of types; constraining and matching of predication; node mapping; status checking; and matched results outputting. The matching method for the body-based large-scale publish-subscribe pipelines improves the matching efficiency of the body-based large-scale publish-subscribe middleware systems, and the performance thereof is not considerably affected by the subscribednumber of the systems. Simultaneously, the matching method also eliminates unnecessary and redundant matches between different subscribe graph modes.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention belongs to the technical field of computers and relates to an ontology-based large-scale publish-subscribe pipeline matching method. This method introduces ontology technology and parallel computing technology into the publish-subscribe middleware system to improve the matching accuracy and time efficiency of the large-scale publish-subscribe middleware system. Background technique

[0002] The publish-subscribe middleware system is very suitable for the loose communication requirements of distributed heterogeneous platforms such as Internet large-scale information distribution, mobile computing, and grid computing, and has broad application prospects. Traditional publish-subscribe middleware systems are subject-based, content-based, XML-based, etc. Most of them rely on specific event types and simple matching mechanisms, such as: keyword matching, predicate comparison of attribute values, XPath tree pattern matching Wait. The ontology-...

Examples

Embodiment Construction

[0027] A large-scale publish-subscribe pipeline matching method based on ontology includes the following steps:

[0028] Step (1) Establish an event / subscription ontology model: use Resource Description Framework, which is the RDF ontology description language, to express events / subscriptions in the form of RDF event graph or RDF subscription graph mode, specifically:

[0029] ① RDF event graph: RDF language expresses objective facts in the form of triples (Subject, property, Object), and each triple is called an RDF statement. Among them, the subject (Subject) is the URI reference of the described resource, the predicate (property) is the URI reference of a property, and the object (Object) is the value of the property, which can be a URI reference or text. If the subject and object are represented by nodes, and the predicates are represented by directed arcs, one or more RDF statements can be represented as a directed labeled graph, called an RDF graph. In the method of the...