G - Physics – 06 – F
Patent
G - Physics
06
F
G06F 17/30 (2006.01)
Patent
CA 2511027
A method of adaptively evaluating a top-k query with respect to at least one document using servers having respective server queues storing candidate answers, processing the candidate answers, and providing a top-k set as a query evaluation. Processing includes adaptively choosing a wining server to whose queue a current candidate answer should be sent; sending the current candidate answer to the winning server's queue; adaptively choosing a next candidate answer to process from the winning server's queue; computing a join between the current candidate answer and next candidate answers at the winning server, so as to produce a new current candidate answer; and updating the top-k set with the new current candidate answer only if a score of the new current candidate answer exceeds a score of a top-k answer in a top-k set. A method of calculating scores for candidate answers is also provided.
Amer-Yahia Sihem
Koudas Nikolaos
Marian-Guerrier Amelie
Srivastava Divesh
At&t Corp.
Kirby Eades Gale Baker
LandOfFree
Adaptive processing of top-k queries in nested-structure... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Adaptive processing of top-k queries in nested-structure..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive processing of top-k queries in nested-structure... will most certainly appreciate the feedback.
Profile ID: LFCA-PAI-O-1820733