CN105630777A - Rapid query matching method of event models - Google Patents
Rapid query matching method of event models Download PDFInfo
- Publication number
- CN105630777A CN105630777A CN201410578743.7A CN201410578743A CN105630777A CN 105630777 A CN105630777 A CN 105630777A CN 201410578743 A CN201410578743 A CN 201410578743A CN 105630777 A CN105630777 A CN 105630777A
- Authority
- CN
- China
- Prior art keywords
- predicate
- event
- order
- matching
- predicates
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Provided is a rapid query matching method of event models. The method comprises two parts including an event ordering step and a time matching step. The event ordering process is a pre-processing process for event matching of a data structure of an event matching algorithm. When event services receives new event order, predicate tables, port lists and order lists are needed to be replaced. The event matching operation comprises following steps: conducting matching tests in the predicate table are conducted on received events one by one on data structure and event ordering pre-processing basis. The event matching operation further comprises steps: processing forward matching between an order region and a publish value, conducting reverse matching between an issuing region and order value and carrying out symmetrical matching between the issuing region and the order region. The rapid query matching method of event models has following beneficial effects: in order to satisfy the requirements for matching and support of dynamic events in a distributive virtual environment, an improved rapid event matching algorithm is put forward on the basis of conventional two kinds of algorithms; and the improved rapid event matching algorithm has advantages of two kinds of algorithms so that matching speed and efficiency are improved.
Description
Technical field
The present invention relates to the Communication in distributed virtual environment, particularly to the quick search matching process in a kind of event model, relate to the communication modes with feature event models such as asynchronism, dynamic, multi-to-multi and anonymities.
Technical background
Distributed virtual environment (DVE) technology has become as a popular subject of current computer realm, the various fields such as military affairs, medical science, building, education and amusement are successfully applied SinghG, SerraL.BrickNet:ASoftwareToolkitforNetworkBasedVirtualWo rlds (software tool pack of distributed virtual environment), Presence, 1994,3 (1): pp.19-34. event models (EventModel) be independently of application for providing the structure based on event communication, event (Event)[2]M.Haahr, R.Meier.P.Nixon, V.CahillandE.Jul, FilterringandScalabilityintheECODistributedEventModel (filtration of ECO distributed event model and stability), In5thInternationalSymposiumonSoftwareEngineeringforParallelan dDistrebutedSyetems, 2000. is exactly the basic communication mechanism in this traffic model. As a kind of novel traffic model, event model effect in distributed system communication is day by day obvious, and its feature and meaning are in that to it provide the communication mode of a kind of loose coupling. This communication mode have asynchronous communication, dynamic, many-many communication mode and can be anonymous feature, these features can adapt to the needs of large scale distributed system, the communication module and the emulation module that make distributed virtual environment can independently be designed exploitation simultaneously, decrease the complexity designed and developed.
Event matches is a very important link in event model design, is efficiency and the key of accuracy of the event transmission determining event model.
In the event model of distributed virtual environment, the event matches in the symmetrical publish/subscribe model being based on content of greatest concern. In this model, the publishing region of event needs to mate with each subscribing region, and each publishing region and order region are made up of multiple predicates, so realizing publishing region indeed through the coupling between predicate and ordering mating of region.
When a system to process substantial amounts of order and event, event matches needs in the face of thousands of predicate, so, event matches can be rapidly performed by determine the real-time of system and can be met, whether accurately simultaneous events coupling also will affect the accuracy that whole event transmits, and the event matches algorithm of a less efficiently accuracy rate largely can bring congested and bottleneck to system.
Therefore, research one event matches algorithm fast and accurately not only has profound significance in Related Research Domain, is also the distributed virtual environment key in the application of commercial field success to a great extent simultaneously.
Existing main event matches algorithm research is all be optimized process in reducing extra predicate matching test, and main algorithm is generally divided into two classes[3]WalidRjaibi, KlausDittrichandDielerJaepel.Eventmatchinginsymmetricsub scriptionsystems (event matches in symmetrical order system), InCASCONConference, 2002: based on predicate Index Algorithm (PredicateIndexingBased) with based on matching network algorithm (TestingNetworkBased).
Based on predicate Index Algorithm event matches algorithm mainly by order in predicate be organized into based on index structure, this type of algorithm is generally made up of two stages, first stage carries out predicate matching test, and second stage re-uses the test result of first stage and carries out ordering matching test. Represent algorithm to have: counting algorithm (CountingAlgorithm)[4]T.W.YanandH.Gare,Ya-Molina.IndexStructuresforSelectiveDisseminationofInfo rmationUndertheBooleanModel (under Boolean Model the index structure of header length distribution). ACMTrans.DatabaseSyst.1994,19(2): pp.332-334; The gloomy algorithm of the Chinese (HansonAlgorithm)[5]E.Hanson, M.Chaabouni, C.KimandY.Wang.APredicateMatchingAlogrithmforDatabaseRul eSystems (the predicate matching algorithm in a kind of database association rule system), InSIGMOD,90,1990 etc.
Main thought based on the algorithm of matching network is that event enters from the entrance of figure, is filtered by each intermediate node the structure ordering composition one figure or matching network at pretreatment stage, until outlet judges matching result. Represent algorithm to have: based on the algorithm of coupling number (TsetingTreeBased)[6]M.Aguilera, R.Strom, D.Sturman, M.AstleyandT.Chandra.MatchingEventsinAContent-basedSubsc riptionSystem (the content-based event matches in order system), InEighteenACMSymposiumonPrinciplesofDistributedComputing (PODC,99), 1999 and algorithm based on Binary Decision Diagrams (BinaryDecisionsDiagrams, BDDs)[7]A.Campailla, S.Chaki, E.Clarke, S.JhaandH.Veith.EfficientFilteringinPublish-SubscribeSys temsUsingBinaryDecisionDiagrams (uses the high efficiency filter of Binary Decision Diagrams) in publish/subscribe system, InProceedingsofthe23thInternationalConferenceonSoftwareE ngineering, Toronto, Canada, May2001, pp.443-452.
Existing two class matching algorithms have respective deficiency: the algorithm as indexed based on predicate cannot utilize the dependency auxiliary between different attribute to mate, thus improving matching efficiency; And the event matches algorithm based on decision networks needs static structure coupling tree or Binary Decision Diagrams, it is not suitable with the needs of dynamic event coupling, it is difficult to dynamically update, is generally only applicable to the event model of static state. And in distributed virtual environment, event and order are all dynamic, not only event needs the transmission of real time high-speed, orders and is also required to constantly update according to the change of User Status. Additionally, algorithm can only adapt to asymmetrical event matches at present, it is impossible to solve the problem of symmetrical event matches in distributed virtual environment.
Summary of the invention
It is an object of the invention to: in distributed virtual environment, need the requirement that dynamic symmetry event matches is supported, on existing two class algorithm bases, the quick events matching algorithm of a kind of improvement is proposed, this algorithm can combine the two respective advantages of class algorithm, not only increase speed and the efficiency of coupling, the problem also solving symmetrical event matches.
If ordering expression formula to be made up of multiple predicates, and event remaining by attribute forming.
The present invention's it is important that data structure part, and this is also the key of algorithm optimization of the present invention. Key data structure is made up of a predicate table (PredicateTable), coupling bucket (MatchBucket), Subscription List (SubscriptionList) and interface list (InterfaceList).
Predicate table(PredictTable): in the present invention, predicate table is the core of data structure, and the tissue of predicate table combines predicate Index Algorithm and the feature of the matching network each data structure of algorithm. All of Predicate Classification is the family of predicates, and the predicate with same alike result and same operation symbol is included into a family of predicates. All families of predicates are divided into equivalent predicate, upper thresholding predicate and lower thresholding predicate three class. A line of each family of predicates correspondence predicate table, and arranged in sequence: " the attribute<" family of predicates, predicate ratio arranges from big to small, otherwise, " attribute>" family of predicates, predicate ratio sorts from small to large, and for the equivalent family of predicates, then no matter which kind of order can. Additionally, the predicate pointer in order is coupled together by predicate table, finally all point to the concrete order of Subscription List.
Coupling bucket (MatchBucket): be used for assisting predicate table to mate. The coupling of predicate table is carried out line by line, but all of family of predicates is all ordered by not every order, some pointers may cross over some row, so that such predicate will not be lost in progressive scan, adopt the data structure of coupling bucket, for temporarily storing the index of these predicates alleviated.
Interface list (InterfaceList) and Subscription List (SubscriptionList): interface list maintains the ordering information that interface is corresponding with interface with Subscription List. Subscription List registers a record of all orders joining predicate table, has a pointer pointing to first predicate ordered in predicate table, it is simple to access all predicates of whole order simultaneously. Interface represents the direction of transfer of event, is the final purpose of event matches. Each interface is likely to there is a plurality of ordering information,
So all of order being organized together with interface list and Subscription List.
Quick search matching process step in a kind of event model is as follows, is divided into event to order and event matches two large divisions:
Event is ordered: the event subscription process in the data structure of event matches algorithm is exactly the preprocessing process of event matches, after Event Service receives new event order, it is necessary to update predicate table, interface list and Subscription List;
First, order is joined in Subscription List, the order that last follow-up sensing ordering last entry in Subscription List of the corresponding interface is newly added, and the order number of corresponding interface in interface list is added 1; If ordering number to have exceeded limit value, choosing two orders and assembling in all orders of this interface, the standard of selection is that two laps ordered are maximum;
Then, predicate table is registered Subscription List entry. The information ordered, according to predicate table order from top to bottom, by binary chop in ordering each family of predicates comprised, finds on position, and corresponding order value is inserted in table; In the process that predicate table inserts, the predicate of insertion is linked one by one by order from top to bottom, finally point to the correspondence position in Subscription List, and the pointer of first position in predicate table is ordered in corresponding list item transmission in Subscription List.
Event matches: on the basis of data structure and the pretreatment of event order, only the event received need to be carried out in predicate table matching test line by line, if the set of all predicates that Pi---is the i-th row family of predicates, Pi---_match represents the predicate set mating this event in Pi---, SmatchRepresent the order set of coupling;
First coupling bucket content is initialized by algorithm. Traversal Subscription List, finds the position of the predicate of each order, after initialization, saves the index of first predicate of all orders in coupling bucket; Adopt the data structure mating bucket that the coupling to predicate table carries out line by line, for temporarily storing the index of these predicates being delayed.
Then need predicate table is progressively scanned. For every a line of predicate table, being substantially carried out two parts work: find all predicates mating this event in this family of predicates, then the predicate of these couplings is investigated by content according to coupling bucket one by one; All predicates in predicate table are divided into coupling and do not mate two parts,
When the i-th row is tested, for the non-equivalent family of predicates, owing to predicate both passes through sequence, it is possible to use binary chop, according to property value corresponding in event, a position Pi---is found to be divided into Pi---_left and Pi---_right two parts; The Pi---_match of Pi---_left just this line corresponding, represents the set mating this event in the predicate of this row; For the equivalent family of predicates, then search the predicate of all predicate value property value corresponding equal to event, put into Pi---_match; If this event does not comprise the attribute that this journey is corresponding, then it is assumed that all of predicate of this line is all coupling, and Pi---_match comprises all predicates of this row;
In test line by line, being located at when the i-th row is tested, the predicate set that in coupling bucket, the i-th row is corresponding is Bi, then in this row, all predicate set really meeting matching test are Pi---_match �� Bi: order order corresponding to last node predicate in this being gathered and add Smatch, its follow-up predicate index is then probeed into position corresponding in coupling bucket by remaining. To Pi---_match and BiCap, value need BiIn each predicate index be about to predicate table Pi with this and be divided into the two-part split position of Pi---_left and Pi---_right to compare, this asks friendship to borrow to mean that this predicate attribute before this location, is otherwise removed.
The invention have the characteristics that this algorithm synthesis two class algorithm is respective a little, not only increase speed and the efficiency of coupling, the problem also solving symmetrical event matches
Specific implementation method
Concrete grammar of the present invention (algorithm) step is as follows, the event that is broadly divided into is ordered and event matches two large divisions: event is ordered: although present invention ground design object is quick events matching algorithm, but event is ordered and also be have impact on the data structure that event matches relies on. Event subscription process in the data structure of event matches algorithm is exactly the preprocessing process of event matches, after Event Service receives new event order, it is necessary to update predicate table, interface list and Subscription List. First, order is joined in Subscription List, the order that last order follow-up sensing of the last item purpose in Subscription List of the corresponding interface is newly added, if and order number has exceeded limit value to add 1. by the order number of corresponding interface in interface list, all orders of this interface are chosen two orders assemble, the lap that the standard selected is two is maximum, then, at predicate table
Entry is ordered in middle registration. The information ordered, according to predicate table order from top to bottom, by binary chop in ordering each family of predicates comprised, finds on position, and corresponding order straight cutting is entered in table. In the process that predicate table inserts, the predicate that river is inserted lives to link one by one by order from top to bottom, finally points to the correspondence position in Subscription List, and corresponding list item passs order pointer of first position in table in predicate in Subscription List.
User can also send to Time Service and update the existing request ordered. In distributed virtual environment, it is necessary to be continuously updated order. Update the process step ordered similar with adding new order. In predicate table, the predicate that correspondence is ordered is replaced one by one, and insert from new sort.
Event matches: on the basis of data structure and the pretreatment of event order, only the event received need to be carried out in predicate table matching test line by line.
If the set of all predicates that Pi---is the i-th row family of predicates, Pi---_match represents the predicate set mating this event in Pi. SmatchRepresent the order set of coupling.
First coupling bucket content is initialized by algorithm. Traversal Subscription List, finds the position of first predicate of each order. If first predicate ordered in predicate table the of the i-th row with regard to the position of j row, then in the i-th row of coupling bucket, add this location index j. After initialization, coupling bucket saves the index of first predicate of all orders.
Then need predicate table is progressively scanned. For every a line of predicate table, be substantially carried out two parts work: find all predicates mating this event in this family of predicates, then according to the content of coupling bucket to the predicate of these couplings by investigating.
Finding all predicates of match event in the family of predicates is exactly all predicates in predicate table are divided into coupling and do not mate two parts. When i row is tested for the non-equivalent family of predicates, owing to predicate both passes through sequence, so binary chop can be used, according to property value corresponding in event, find a position that Pi is divided into Pi---_left and Pi---_right two parts, the Pi---_match of Pi---_left just this line corresponding, represents the set mating this event in this predicate carried out. For the equivalent family of predicates, then search the predicate of all predicate value attribute corresponding equal to event, if putting into this event of Pi---_match. do not comprise the attribute that this journey is corresponding, then it is assumed that all of predicate of this line is all coupling, and Pi---_match comprises all predicates of this row.
In test line by line, being located at when the i-th row is tested, the predicate set that in coupling bucket, the i-th row is corresponding is Bi, then in this row, all predicate set really meeting matching test are Pi---_match �� Bi. it is the order addition S that the predicate of last node of order is corresponding during this is gatheredmatch, its follow-up predicate is then indexed correspondence position in the bucket inserting coupling by remaining. To Pi---_match and BiCap, it is only necessary to BiIn each predicate index be about to predicate table Pi with this and be divided into the two-part split position of Pi---_left and Pi---_right to compare, mean that this predicate belongs to this and asks friendship to borrow before this location, otherwise disallowable.
The coupling of symmetrical event: the present invention can also solve other algorithms matching problem without the symmetrical event taken into account, symmetrical event matches needs not only to process to be ordered region and mates with the forward of issue value, in addition it is also necessary to can process publishing region and order value reverse and mate and publishing region is mated with order region symmetry. Symmetrical event matches publishing region to be processed and order region are all made up of multiple predicates, and the problem of actually symmetrical event matches is exactly to be decomposed into mating between predicate with predicate. In the present invention, predicate is divided into three classes according to the operator each limited.
For equivalent predicate, no matter forward, it is all identical that reverse or symmetrical event matches processes, as long as the equal just coupling of property value, unequal does not just mate.
Under upper thresholding, the event matches of thresholding predicate is then different, upper thresholding and lower thresholding predicate are usually paired appearance, determine the scope of an attribute together, therefore the coupling that attribute that predicate comprises is paired is needed when predicate matching, this often adopts the predicate matching method of intersection, as for certain attribute predicates A, order region A �� (a, b), publishing region A �� (C, D), clearly, only as c <b or d, < just not mating during a, in other situations, two range of attributes have overlap, so needing to compare the upper thresholding predicate ordered. the predicate matching intersected is easily achieved on the algorithm structure of the predicate table of above-mentioned introduction, algorithm stands good, symmetrical algorithm remains in predicate table by scanning, still the same for the equivalent family of predicates, in test during the thresholding family of predicates, the property value choosing the lower thresholding predicate in publishing region is tested, remain as asymmetric event matches and equally carry out binary chop, predicate in a line is divided into left and right two parts, the predicate part of left side is coupling, test for the lower thresholding family of predicates, then take corresponding upper thresholding predicate matching in publishing region, or take left side after being split by predicate row.
So, scanning process and the algorithm above to predicate table are essentially identical, the test object simply chosen of change, and algorithm itself need not change, here it is achieve the coupling of symmetrical event.
In such symmetrical event matches algorithm, if to carry out forward or reverse event matches, value needs thresholding and lower thresholding predicate on the association attributes ordered in region of a side to take identical value, and other process still the same.
The present invention propose method, and design data realize distributed virtual environment in event model system have following advantage:
Matching speed is fast:The algorithm of the present invention make use of the relatedness between predicate and the pass property between attribute, accelerates matching speed, and what be a little can be embodied in the present invention based on predicate Index Algorithm with based on matching network algorithm is respective.
Dynamic: the algorithm of the present invention need not as existing structure matching network static as based on the algorithm of matching network, the shortcoming overcoming etc algorithm, it is possible to update ordering information dynamically.
High efficiency: compared with the algorithm of basis predicate index, the family of predicates has also been divided by this algorithm, and the mode of the sequence of each family of predicates or hash table has been indexed, and what this was can obtain significantly high efficiency when each predicate is mated.Complicated prompt drop is low: the spatial complex at the algorithm of the present invention is fast according to lot-size linear increase; The time complexity that its preprocessing process and event are ordered is substantially reduced in the event matches algorithm of matching network than existing basis, the time complexity of other event matches algorithms of the time complexity of matching process is suitable, and therefore the overall time complexity of algorithm can be greatly lowered.
Realize the coupling of symmetrical event: the algorithm of the present invention can not only the coupling that carry out asymmetric event of efficiently and accurately, apply also for the coupling of symmetrical event simultaneously, this is that other algorithms existing cannot be accomplished.
Current widely using along with Internet, distributed virtual environment and a kind of event matches technology rapidly and efficiently of relevant a series of application all exigences thereof, and the algorithm of cloth grace invention is it may be said that this demand of positive adaptation, it is anticipated that there is the good market prospect of kind-heartedness.
Implement row: it is applied in the distributed event model of network
At basis CBT(Core_BasedTree) in the distributed environment of multicast tree and reactiver outing thought, All hosts all passes through Active Routers (ActiveRouter) and is connected in multicast tree, uses the event model of publish/subscribe to carry out communication simultaneously. Therein release news, order message or publishing region, order region and all use the value of multiple attribute or representation that codomain forms, be called an interest expression formula.
In the first stage, Active Routers is after the order message receiving each main frame connecting it or downstream router transmission, while safeguarding virtual interface state, create and safeguard the router space (RoutingSpace) that all order regions (interest expression formula) are constituted. This routing space, as it was previously stated, be configured to the structure structure (predicate table, Subscription List and interface list) of multiple chained list, determines the structure of chained list according to the number of the attribute in interest expression formula and relation.
Hereafter, publish/subscribe message is constantly broadcasting propagation on tree, while Active Routers ceaselessly safeguards router space according to the message that new order message or order update, it is necessary to process the issue data received, the interest expression formula according to issuing in data is mated accordingly.
When implementing specifically to mate, according to quick events matching process of the present invention: first each attribute codomain in the interest expression formula in giving out information or value are compared owing to chained list is drained through sequence with chained list in corresponding routing space or array element, therefore just can find the position corresponding chained list of the attribute codomain of issue from the traversal chained list of little arrival, also it is known that whether the order region of certain virtual interface there is common factor.
Now, judge: if first attribute codomain is made a look up process, then collect puts in a set there is the interest expression formula occured simultaneously, the matching process of Subsequent attributes will be borrowed from this gathering and reject unmatched expression formula. Owing to requiring that all properties issued in data is desirable that certain the interest expression formula met in routing space simultaneously, therefore above-mentioned way is rational, as long as there being one to be unsatisfactory for, it is possible to reject unnecessary expression formula. Scanning result to predicate table, after namely completing coupling, in set, remaining expression formula is exactly the result of coupling.
After having mated, giving out information of Chen Gong coupling can find the order place virtual interface of correspondence according to the content ordered in chained list and interface chained list, and forwarded the data of this issue to corresponding Active Routers or main frame by virtual interface. Said process constantly repeats, and undertakes the communication in whole distributed environment and carries out. What the present invention was to provide the method realizes thought and computer program, it is not necessary to special working condition is once to study successfully cost almost negligible.
Claims (6)
1. the quick search matching process in event model, is characterized in that being divided into the time to order and event matches two large divisions;
Event is ordered: the event subscription process in the data structure of event matches algorithm is exactly the preprocessing process of event matches, after Event Service receives new event order, it is necessary to update predicate table, interface list and Subscription List;
First, order is joined in Subscription List, the order that last follow-up sensing ordering last entry in Subscription List of the corresponding interface is newly added, and the order number of corresponding interface in interface list is added 1; If ordering number to have exceeded limit value, choosing two orders and assembling in all orders of this interface, the standard of selection is that two laps ordered are maximum;
Then, in predicate table, entry is ordered in registration, and the information of order is according to predicate table order from top to bottom, then orders in each family of predicates comprised by binary chop, finds on position, and corresponding order value is inserted in table; In the process that predicate table inserts, the predicate of insertion is linked one by one by order from top to bottom, finally point to the correspondence position in Subscription List, and the pointer at first seat in predicate table is ordered in corresponding list item transmission in Subscription List;
Event matches: on the basis of data structure and the pretreatment of event order, only the event received progressively need to be carried out in predicate table matching test, if the set of all predicates that Pi is the i-th row family of predicates, Pi---_match represents the predicate set mating this event in Pi, and Smatch represents the order set of coupling;
First coupling bucket content is initialized by algorithm.
2. traversal Subscription List, finds the position of first predicate of each order, after initialization, saves the index of first predicate of all orders in coupling bucket; Adopt the data structure mating bucket that the coupling to predicate table carries out line by line, for temporarily storing the index of these predicates being delayed.
3. then needing predicate table is progressively scanned, for every a line of predicate table, be substantially carried out two parts work: find all predicates mating this event in the family of predicates, then the predicate of these couplings is investigated by content according to coupling bucket one by one; All predicates in predicate table are divided into coupling and do not mate two parts;
When testing i-th, for the non-equivalent family of predicates, owing to predicate both passes through sequence, so binary chop can be used, according to property value corresponding in event, find a position that Pi is divided into Pi_left and Pi_right two parts, the Pi---_match of Pi_left just this line corresponding, represent the set mating this event in the predicate of this row; For the equivalent family of predicates, then search the predicate of all predicate value property value corresponding equal to event, put into Pi---_match; If this event does not comprise the attribute that this journey is corresponding, then it is assumed that all of predicate of this line is all coupling, and Pi---_match comprises all predicates of this row;
In test line by line, being located at when the i-th row is tested, the predicate set that in coupling bucket, the i-th row is corresponding is Bi, then in this row, all predicate set really meeting matching test are Pi---_match �� Bi; Being the order addition Smatch that the predicate of last node of order is corresponding in this being gathered, its follow-up predicate index is then inserted correspondence position in coupling bucket by remaining.
4. the cap of couple Pi---_match and Bi, have only in a Bi each predicate index be about to predicate table Pi with this and be divided into the two-part split position of Pi_left and Pi_right to compare, mean that this predicate belongs to this and asks knot fruit before this location, otherwise disallowable.
5. the rapid time matching process in the event model described in claim 1, it is characterized in that the method for the coupling of symmetrical event is: process and order region and mate with the forward of issue value, also process publishing region and order value reverse mates and publishing region is mated with the symmetry in order region;
Symmetrical event matches publishing region to be processed and order region are all made up of multiple predicates, and predicate is divided into three classes according to the operator each limited;
For equivalent predicate, no matter forward, reverse or symmetrical event matches processes is all identical, as long as the equal just coupling of property value, unequal just do not mate;
The predicate matching method of the coupling employing intersection that attribute is paired, compares the upper thresholding predicate ordered with the lower thresholding predicate of issue, and the lower thresholding predicate of order then compares with the upper thresholding predicate issued;
Test on the thresholding family of predicates time, the property value choosing the lower thresholding predicate in publishing region is tested, remain as non-to become event matches equally carry out binary chop, the predicate in a line is divided into left and right two parts, the predicate part of left side be coupling; For the test of the lower thresholding family of predicates, then take upper thresholding predicate matching corresponding in publishing region, or take left side after the segmentation of predicate row;
In the event matches algorithm of such symmetry, if to carry out forward or reverse event matches, it is only necessary to the upper thresholding predicate of the association attributes ordered in region of a side and lower thresholding predicate are taken identical value, other process still the same.
6. the quick search matching process in a kind of event model described in claim 1, is characterized in that user sends to Event Service and updates the existing request ordered; In distributed virtual environment, it is necessary to be continuously updated order; Update the process step ordered similar with adding new order; In predicate table, the predicate that correspondence is ordered is replaced one by one, and insertion of resequencing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410578743.7A CN105630777A (en) | 2014-10-27 | 2014-10-27 | Rapid query matching method of event models |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410578743.7A CN105630777A (en) | 2014-10-27 | 2014-10-27 | Rapid query matching method of event models |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105630777A true CN105630777A (en) | 2016-06-01 |
Family
ID=56045731
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410578743.7A Pending CN105630777A (en) | 2014-10-27 | 2014-10-27 | Rapid query matching method of event models |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105630777A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109192250A (en) * | 2018-08-01 | 2019-01-11 | 华东理工大学 | The speeding-up simulation method of surface species fast transferring is overcome in a kind of heterogeneous catalysis |
-
2014
- 2014-10-27 CN CN201410578743.7A patent/CN105630777A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109192250A (en) * | 2018-08-01 | 2019-01-11 | 华东理工大学 | The speeding-up simulation method of surface species fast transferring is overcome in a kind of heterogeneous catalysis |
| CN109192250B (en) * | 2018-08-01 | 2021-12-07 | 华东理工大学 | Accelerated simulation method for overcoming rapid migration of surface species in heterogeneous catalysis |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5884304A (en) | Alternate key index query apparatus and method | |
| CN101686146B (en) | Method and equipment for fuzzy query, query result processing and filtering condition processing | |
| US20160357814A1 (en) | Method and apparatus for performing query aware partitioning | |
| WO2021259002A1 (en) | Decision tree-based method and apparatus for outputting abnormal data sources, and computer device | |
| CN106250519A (en) | Data query method and apparatus for parallel database | |
| CN101150489A (en) | Resource share method based on distributed hash table | |
| CN109857952A (en) | A kind of search engine and method for quickly retrieving with classification display | |
| CN103678513B (en) | A kind of interactively retrieval type generates method and system | |
| CN103310350B (en) | A kind of based on predicate differentiation and the quick subscription associated and matching process | |
| CN106682206A (en) | Method and system for big data processing | |
| Zhou et al. | MSTDB: a hybrid storage-empowered scalable semantic blockchain database | |
| CN110532282A (en) | Data query method and device | |
| US8150865B2 (en) | Techniques for coalescing subqueries | |
| CN105630777A (en) | Rapid query matching method of event models | |
| CN104463460B (en) | Processing method and processing device for the waiting information that network data is launched | |
| CN109783696A (en) | A kind of multi-mode index of the picture construction method and system towards weak structure correlation | |
| CN108052507A (en) | A kind of city management information the analysis of public opinion system and method | |
| CN103984760B (en) | The data structure of content oriented distribution subscription system and its compound event matching process | |
| CN110597857B (en) | Online aggregation method based on shared sample | |
| CN100367216C (en) | Rapid event matching method in event model | |
| CN106933844A (en) | Towards the construction method of the accessibility search index of extensive RDF data | |
| Shi et al. | Flow-based influence graph visual summarization | |
| Zhao et al. | Fedgsl: Federated graph structure learning for local subgraph augmentation | |
| CN106560804A (en) | Content retrieval method based on XML meaning | |
| CN103488650A (en) | Event matching method for use in event model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160601 |