Yahoo! Inc.

Oracle International Corporation

Gradiance Corporation

Ramana Yerneni

Brian Frank Cooper

Utkarsh Srivastava

Wei Ming Hu

Yunrui Li

Vinay H Srihari

Philip Lewis Bohannon

Daniel E Weaver

Adam Silberstein

Raghu Ramakrishnan

Michael David Bigby

Juan R Loaiza

Erik Nathan Vee

Andrew Feng

Sihem Amer-Yahia

Cong Yu

Bryan Call

David Lomax

Jeffrey D Ullman

Alban Galland

Saurabh Sodani

Jayanth Anandaram

Each of a plurality of Worker processes are allowed to perform any and all of the following tasks involving logged work items: (1) reading a subset of the work items from a log; (2) sequentially ordering work items for corresponding data objects; (3) applying a sequentially ordered set of work items to a corresponding data object; and (4) transmitting a subset of work items to a Worker process running on another database server in a cluster, if necessary. These tasks can be performed concurrently, at will, and as available, by the Worker processes. An improved checkpointing technique eliminates the need for the Worker processes to get to a synchronization point and stop. Instead, a Coordinator process examines the current state of progress of the Worker processes and computes a past point in the sequence of work items at which all work items before that point have been completely processed, and records this point as the checkpoint.

High-performance log-based processing

High performance log-based parallel processing of logs of work items representing operations on data objects

Methods and systems are provided for providing recommendations to users of a computer-based network of items of potential interest to the users. Items and people of potential interest to users may be determined using obtained word-based social behavior information, semantically-sensitive vocabulary taxonomies, and determined implied topic-specific social networks. The user may be presented with a graphical user interface including the recommendation, an explanation of the rationale relating to the recommendation, and an opportunity for the user to provide feedback relating to the recommendation or the rationale. The feedback may be used to improve future recommendations.

Recommendation system using social behavior analysis and vocabulary taxonomies

A method of processing a supply query is described. The method includes receiving a first supply query comprising a first set of attributes. A size of the first set of attributes is compared to a threshold value. A second supply query comprising a second set of attributes is generated when the comparison indicates that the size of the first set of attributes is greater than the threshold value.

System for processing complex queries

In a large-scale transaction such as the bulk loading of new records into an ordered, distributed database, a transaction limit such as an insert limit may be chosen, partitions on overfull storage servers may be designated to be moved to underfull storage servers, and the move assignments may be based, at least in part on the degree to which a storage server is underfull and the move and insertion costs of the partitions to be moved.

System and/or method for bulk loading of records into an ordered distributed database

An improved system and method for loading records into a partitioned database table is provided. A translation of records may be generated from a set of source partitions to a set of target partitions by generating a bipartite graph, determining a maximal matching using dynamic programming for a chain of nodes remaining in the bipartite graph after removing singleton edges, and generating a maximal matching after adding back the singleton edges for translation of records from the set of source partitions to the set of target partitions. The partition translation may be executed by traversing from top to bottom the set of source partitions and the set of target partitions in record key order to generate an optimal sequence of operations to transfer the records from the set of source partitions to the set of target partitions.

System and method for loading records into a partitioned database table

Methods and apparatuses are provided for dynamically reorganizing the data within a replicated database system. One method, for example, includes performing a split operation across a plurality of replicated databases with regard to an existing partition therein, wherein the existing partition comprises a plurality of data records and the two new partitions each include at least a portion of the plurality of data records, and allowing at least one type of access to the plurality of data records during the split operation.

Dynamic data reorganization to accommodate growth across replicated databases

An improved system and method for writing data dependent upon multiple reads in a distributed database is provided. A client may read several data records and may then send a request to a database server to perform a transaction to write a data record dependent upon multiple data records read. A database server may receive the request specifying a transaction to write a data record dependent upon multiple data records read and may perform the transaction by latching a master data record to be written and validating the data records the write depends upon. The multiple data records upon which the write depends may be validated by verifying the multiple data records are current versions of the data records stored in the distributed database. Data intensive applications may use this transaction type in large scale distributed database systems to provide stronger consistency without significantly degrading performance and scalability.

System and method for writing data dependent upon multiple reads in a distributed database

A technique is described that reduces the complexity and resource consumption associated with performing record expiry in a distributed database system. In accordance with the technique, a record is checked to see if it has expired only when it has been accessed for a read or a write. If at the time of a read a record is determined to have expired, then it is not served. If at the time of a write a record is determined to have expired, then the write is treated as an insertion of a new record, and steps are taken to treat the insertion consistently with regard to the previous expired version. A background process is used to delete records that have not been written to or actively deleted by a client after expiration.

Decentralized record expiry

Disclosed are methods, systems, and mediums for improving system utilization and throughput. In some embodiments, application requests received at a primary site are routed to a secondary site for processing when the requests are found to be suitable for processing at the secondary site.

Method and mechanism of improving system utilization and throughput

A system and method for generating and administering classroom exercises to a student. One or more root questions is generated, where each root question has a stem, a plurality of right answers, and a plurality of wrong answers. A multiple-choice question instance is created by combining the stem with a set of answer choices that are created from one of the right answers and one or more of the wrong answers. The questions are administered to a student. Preferably, the sets of questions based on the same root questions are administered one or more times to the student&#x2014;e.g., a student may be required to work three sets of question instances based on the same set of root questions, or may be required to continue working new sets of question instances until all of the questions in one set are answered correctly.

Growing community of inventors

Cupertino, CA, United States of America

Ramana Yerneni