G - Physics – 06 – F
Patent
G - Physics
06
F
G06F 17/30 (2006.01)
Patent
CA 2662936
A method and system adaptively evaluates a query with respect to at least one document that is expressed in a nested-structure, document-specific markup language. A query is expressed as a tree of a degree d >= 3 is received. The tree includes query nodes and links defining query node relationships as parents, children, ancestors or descendants. Scores for respective candidate answers are calculated that include partial or final answers. At least one score includes a first portion determined by how many children or descendants of a first node at a given level there beneath and satisfying a first query requirement for that given level; and a second portion determined by what fraction of a second node's children or descendants at a predetermined level satisfy a second query requirement. The scores govern a processing order of the candidate answers resulting in an evaluation of the query.
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-2046825