Abstract: Systems and methods for event processing are provided. One aspect of the systems and methods includes receiving an event corresponding to an interaction of a user with a digital content channel; identifying a rule state for a segmentation rule that assigns users to a segment; assigning the user to the segment by evaluating the segmentation rule based on the rule state and the event from the digital content channel; updating the rule state; and providing customized content to the user based on the assignment of the user to the segment.

Abstract: A query processing system applies transforms to convert a collection of predicate statements to two parts, a matrix and a set of reduced predicate statements, and evaluates the matrix and reduced predicate statements when querying data. The query processing system applies the transforms to extract conjunctive predicates or disjunctive predicates from the predicate statements to provide the set of reduced predicate statements and generates the matrix using the extracted conjunctive predicates or disjunctive predicates. When data is received for querying, the query processing system evaluates the matrix and reduced predicate statements for the data to provide search results. The query processing system may first identify candidate predicate statements that may be satisfied for the data from the matrix and then evaluates the reduced predicate statements for those candidate predicate statements.

Abstract: A query processing system generates and employs a hybrid inverted index of predicates for predicate statement evaluation. The query processing system converts a collection of predicate statements to two parts, a matrix and a set of reduced predicate statements. The query processing system then generates a hybrid inverted index that maps values for variables to predicates from the matrix and the reduced predicate statements that evaluate to true for corresponding values. When querying data, the query processing system performs a lookup on the hybrid inverted index to identify predicates from the matrix and reduced predicate statements that evaluate to true for values of variables for the data. The query processing system identifies predicate statements that evaluate to true by evaluating the matrix and reduced predicate statements using treating predicates identified from the hybrid inverted index as true.

Abstract: A query processing system generates and employs an inverted index of predicates for predicate statement evaluation. The inverted index maps values for variables to predicates that evaluate to true for the corresponding values. When querying input data, the query processing system identifies a value for each variable in the input data. For each value and variable pair, the query processing system identifies predicates mapped to the value for the variable in the inverted index. The query processing system evaluates the predicate statements by treating each predicate identified from the inverted index as true. In some configurations, the query processing system represents each predicate statement using a bit string and evaluates the predicate statements for the input data by setting bits to one for predicates identified from the inverted index and determining predicate statements that evaluate to true based on the bit strings.

Abstract: Embodiments of the present disclosure are directed to a system, methods, and computer-readable media for compiling source code into bytecode using a compiler. Using a rules set as input, a compiler de-duplicates action codes in the rules and assigns a unique identifier to each action code. The compiler generates a cascading hierarchy of switches that process discrete portions of the unique identifiers in order to invoke methods. The methods are assigned to classes using a method-per-class limit, and bytecode is generated from the class-assigned methods.

Abstract: A query processing system applies transforms to convert a collection of predicate statements to two parts, a matrix and a set of reduced predicate statements, and evaluates the matrix and reduced predicate statements when querying data. The query processing system applies the transforms to extract conjunctive predicates or disjunctive predicates from the predicate statements to provide the set of reduced predicate statements and generates the matrix using the extracted conjunctive predicates or disjunctive predicates. When data is received for querying, the query processing system evaluates the matrix and reduced predicate statements for the data to provide search results. The query processing system may first identify candidate predicate statements that may be satisfied for the data from the matrix and then evaluates the reduced predicate statements for those candidate predicate statements.

Abstract: A query processing system generates and employs an inverted index of predicates for predicate statement evaluation. The inverted index maps values for variables to predicates that evaluate to true for the corresponding values. When querying input data, the query processing system identifies a value for each variable in the input data. For each value and variable pair, the query processing system identifies predicates mapped to the value for the variable in the inverted index. The query processing system evaluates the predicate statements by treating each predicate identified from the inverted index as true. In some configurations, the query processing system represents each predicate statement using a bit string and evaluates the predicate statements for the input data by setting bits to one for predicates identified from the inverted index and determining predicate statements that evaluate to true based on the bit strings.

Abstract: A query processing system generates and employs a hybrid inverted index of predicates for predicate statement evaluation. The query processing system converts a collection of predicate statements to two parts, a matrix and a set of reduced predicate statements. The query processing system then generates a hybrid inverted index that maps values for variables to predicates from the matrix and the reduced predicate statements that evaluate to true for corresponding values. When querying data, the query processing system performs a lookup on the hybrid inverted index to identify predicates from the matrix and reduced predicate statements that evaluate to true for values of variables for the data. The query processing system identifies predicate statements that evaluate to true by evaluating the matrix and reduced predicate statements using treating predicates identified from the hybrid inverted index as true.

Abstract: Embodiments of the present disclosure are directed to a system, methods, and computer-readable media for generating a hybrid data model. In embodiments, data feeds having different identities are used to generate profile fragments in one environment while relationships between the different identities are discerned in a separate environment. When a query is executed, an identity-based graph is generated to create a snapshot of the relationships determined at that time. Using the identity-based graph, those identities having a relationship to one another and to the query are determined. Profile fragments that correspond to the query-related identities are then aggregated together into a single hybrid data model.

Abstract: Embodiments of the present invention relate to facilitating control of advertisement spending. In embodiments, a spend rate allocated to a datacenter having a plurality of bidders is referenced. The spend rate allocated to the data center is used to determine a spend rate per bidder for each of the plurality of bidders within the datacenter. For each bidder, the spend rate per bidder is used to generate a bid rate indicating a number of advertisement bids to place per unit of time in accordance with a real time advertisement auction. Each bid rate generated for the corresponding bidder is intended to result in placement of an amount of advertisement bids that correspond with the spend rate per bidder. The bid rates are provided to the plurality of bidders, wherein each of the plurality of bidders uses the corresponding bid rate to determine whether to place a bid for an advertisement.

Abstract: Embodiments of the present invention relate to facilitating control of advertisement spending. In embodiments, a spend rate allocated to a datacenter having a plurality of bidders is referenced. The spend rate allocated to the data center is used to determine a spend rate per bidder for each of the plurality of bidders within the datacenter. For each bidder, the spend rate per bidder is used to generate a bid rate indicating a number of advertisement bids to place per unit of time in accordance with a real time advertisement auction. Each bid rate generated for the corresponding bidder is intended to result in placement of an amount of advertisement bids that correspond with the spend rate per bidder. The bid rates are provided to the plurality of bidders, wherein each of the plurality of bidders uses the corresponding bid rate to determine whether to place a bid for an advertisement.

Abstract: A method and system for trafficking one-to-one display ad campaigns centers around a Dynamic Ad Server that generates an advertising creative experience dynamically by assembling different ad subcomponents on the fly, selecting subcomponents based on publisher, user or media parameters submitted to the Ad Server at the time an ad impression is to be served. A business rules engine allows a marketer to author natural-language business rules. Using such system, campaigns can be designed and implemented wherein association of placements to creative tags is only per-size per-campaign, necessitating set-up of only one placement per distinct site in a media plan. By accommodating the rules via dynamic ad placement, a marketer's intent may be fully satisfied. Time required for set-up and launch is dramatically reduced and maintenance and optimization is infinitely scalable.

Abstract: A method and apparatus for representing an XML data structure as a fixed set of tables in relational database involves grouping at least one XML node and possibly any sub-node into a relationship, generating a fixed sized table for the grouping, possibly repeating groupings and generating tables, and creating references to any repeated groupings and tables until the XML data structure is completed.

Abstract: A method and apparatus for XML data normalization have been described.

Abstract: A method and apparatus for automating the creation of user interface screens by using an XML schema that defines the data to be presented and then using a display specification that defines how the data should be presented are disclosed.

Abstract: A method for the compilation, organization, and dissemination of business information is provided wherein the information is collected from several sources and then categorized according to it core traits. The core traits are identified by a number of predetermined schema. The schema allows core traits and attributes of company specific and company formatted information to be extracted and stored in a centralized structured database. The database contains generic consistent data regarding each category of information as identified by the schema. Once compiled the information may be accessed by a variety of users. The users can supply a template having areas of needed information identified and categorized by the schema. The information stored in the database that correlates to the template request is downloaded.

Abstract: A system for selecting and providing information. The system can include an advertisement server that provides selected advertisements in response to a request from a web page server. The request includes information that will allow the advertisement server to select an appropriate advertisement. The advertisement server includes a control program for controlling the selection of the advertisements. The control program communicates with one or more affinity engines. Each affinity engine determines an affinity (degree of relevance or indicator of matching) given advertisements have for the information corresponding to the request. The engines use different request information such as demographic information, page sponsor information, keyword sponsor information, etc.