System and method for providing structure and content scoring for XML
First Claim
1. A method of computing score of candidate answers to a database query, the method comprising:
- receiving the database query;
converting the database query to a binary predicate query;
assigning a first score to a match to the binary predicate query, the database query organized as a node labeled tree and the first score being associated with a relative importance of an individual keyword in a collection of documents, each document in the collection of documents organized as the node labeled tree, based on all structural and content predicates in the database query, wherein assigning the first score captures all the structure and content predicates in the database query by applying an edge relaxation, a leaf deletion relaxation and a subtree promotion relaxation to the node labeled tree of the database query;
assigning a second score to the match, the second score being associated with a relative importance of a keyword in an individual document in the collection of documents; and
computing an answer score for the database query based on the first score and second score.
1 Assignment
0 Petitions
Accused Products
Abstract
A system, method and computer readable medium are disclosed. The method embodiment relates to a method of computing score of candidate answers to a database query. The method comprises receiving a database query, assigning a first score to a match to the query, the first score being associated with a relative importance of an individual keyword in a collection of documents based on all structural and content predicates in the query, assigning a second score to the match, the second score being associated with a relative importance of a keyword in an individual document and using the assigned first score and second score to compute an answer score for the query.
29 Citations
18 Claims
-
1. A method of computing score of candidate answers to a database query, the method comprising:
-
receiving the database query; converting the database query to a binary predicate query; assigning a first score to a match to the binary predicate query, the database query organized as a node labeled tree and the first score being associated with a relative importance of an individual keyword in a collection of documents, each document in the collection of documents organized as the node labeled tree, based on all structural and content predicates in the database query, wherein assigning the first score captures all the structure and content predicates in the database query by applying an edge relaxation, a leaf deletion relaxation and a subtree promotion relaxation to the node labeled tree of the database query; assigning a second score to the match, the second score being associated with a relative importance of a keyword in an individual document in the collection of documents; and computing an answer score for the database query based on the first score and second score. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A non-transitory computer-readable medium storing instructions for controlling a computing device to compute a score of candidate answers to a database query, the instructions comprising:
-
receiving the database query; converting the database query to a binary predicate query; assigning a first score to a match to the binary predicate query, the database query organized as a node labeled tree and the first score being associated with a relative importance of an individual keyword in a collection of documents, each document in the collection of documents organized as the node labeled tree, based on all structural and content predicates in the database query, wherein assigning the first score captures all the structure and content predicates in the database query by applying an edge relaxation, a leaf deletion relaxation and a subtree promotion relaxation to the node labeled tree of the database query; assigning a second score to the match, the second score being associated with a relative importance of a keyword in an individual document in the collection of documents; and computing an answer score for the database query based on the assigned first score and second score. - View Dependent Claims (12, 13, 14, 15, 16, 17)
-
-
18. A system for computing score of candidate answers to a database query, the system comprising:
-
a processor; a first module configured to control the processor to receive the database query; a second module configured to control the processor to convert the database query to a binary predicate query; a third module configured to control the processor to assign a first score to a match to the binary predicate query, the database query organized as a node labeled tree and the first score being associated with a relative importance of an individual keyword in a collection of documents, each document in the collection of documents organized as the node labeled tree, based on all structural and content predicates in the database query, wherein assigning the first score captures all the structure and content predicates in the database query by applying an edge relaxation, a leaf deletion relaxation and a subtree promotion relaxation to the node labeled tree of the database query; a fourth module configured to control the processor to assign a second score to the match, the second score being associated with a relative importance of a keyword in an individual document in the collection of documents; and a fifth module configured to control the processor to use the assigned first score and second score to compute an answer score for the database query.
-
Specification