Invention Grant
- Patent Title: Adaptive processing of top-k queries in nested-structure arbitrary markup language such as XML
-
Application No.: US11073966Application Date: 2005-03-07
-
Publication No.: US08412714B2Publication Date: 2013-04-02
- Inventor: Sihem Amer-Yahia , Nikolaos Koudas , Amélie Marian-Guerrier , Divesh Srivastava
- Applicant: Sihem Amer-Yahia , Nikolaos Koudas , Amélie Marian-Guerrier , Divesh Srivastava
- Applicant Address: US GA Atlanta
- Assignee: AT&T Intellectual Property II, L.P.
- Current Assignee: AT&T Intellectual Property II, L.P.
- Current Assignee Address: US GA Atlanta
- Main IPC: G06F7/00
- IPC: G06F7/00

Abstract:
A method of adaptively evaluating a top-k query involves (1204) forming a servers having respective server queues storing candidate answers, processing (1322) the candidate answers, and (1232) providing a top-k set as a query evaluation. Processing includes (1402) adaptively choosing a winning server to whose queue a current candidate answer should be sent; (1404) sending the current candidate answer to the winning server's queue; (1334) adaptively choosing a next candidate answer to process from the winning server's queue; (1336) 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 (1338) 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.
Public/Granted literature
- US20060112090A1 Adaptive processing of top-k queries in nested-structure arbitrary markup language such as XML Public/Granted day:2006-05-25
Information query