System and method for budgeted generalization search in hierarchies
First Claim
1. A computer system for searching a collection of objects having textual content, comprising:
- a query processor for providing services for querying the collection of objects having textual content, a plurality of the objects being associated with one or more locations in a plurality of taxonomies;
a budgeted search analysis engine operably coupled to the query processor for finding response objects matching one or more keywords of the query and matching the one or more locations in the plurality of taxonomies within a budgeted cost; and
a cover set analysis engine operably coupled to the budgeted search analysis engine for determining sets of points covering an area within a hierarchy of the plurality of taxonomies bounded by the one or more locations.
9 Assignments
0 Petitions
Accused Products
Abstract
An improved system and method is provided for searching a collection of objects that may be located in hierarchies of auxiliary information for retrieval of response objects. A framework to perform a generalization search in hierarchies may be used to generalize a search by moving up to a higher level in a hierarchy of taxonomies or to specialize a search by moving down to a lower level in the hierarchy of taxonomies. Once the system may decide to enumerate response objects at a particular level of generalization, a budgeted generalization search may be used for enumerating a set of response objects within a budgeted cost.
-
Citations
20 Claims
-
1. A computer system for searching a collection of objects having textual content, comprising:
-
a query processor for providing services for querying the collection of objects having textual content, a plurality of the objects being associated with one or more locations in a plurality of taxonomies; a budgeted search analysis engine operably coupled to the query processor for finding response objects matching one or more keywords of the query and matching the one or more locations in the plurality of taxonomies within a budgeted cost; and a cover set analysis engine operably coupled to the budgeted search analysis engine for determining sets of points covering an area within a hierarchy of the plurality of taxonomies bounded by the one or more locations. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A computer-implemented method for searching a collection of objects having textual content, comprising:
-
receiving a query and one or more locations within a plurality of taxonomies, the one or more locations having at least one associated response object; determining sets of points covering an area within a hierarchy of the plurality of taxonomies bounded by the one or more locations; finding a set of points having a total cost no greater than a budgeted cost within the sets of points covering the area within the hierarchy of the plurality of taxonomies bounded by the one or more locations; and outputting a list of response objects associated with the one or more locations within the set of points having the total cost no greater than the budgeted cost. - View Dependent Claims (7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A computer system for searching a collection of objects having textual content, comprising:
-
means for receiving a query and one or more locations within a plurality of taxonomies, the one or more locations having at least one associated response object; means for finding a set of points having a total cost no greater than a budgeted cost within sets of points covering an area within a hierarchy of the plurality of taxonomies bounded by the one or more locations; and means for outputting a list of response objects associated with the one or more locations within the set of points having the total cost no greater than the budgeted cost. - View Dependent Claims (17, 18, 19, 20)
-
Specification