Back to results
US 7,890,494 B2Granted
System and/or method for processing events
AssigneeYahoo! Inc.
InventorsErik N. Vee, Minos Garofalakis, Jayavel Shanmugasundaram, Ashwin Kumar V Machanavajjhala
Life of this patent
Estimating the term…
Abstract
The subject matter disclosed herein relates to processing information regarding events. In one particular example, a stabbing query may be formulated in response to an event. One or more sets are associated with and/or mapped to nodes of a tree.
Claims23
A method of processing a stabbing query comprising:
- obtaining a signal representative of said stabbing query;
- identifying nodes in a tree, said tree being stored in a memory, each of a plurality of sets being associated with one or more nodes of said tree, which are candidate nodes for being associated with at least one set which is stabbed by said stabbing query, each of said sets being associated with a score;
- for at least one of said candidate nodes, determining whether at least one unselected one of said sets associated with said candidate node is stabbed by said stabbing query and, if said at least one of said unselected sets associated said candidate node is stabbed by said stabbing query, determining a highest scoring unselected set associated with said candidate node which is stabbed by said stabbing query;
- selecting an unselected set from among highest scoring sets associated with candidate nodes which are associated with at least one unselected set which is stabbed by said stabbing query, wherein a node is eliminated as being a candidate node if said node is not associated with an unselected set that is stabbed by said stabbing query;
- and
- repeating said determining and said selecting until a specified number of sets are selected.
3 more elements
An article comprising:
- a storage medium comprising machine readable instructions stored thereon which are executable by a computing platform to:
- identify nodes in a tree, each of a plurality of sets being associated with one or more nodes of said tree, which are candidate nodes for being associated with at least one set which is stabbed by a stabbing query, each of said sets being associated with a score;
- for each of said candidate nodes, determine whether at least one unselected one of said sets associated with said candidate node is stabbed by said stabbing query and, if said at least one of said unselected sets associated said candidate node is stabbed by said stabbing query, determine a highest scoring unselected set associated with said candidate node which is stabbed by said stabbing query;
- select an unselected set from among highest scoring sets associated with candidate nodes which are associated with at least one unselected set which is stabbed by said stabbing query, wherein a node is eliminated as being a candidate node if said node is not associated with an unselected set that is stabbed by said stabbing query;
- and
- repeat said determining and said selecting until a specified number of sets are selected.
3 more elements
An apparatus comprising:
- a computing platform, said computing platform being programmed with instructions to:
- (a) identify nodes in a tree stored in a memory, each of a plurality of sets being associated with one or more nodes of said tree, which are candidate nodes for being associated with at least one set which is stabbed by a stabbing query, each of said sets being associated with a score;
- (b) for at least one of said candidate nodes, determine whether at least one unselected one of said sets associated with said candidate node is stabbed by said stabbing query and, if said at least one of said unselected sets associated said candidate node is stabbed by said stabbing query, determine a highest scoring unselected set associated with said candidate node which is stabbed by said stabbing query;
- (c) select an unselected set from among highest scoring sets associated with candidate nodes associated with at least one unselected set which is stabbed by said stabbing query, wherein a node is eliminated as being a candidate node if said node is not associated with an unselected set that is stabbed by said stabbing query;
- and
- repeat (b) and (c) until a specified number of sets are selected.
3 more elements
An apparatus comprising:
- means, comprising a computing platform, for obtaining a signal representative of said stabbing query;
- means, comprising said computing platform, for identifying nodes in a tree, said tree being stored in a memory, each of a plurality of sets being associated with one or more nodes of said tree, which are candidate nodes for being associated with at least one set which is stabbed by said stabbing query, each of sets being associated with a score;
- for at least one of said candidate nodes, means, comprising said computing platform, for determining whether at least one unselected one of said sets associated with said candidate node is stabbed by said stabbing query and, if said at least one of said unselected sets associated said candidate node is stabbed by said stabbing query, determining a highest scoring unselected set associated with said candidate node which is stabbed by said stabbing query;
- means, comprising said computing platform, for selecting an unselected set from among highest scoring sets associated with candidate nodes which are associated with at least one unselected set which is stabbed by said stabbing query, wherein a node is eliminated as being a candidate node if said node is not associated with an unselected set that is stabbed by said stabbing query;
- and
- means, comprising said computing platform, for repeating said determining and said selecting until a specified number of sets are selected.
3 more elements
Dependencies are inferred from the claim text.