Patents by Inventor Amelie Marian-Guerrier

Amelie Marian-Guerrier has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Adaptive processing of top-queries in nested-structure arbitrary markup language such as XML
    Patent number: 8606794
    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.
    Type: Grant
    Filed: March 4, 2013
    Date of Patent: December 10, 2013
    Assignee: AT&T Intellectual Property II, L.P.
    Inventors: Sihem Amer-Yahia, Nikolaos Koudas, Amelie Marian-Guerrier, Divesh Srivastava
  • ADAPTIVE PROCESSING OF TOP-K QUERIES IN NESTED-STRUCTURE ARBITRARY MARKUP LANGUAGE SUCH AS XML
    Publication number: 20130275407
    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.
    Type: Application
    Filed: March 4, 2013
    Publication date: October 17, 2013
    Inventors: Sihem Amer-Yahia, Nikolaos Koudas, Amelie Marian-Guerrier, Divesh Srivastava
  • Adaptive processing of top-queries in nested-structure arbitrary markup language such as XML
    Patent number: 8412714
    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.
    Type: Grant
    Filed: March 7, 2005
    Date of Patent: April 2, 2013
    Assignee: AT&T Intellectual Property II, L.P.
    Inventors: Sihem Amer-Yahia, Nikolaos Koudas, Amélie Marian-Guerrier, Divesh Srivastava
  • Adaptive processing of top-k queries in nested-structure arbitrary markup language such as XML
    Publication number: 20060112090
    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.
    Type: Application
    Filed: March 7, 2005
    Publication date: May 25, 2006
    Inventors: Sihem Amer-Yahia, Nikolaos Koudas, Amelie Marian-Guerrier, Divesh Srivastava