US2006212449A1PendingUtilityA1

Method and apparatus for generating relevance-sensitive collation keys

Assignee: NOVY ALON R JPriority: Mar 21, 2005Filed: Mar 17, 2006Published: Sep 21, 2006
Est. expiryMar 21, 2025(expired)· nominal 20-yr term from priority
Inventors:Alon Novy
G06F 7/08G05B 15/02G05B 2219/32266Y02P90/02G05B 19/41865G06F 7/22G05B 2219/35391Y10S707/955
38
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A method and apparatus for generating collation keys that can be used by sorting methods so as to arrange a sequence of data objects in order of their semantic relevance to the user or their relevance to an operating context. The constituent data values of each data object are “weighted” according to semantic relevance and a composite collation key is generated that reflects the data object's overall relevance.

Claims

exact text as granted — not AI-modified
1 . A method comprising: 
 (a) providing a plurality of ranking values for each of a plurality of data objects, the data objects for sorting, such that a ranking value is generated for each sort field for each data object;    (b) providing a function of a plurality of the ranking values corresponding to a plurality of sort fields, and using the provided function to generate to generate a single collation key value for the data objects, the collation key arranged to provide for ordering the plurality of data objects, the function indicative of the relative degree to which the ranking value for each of the plurality of sort fields influences the collation key.    
   
   
       2 . A method as recited in  claim 1 , wherein the function is a weighted linear function so that (b) includes: 
 (i) generating a weight value for each of the ranking value for plurality of sort fields, each weight value indicative of the degree to which the ranking value for the sort field influences a collation key for sorting the data objects, the generating of the weight order according to a weight generating function; and    (ii) generating a value of the collation key for each of the data objects using the respective weight values to weight the ranking values of the plurality of sort keys.    
   
   
       3 . A method as recited in  claim 2 , wherein the collation key is arranged to provide for ordering the plurality of data objects according to their respective relevance to a user, user operating context, or a system acting as a user system.  
   
   
       4 . A method as recited in  claim 2 , wherein the data objects represent tasks and are part of data in a computerized control system scheduling a plurality of tasks.  
   
   
       5 . A method as recited in  claim 2 , wherein the data objects are part of data in a computer-based activity management system.  
   
   
       6 . A method as recited in  claim 2 , wherein the plurality of data objects is for sorting according to a set of one or more sort fields, and wherein said step (a) includes the generation of one ranking for each sort field in a manner such that a ranking value is generated for each sort field for each data object according to the sort order of the object for the sort field.  
   
   
       7 . A method as recited in  claim 2 , wherein (b)(ii) includes weighting each of the ranking for a sort key with its corresponding weight value, and combining the results of weighting to form the collation key.  
   
   
       8 . A method as recited in  claim 2 , wherein generating the ranking for some objects is according to the value in the corresponding sort field for the data object or a mathematical transformation of the value in the corresponding sort field.  
   
   
       9 . A carrier medium carrying computer-readable instructions that when executed by at least one processor of a processing system cause the processor to carry out a method comprising: 
 (a) providing a plurality of ranking values for each of a plurality of data objects, the data objects for sorting, such that a ranking value is generated for each sort field for each data object;    (b) providing a function of a plurality of the ranking values corresponding to a plurality of sort fields, and using the provided function to generate to generate a single collation key value for the data objects, the collation key arranged to provide for ordering the plurality of data objects, the function indicative of the relative degree to which the ranking value for each of the plurality of sort fields influences the collation key.    
   
   
       10 . A method as recited in  claim 9 , wherein the function is a weighted linear function so that (b) includes: 
 (i) generating a weight value for each of the ranking value for plurality of sort fields, each weight value indicative of the degree to which the ranking value for the sort field influences a collation key for sorting the data objects, the generating of the weight order according to a weight generating function; and    (ii) generating a value of the collation key for each of the data objects using the respective weight values to weight the ranking values of the plurality of sort keys.    
   
   
       11 . An apparatus comprising: 
 (a) means for generating a plurality of ranking values for each of a plurality of data objects, the data objects for sorting, such that a ranking value is generated for each sort field for each data object;    (b) means for generating a weight value for each of the ranking value for each sort field indicative of the degree to which the ranking value for the sort field influences a collation key for sorting the data objects, the generating of the weight order according to a weight generating function; and    (c) means for generating a value of the collation key for each of the data objects, the collation key arranged to provide for ordering the plurality of data objects according to their respective relevance to a user, user operating context, or a system acting as a user system.

Join the waitlist — get patent alerts

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

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