Abstract: This invention proposes a real time advertising and promotion apparatus that manages and distributes advertisement and promotion and marketing material to mobile, and in some cases stationary users based on their exact locations relative to where the advertised product and service is offered. The selection of ads are done with direct input from users. Each user creates his or her own selection criteria that are applied at run time to figure out the appropriate set of ads that offer products and services in which the user has expressly shown interest. Ads are delivered and presented to users directly through the system's interface, which offers a rich set of functions to the user that can be used to control what they receive and see, when and where. The system offers additional features that help users manage and use the ads that are presented. The apparatus also supports location and/or distance targeting for mobile vendors that do not have a fixed location and constantly or periodically move.

Abstract: Performing index search optimization by receiving a search query for a search of an index, wherein the index has been partitioned across a plurality of nodes. This search index optimization may be performed for deterministic as well as non-deterministic queries. In both cases, a local partition is searched and analyzed and a corresponding execution path is selected for optimization. Different optimization strategies are chosen for the two types of queries. For the cases when the partition or the set of partitions containing the required matches can be determined, the request is routed directly to that partition or set of partitions without interrogating other partitions.

Abstract: Techniques for enhanced processing of search requests directed to a partitioned index include receiving a request for a search of an index. The index is partitioned across a plurality of nodes in communication. The method also comprises determining whether the request is deterministic. The method further comprises determining a number of responses to request from at least one of the plurality of nodes based on whether the request is deterministic.

Abstract: Performing index search optimization by receiving a search query for a search of an index, wherein the index has been partitioned across a plurality of nodes. This search index optimization may be performed for deterministic as well as non-deterministic queries. In both cases, a local partition is searched and analyzed and a corresponding execution path is selected for optimization. Different optimization strategies are chosen for the two types of queries. For the cases when the partition or the set of partitions containing the required matches can be determined, the request is routed directly to that partition or set of partitions without interrogating other partitions.

Abstract: Techniques for enhanced updating of a partitioned index include first data that indicates a plurality of fields for each entry in an index for a data store. A current number of partitions for the index is determined. Second data that indicates at least one value for at least one field of at least a first entry in the index is received. A next number of partitions for the index based on the second data is determined automatically.

Abstract: Techniques for enhanced processing of search requests directed to a partitioned index include receiving a request for a search of an index. The index is partitioned across a plurality of nodes in communication. The method also comprises determining whether the request is deterministic. The method further comprises determining a number of responses to request from at least one of the plurality of nodes based on whether the request is deterministic.

Abstract: An approach is provided for optimizing a sequence of content filters or data screening tasks. A determination is made of filters for filtering content. For each of the filters, cost data for executing the filtering of the content is computed. A sequence of the filters is determined based on the computed cost data and the elimination rates for minimizing a total execution cost of the sequenced filters.

Abstract: Methods, system and computer readable media for distributing advertisements include minimizing storage costs for frequency capping, dividing a set of campaigns into slices and predetermining campaign-target matches. Frequency storage costs may be minimized by storing frequency data for those users or groups of users that have a high probability of exceeding a frequency limit. Additionally or alternatively, a set of campaigns may be divided into slices. Less than all of the slices may then be evaluated (i.e., instead of the entire set) against a user requesting an advertisement. Still further, all campaign-target matches may be evaluated prior to receiving advertisement requests. Re-evaluations may be performed when changes occur to the set of campaigns. The match data may be stored in bitset, hash map and bitmap storage structures.