US2006247937A1PendingUtilityA1

Method and apparatus for a context-based service look up

Assignee: IBMPriority: Apr 28, 2005Filed: Apr 28, 2005Published: Nov 2, 2006
Est. expiryApr 28, 2025(expired)· nominal 20-yr term from priority
G06F 9/5027G06F 2209/5015
46
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

The present invention relates to a context-based service look up, wherein a service instance, having a scope (O), comprises at least one service instance data set (b) having a hierarchy of levels. A service consumer data set (a), having a hierarchy of levels is received from a service consumer ( 1 ), having a situation (S). Comparisons are made of each service consumer data set with each service instance data set, for the same level. Dependent on results of the comparisons, it is determined whether said situation (S) of said service consumer ( 1 ) matches said scope (O) of said service instance.

Claims

exact text as granted — not AI-modified
1 . Method for a context-based service lookup, wherein a service instance, having a scope (Ω), comprises at least one service instance data set (b) having a hierarchical state structure, with each state of each hierarchy level being contained in the respective higher-level state of the hierarchy, wherein the method comprises: 
 a reception step for receiving from a service consumer ( 1 ), having a situation (Σ), at least one service consumer data set (a) having said hierarchical state structure, and wherein said service instance data set (b) contains an amount (m) of state levels independent from an amount (n) of levels contained in said service consumer data set (a),    a comparison step for comparing each service consumer data set (a) with each service instance data set (b) by performing comparisons of the respective state values (v, w) of states of the same level of hierarchy,    an aggregation step for aggregating the results of the comparisons    a determining step for determining, depending on the aggregate results, whether said situation (Σ) of said service consumer ( 1 ) matches said scope (Ω) of said service instance.    
   
   
       2 . Method according to  claim 1 , wherein the comparison step comprises comparing the respective state values (v, w) of states of the same level of hierarchy starting with the highest level in the hierarchy and then going down the hierarchy until the lowest level state in the hierarchy of either of said service consumer data set (a) or said service instance data set (b) has been compared.  
   
   
       3 . Method according to  claim 1 , further comprising an assignment step of assigning a match value (MATCH) to a compare variable (COMP_V), if said state values (v, w) of said respective states of the same level in the hierarchy of said service consumer data set (a) and said service instance data set (b) match each other or if both have a wild card value (*) or if only said state value (w) of said respective state of said service instance data set (b) has said wild card value (*).  
   
   
       4 . Method according to  claim 3 , further comprising an accumulation step for accumulating said results of the comparisons by first initializing an accumulation variable (ACC_V) with said match value (MATCH), second keeping said match value (MATCH) for the accumulation variable (ACC_V) only as long as while going down the state hierarchy, said compare variable (COMP_V) has said match value (MATCH).  
   
   
       5 . Method according to  claim 4 , wherein the aggregation step further comprises first initializing an aggregation variable (AGG_V) with said match value (MATCH) and second, keeping said match value (MATCH) of said aggregation variable (AGG_V) only as long as said accumulation variable (ACC_V) has said match value (MATCH) after said comparison of the respective service consumer data set (a) with the respective service instance data set (b).  
   
   
       6 . Method according to one of the  claim 3 , wherein the aggregation step further comprises assigning a partial match value (PARTIAL) to said compare variable (COMP_V), if only said state value (v) of said respective state of said service consumer data set (a) has said wildcard value (*).  
   
   
       7 . Method according to  claim 6 , wherein the aggregation step further comprises assigning said partial match value (PARTIAL) to said accumulation variable (ACC_V), if, while going down said state hierarchy the compare variable (COMP_V) has said match value (MATCH) or said partial match value (PARTIAL) and said accumulation variable (ACC_V) has said match value (MATCH) or said partial match value (PARTIAL).  
   
   
       8 . Method according to  claim 7 , wherein the aggregation step further comprises assigning said partial match value (PARTIAL) to said aggregation variable (AGG_V), if, while aggregating said results of said comparison of each respective service consumer data set (a) with each respective service instance data set (b): 
 said aggregation variable (AGG_V) has said match value (MATCH) and said accumulation value (ACC_V) has said partial match value (PARTIAL) or a fail value (FAIL) or    said aggregation variable (AGG_V) has said partial match value (PARTIAL) or    said aggregation variable (AGG_V) has said fail value (FAIL) and said accumulation variable (ACC_V) has said match value (MATCH) or said partial-match value (PARTIAL), and otherwise assigning to said aggregation variable (AGG_V) said fail value (FAIL).    
   
   
       9 . Method according to  claim 1 , wherein said states are locations or time intervals.  
   
   
       10 . Apparatus for a context-based service lookup, the apparatus comprising: 
 a service instance, having a scope (Ω), comprising at least one service instance data set (b) having a hierarchical state structure, with each state of each hierarchy level being contained in the respective higher level state of hierarchy, and    wherein the apparatus is designed to receive from a service consumer ( 1 ), having a situation (Σ), at least one service consumer data set (a) having said hierarchical state structure, and    said service instance data set (b) contains an amount (m) of hierarchy levels which are independent from an amount (n) of hierarchy levels contained in said service consumer data set (a), and    wherein the apparatus is further designed to perform comparisons of each service consumer data set (a) with each service instance data set (b) by comparing the respective state values (v, w) of states of the same hierarchy level, and aggregate the results of the comparisons, and determine, depending on the aggregate results, whether said situation (Σ) of said service consumer ( 1 ) matches said scope (Ω) of said service instance.    
   
   
       11 . Apparatus according to  claim 10 , wherein said comparing of the respective state values (v, w) of states of the same hierarchy level, comprises starting with the highest level in hierarchy and then going down the hierarchy until the lowest level in hierarchy state of either of said service consumer data set (a) or said service instance data set (b) has been compared.  
   
   
       12 . Apparatus according to  claim 10 , designed to assign a match value (MATCH) to a compare variable (COMP_V), if said state values (v, w) of said respective states of the same hierarchy of said service consumer data set (a) and said service instance data set (b) match each other or if both have a wild card value (*) or if only said state value (w) of said respective state of said service instance data set (b) has said wild card value (*).  
   
   
       13 . Apparatus according to  claim 12 , designed to accumulate said comparison results by first initializing an accumulation variable (ACC_V) with said match value (MATCH), second keeping said match value (MATCH) for the accumulation variable (ACC_V) only as long as while going down the state hierarchy, said compare variable (COMP_V) has said match value (MATCH).  
   
   
       14 . Apparatus according to  claim 13 , designed to aggregate the results of the comparison of each respective service consumer data set (a) with each respective service instance data set (b) by first initializing an aggregation variable (AGG_V) with said match value (MATCH), second keeping said match value (MATCH) of said aggregation variable (AGG_V) only as long as said accumulation variable (ACC_V) has said match value (MATCH) after said comparison of the respective service consumer data set (a) with the respective service instance data set (b).  
   
   
       15 . Apparatus according to  claim 12 , designed to assign a partial match value (PARTIAL) to said compare variable (COMP_V), if only said state value (v) of said respective state of said service consumer data set (a) has said wildcard value (*).  
   
   
       16 . Apparatus according to  claim 15 , designed to assign said partial match value (PARTIAL) to said accumulation variable (ACC_V), if, while going down said state hierarchy, the compare variable (COMP_V) has said match value (MATCH) or said partial match value (PARTIAL) and said accumulation variable (ACC_V) has said match value (MATCH) or said partial match value (PARTIAL).  
   
   
       17 . Apparatus according to  claim 16 , designed to assign said partial match value (PARTIAL) to said aggregation variable (AGG_V), if, while aggregating said results of said full comparison of each respective service consumer data set (a) with each respective service instance data set (b): 
 said aggregation variable (AGG_V) has said match value (MATCH) and said accumulation value (ACC_V) has said partial match value (PARTIAL) or a fail value (FAIL) or    said aggregation variable (AGG_V) has said partial match value (PARTIAL) or    said aggregation variable (AGG_V) has said fail value (FAIL) and said accumulation variable (ACC_V) has said match value (MATCH) or said partial match value (PARTIAL), and otherwise assigning to said aggregation variable (AGG_V) said fail value (FAIL).    
   
   
       18 . Apparatus according to  claim 10 , wherein said states are locations or time intervals.  
   
   
       19 . A computer program element comprising a computer program code means which, when loaded in a processor of a data processing system, configures the processor to perform a method comprising the steps recited in claims  1 - 9 .  
   
   
       20 . A storage medium encoded with machine-readable program code for a context-based service look up, said program code including instructions for causing a server to implement a method, comprising the steps recited in claims  1 - 9 .  
   
   
       21 . A method of equipping a client system with a context-based service lookup comprising the steps of: 
 providing the system with a capability to    compare each service consumer data set (a) of a service consumer with each service instance data set (b) of a service instance by comparing respective state values (v, w) of states of the same level of hierarchy of said service consumer data set (a) or said service instance data set (b), starting with the highest level in the hierarchy and then going down the hierarchy,    aggregate the results of the comparisons of each respective service consumer data set (a) with each respective service instance data set (b) and    determine, depending on the aggregate results, whether a situation (Σ) of said service consumer ( 1 ) matches a scope (Ω) of said service instance.

Join the waitlist — get patent alerts

Track US2006247937A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.