发明名称 Adaptive processing of top-k queries in nested structure arbitrary markup language such as XML
摘要 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.
申请公布号 EP1890243(A2) 申请公布日期 2008.02.20
申请号 EP20070122148 申请日期 2005.08.02
申请人 AT&T CORP. 发明人 AMER-YAHIA, SIHEM;KOUDAS, NIKOLAOS;MARIAN-GUERRIER, AMELIE;SRIVASTAVA, DIVESH
分类号 G06F17/30 主分类号 G06F17/30
代理机构 代理人
主权项
地址