Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Kosuru

Ramakumar Kosuru, Austin, TX US

Patent application numberDescriptionPublished
20110145220SYSTEM AND METHOD FOR EXECUTING A QUERY - There is provided a computer-implemented method of executing a query. An exemplary method comprises optimizing the query. The query may specify multiple operations on corresponding multiple column sets of a table in a database. The exemplary method further comprises partitioning data of the table based on the operations within a single pass of the table. Additionally, the exemplary method comprises performing the operations on the partitioned data in parallel.06-16-2011

Ranajynar Kosuru, Austin, TX US

Patent application numberDescriptionPublished
20100114870Skew-based Costing for Database Queries - One embodiment is a method that determines skew to predict costs for query plans for a database query. The method selects a query plan that accounts for the skew to evenly distribute processing load among multiple processors and then executes the query with the selected query plan.05-06-2010

Yekesa Kosuru, Westford, MA US

Patent application numberDescriptionPublished
20090327055Dynamically Rearranging and Deploying Advertising Selection Logic - A method and system for deploying and customizing advertisement selection logic without requiring a shutdown and/or restart of system resources. A first arrangement of advertisement logic may include filters to be executed in a pipeline model. A second arrangement of advertisement selection logic may be determined based at least in part on information received. Alternatively, the second arrangement of advertisement selection logic may be automatic based at least in part on statistics or defined hints. The second arrangement of advertisement selection logic may be implemented using different filters or rearranged filters in an updated pipeline model.12-31-2009
20090327075Optimizing Advertisement Campaign Servicing - 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.12-31-2009
20110153644METHOD AND APPARATUS FOR UTILIZING A SCALABLE DATA STRUCTURE - An approach is provided for utilizing a scalable data structure. A query specifying an entity identifier and requested content is received. A search is caused, at least in part, the search based on the entity identifier of a profile index of data structures, each specifying a profile field that is associated with an access control field to yield a search result. Access rights to the requested content are indicated for the entity identifier. The data structures further include the profile field and the access control field.06-23-2011

Yekesa S. Kosuru, Westford, MA US

Patent application numberDescriptionPublished
20100114706Linked Hierarchical Advertisements - A computing device may receive a request for a first advertisement. The request for the first advertisement may include one or more parameters referencing a given subject matter. Responsive to the request for the first advertisement, a first ad may be selected and delivered to a requesting entity. The computing device may receive an indication of an expression of interest in the first ad. The expression of interest may include one or more parameters referencing the first ad. Responsive to the expression of interest, and based on the one or more parameters referencing the first ad, a second, child ad may be selected and delivered to the requesting entity.05-06-2010