International Business Machines Corporation

Google Inc.

Anant Deep Jhingran

Hui-I Hsiao

Chung-Sheng Li

Sriram Kolinjivadi Padmanabhan

Sridhar Rajagopalan

Vittorio R Castelli

Manoj N Kumar

Manish Satyapal Gupta

John Richard Smith

Chandrasekaran Mohan

Ronald Mraz

Yuan-Chi Chang

Daniel Manuel Dias

Lawrence David Bergman

George Prentice Copeland

Timothy Ray Malkemus

John Timothy Robinson

Richard Pervin King

Joy Aloysius Thomas

David Mun-Hien Choy

Mitchell Adam Cohen

Jy-Jine James Lin

Jagdish Chand

Ambuj Goyal

Gene Y C Fuh

Lubor J Kollar

Amy Chang

Anupam K Bhide

Robin Williams

Christos Alkiviadis Polyzois

Walter Gene Wilson

Krishna Kumar Kesavan

Karthikeyan Seetharaman

Rupesh Kumar

Sanjoy Bose

Mukundha Madhavan Gnana Sekaran

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for controlling access to APIs. One of the methods includes receiving a request from a client for a computer authorization challenge to access an application programming interface; determining a computer authorization challenge with a difficulty of completion that satisfies a target computational cost for the application programming interface; and providing the computer authorization challenge to the client for access to the application programming interface.

Application programming interface access controls

Automatically extracting profile feature attribute data from event data is disclosed, including: receiving a set of event data; receiving a feature associated with a profiling technique; determining that a plurality of events associated with a user in the set of event data corresponds to a first attribute corresponding to the feature, wherein the first attribute corresponds to a first bin having a first defined value; determining that the plurality of events associated with the user in the set of event data corresponds to a second attribute corresponding to the feature, wherein the second attribute corresponds to a second bin having a second defined value; and creating a user record corresponding to the user indicating presence in the first bin and the second bin.

Automatically extracting profile feature attribute data from event data

A computer-implemented database system, method, and computer program product are provided. the database system comprises a plurality of nodes, each node including a data storage device having memory and a server; and a database system controller coupled to each of the plurality of nodes and having a processor and software program code for directing the database system to perform the following function of defining, for a user, a node group including at least one of the plurality of nodes, upon which the user's data is to be stored in a user database; wherein the user database is defined in terms of time-partitioned tables residing on the nodes of the node group, and wherein each time-partitioned table is further defined in terms of shards of the user's data, the shards corresponding with respective ones of the time partitions. The user data is managed in terms of the shards on respective nodes of the node group, and the time-partitioned tables include a chronologically oldest time-partitioned table and a current time-partitioned table into which a new user data entry will be written. The system further performs the functions of determining whether a predetermined criterion has been met; and, responsive to the detecting that the predetermined criterion has been met, purging all shards of the chronologically oldest time-partitioned table.

Method and system for designing a database system for high event rate, while maintaining predictable query performance

A method and apparatus for generating bids for bidding agents in an auction. Bids are sorted by decreasing bid amount for regular bids and upper limit for order bids to form a sorted set of bids, wherein each bid includes a quantity and wherein the bids include order bids. A first bid is identified requesting a quantity in which an unallocatable portion is present. A number of order bids is selected from the bids, wherein the number of order bids are higher in the sorted set of bids than the first bid and have an allocation requirement less than the unallocatable portion of the of the first bid. A price is set for the order bids higher than the first bid and not in the aforementioned selected bids.

Handling order (proxy) bids in an on-line auction

A task schedule is enforced among multiple processes by setting process priorities based upon which tasks are running on which processes and based upon the task schedule. The task scheduling may be provided by a local or global scheduler which uses application information to prioritize tasks. The task schedule, or priority list, is provided at Local Activity Schedulers which schedule the activities for their local execution elements/nodes. Execution of activities locally are performed by any number of processes that reside in each execution element. These processes are assigned operating system priorities by the respective Local Activity Scheduler based on their assigned activities for execution and the task schedule.

System and method for maximizing usage of computer resources in scheduling of application tasks

Methods and apparatus for providing a multi-tier object-relational database architecture are disclosed. In one illustrative embodiment of the present invention, a multi-tier database architecture comprises an object-relational database engine as a top tier, one or more domain-specific extension modules as a bottom tier, and one or more universal extension modules as a middle tier. The individual extension modules of the bottom tier operationally connect with the one or more universal extension modules which, themselves, operationally connect with the database engine. The domain-specific extension modules preferably provide such functions as search, index, and retrieval services of images, video, audio, time series, web pages, text, XML, spatial data, etc. The domain-specific extension modules may include one or more IBM DB2 extenders, Oracle data cartridges and/or Informix datablades, although other domain-specific extension modules may be used.

Methods and apparatus for constructing and implementing a universal extension module for processing objects in a database

An apparatus and method for approximating the data stored in a databases by generating multiple projections and representations from the database such that the OLAP queries for the original database (such as aggregation and histogram operations) may be applied to the approximated version of the database, which can be much smaller than the original databases. Other aspects optimize a mapping, via a mapping (or dimension) table, of non-numeric or numeric attributes to other numeric attributes such that the error incurred on applying queries to the approximated version of the database is minimized. Still further aspects define boundaries of approximations so that the boundaries are preserved when approximated versions of the databases are generated.

System and method for generating multi-representations of a data cube

A method and system for recovering from a failure of a processing node in a partitioned shared nothing database processing system are provided. The processing system may include a pair of processing nodes having twin-tailed-connected thereto a storage device. A first processing node of the pair of processing nodes has a first database instance running thereon which accesses a first data partition on the storage device prior to the failure. Upon detection of the failure, access to the first data partition on the storage device is provided to a third, spare processing node through the second processing node of the pair of processing nodes. The third processing node runs a replacement database instance for the first database instance which was running on the first processing node prior to the failure thereof. The replacement database instance accesses the first data partition on the storage device through the second processing node, thereby recovering from the failure of the first processing node. Access to the first data partition may include using a virtual shared disk utility having a server portion on the second processing node and a client portion on the third processing node.

Method and system for recovery in a partitioned shared nothing database

A method for localizing execution of subqueries and determining collocation of execution of subqueries in a shared-nothing database. The concept of compatible partitioning is used to localize database operations in order to eliminate excess processes and communication, and thereby improve response time and throughput for the database management system. The method reduces the number of process by reducing the number of nodes involved in processing a query and by combining multiple processes.

Method for localizing execution of subqueries and determining

In a system having producer and consumer processes, a producing process look ahead in its outgoing data stream to ensure that there is data available to consumers on all outgoing streams. The producer looks ahead by keeping a data array in its memory space with an entry for each connected consumer. When the outgoing data stream becomes blocked, the producer searches the array for empty connections. Then, the producer scans the outgoing data stream for messages to send over the empty connections and sends such messages. Periodically, the producer checks the original connection to see if the blocking condition has ended.

Method and system for avoiding blocking in a data processing system

In a partitioned database system of the Shared Nothing type, one or more secondary replicas of each partition are maintained by spooling (i.e., asynchronously sending) modified (usually called dirty) pages from the primary replica to the secondary replica(s) rather than by using a synchronous page update or by sending log entries instead of entire pages. A Write-Ahead Log protocol is used so that a dirty page is not forced to non-volatile storage until a log record of the modification is created and written to non-volatile storage. Replica updating does not delay the committing of transactions because replica updating is done asynchronously with respect to transaction processing. Since dirty pages are sent rather than only log entries, disk accesses and processing at the secondary replica(s) arising from the maintaining of the replicas are minimized as well. Only one centrally accessible log is maintained for all replicas of the same partition.

Asynchronous replica management in shared nothing architectures

Growing community of inventors

San Jose, CA, United States of America

Anant Deep Jhingran