专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明公开

EP1659509A3 Adaptive processing of top-k queries in nested-structure arbitrary mark-up language such as XML 审中-公开
标题翻译：与嵌套结构为XML的标记语言的top-k查询自适应处理
公开(公告)号：EP1659509A3
公开(公告)日：2007-05-30
申请号：EP05270034.1
申请日：2005-08-02
申请人： AT&T Corp.
发明人： Amer-Yahia, Sihem , Koudas, Nikolaos , Marian-Guerrier, Amelie , Srivastava, Divesh
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , G06F17/3053 , G06F17/30938
摘要： A method of adaptively evaluating a top- k query involves (1204) forming a servers having respective server queues storing candidate answers, processing the candidate answers, and (1232) providing a top- k set as a query evaluation. Processing includes adaptively choosing a winning 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.

2. 发明公开

EP1890243A2 Adaptive processing of top-k queries in nested structure arbitrary markup language such as XML 审中-公开
标题翻译：嵌套结构任意标记语言（如XML）中top-k查询的自适应处理
公开(公告)号：EP1890243A2
公开(公告)日：2008-02-20
申请号：EP07122148.5
申请日：2005-08-02
申请人： AT&T Corp.
发明人： Amer-Yahia, Sihem , Koudas, Nikolaos , Marian-Guerrier, Amelie , Srivastava, Divesh
IPC分类号： G06F17/30
CPC分类号： G06F17/30938 , G06F17/3053
摘要： A method of adaptively evaluating a query with respect to at least one document that is expressed in a nested-structure, document-specific markup language comprises the steps of:
a) receiving a query that is expressed as a tree of a degree d ≥ 3, the tree including (A) query nodes and (B) links that define relationships among the query nodes as being parents, children, ancestors or descendants of each other;
b) calculating scores for respective candidate answers that may include partial or final answers, at least one score including:
b1) a first portion determined by how many children or descendants a first node has, that are at a given level beneath the first node and that satisfy a first query requirement for that given level; and
b2) a second portion determined by what fraction of a second node's children or descendants at a predetermined level satisfy a second query requirement for that second node; and

c) applying the scores to govern a processing order of the candidate answers to arrive at an evaluation of the query.
摘要翻译：一种针对以嵌套结构，特定于文档的标记语言表达的至少一个文档来自适应评估查询的方法包括以下步骤：a）接收被表达为度数d≥3的树的查询，所述树包括（A）查询节点和（B）将查询节点之间的关系定义为彼此的父母，子女，祖先或后代的链接; b）计算可能包括部分或最终答案的各个候选答案的分数，至少一个分数包括：b1）第一部分，其由第一节点具有多少孩子或后代确定，处于第一节点下方给定水平处;以及满足该给定级别的第一查询要求; 以及b2）由预定级别的第二节点的子代或子代的什么比例确定的第二部分满足针对该第二节点的第二查询需求; 以及c）应用分数来管理候选答案的处理顺序以达到对查询的评估。

3. 发明公开

EP1890243A3 Adaptive processing of top-k queries in nested structure arbitrary markup language such as XML 审中-公开
标题翻译：与嵌套结构为XML的标记语言的top-k查询自适应处理
公开(公告)号：EP1890243A3
公开(公告)日：2008-03-19
申请号：EP07122148.5
申请日：2005-08-02
申请人： AT&T Corp.
发明人： Amer-Yahia, Sihem , Koudas, Nikolaos , Marian-Guerrier, Amelie , Srivastava, Divesh
IPC分类号： G06F17/30
CPC分类号： G06F17/30938 , G06F17/3053
摘要： A method of adaptively evaluating a query with respect to at least one document that is expressed in a nested-structure, document-specific markup language comprises the steps of:
a) receiving a query that is expressed as a tree of a degree d ≥ 3, the tree including (A) query nodes and (B) links that define relationships among the query nodes as being parents, children, ancestors or descendants of each other;
b) calculating scores for respective candidate answers that may include partial or final answers, at least one score including:
b1) a first portion determined by how many children or descendants a first node has, that are at a given level beneath the first node and that satisfy a first query requirement for that given level; and
b2) a second portion determined by what fraction of a second node's children or descendants at a predetermined level satisfy a second query requirement for that second node; and

c) applying the scores to govern a processing order of the candidate answers to arrive at an evaluation of the query.

4. 发明公开

EP1659509A2 Adaptive processing of top-k queries in nested-structure arbitrary mark-up language such as XML 审中-公开
标题翻译：自适应Verarbeitung von top-k Abfragen在einer Markierungssprache mit verschachtelter Struktur wie XML
公开(公告)号：EP1659509A2
公开(公告)日：2006-05-24
申请号：EP05270034.1
申请日：2005-08-02
申请人： AT&T Corp.
发明人： Amer-Yahia, Sihem , Koudas, Nikolaos , Marian-Guerrier, Amelie , Srivastava, Divesh
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , G06F17/3053 , G06F17/30938
摘要： 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.
摘要翻译：自适应地评估top-k查询的方法涉及（1204）形成具有存储候选答案的相应服务器队列的服务器，处理候选答案，以及（1232）提供top-k集合作为查询评估。处理包括自适应地选择应该发送当前候选答案的获胜服务器到其队列; 将当前候选答案发送给获胜服务器的队列; 自适应地从获胜服务器的队列中选择下一候选答案进行处理; 在获胜服务器上计算当前候选答案和下一个候选答案之间的连接，以产生新的当前候选答案; 并且如果新的当前候选答案的分数超过顶部k集合中的top-k答案的分数，则更新具有新的当前候选答案的top-k集合。还提供了一种计算候选答案分数的方法。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式