Adobe, Inc.

Amphire Solutions, Inc.

Sandeep Nawathe

Shashank Ramaprasad

Brian Bishop

Gerald Sangudi

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.

Query processing using matrix and reduced predicate statements

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.

Query processing using hybrid inverted index of predicates

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.

Query processing using inverted index of predicate statements

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.

System and method for compiling rules set into bytecode using switch and class hierarchies

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.

Controlling spend pacing in a distributed bidding system

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.

Growing community of inventors

Sunnyvale, CA, United States of America

Sandeep Nawathe