Patents by Inventor Rushan Chen
Rushan Chen has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20140004960Abstract: Methods, systems, and apparatus for player match-making in a gaming system are described. A search request comprising one or more attributes of one or more players of the online social game may be received. One or more attributes of one or more players of an online social game may be determined. One or more players of the online social game with attributes corresponding to the search request may be identified and a recommendation for at least one matching player may be generated.Type: ApplicationFiled: June 27, 2013Publication date: January 2, 2014Inventors: Dheeraj Soti, Daniel McCaffrey, Rushan Chen, Vishal R. Kapoor
-
Publication number: 20130339473Abstract: Real time analytics via stream processing is described. A stream reader receives a stream of messages and batches the messages in a message queue. A stream writer accesses the messages from the message queue, aggregates the messages from a time window based on a hierarchy of an attribute to generate a set of event data for the time window, stores the set of event data in a memory cache cluster, and stores a key corresponding to the set of event data in a key buffer queue. A stream aggregator accesses the key from the key buffer queue, retrieves the set of data in the time window corresponding to the key from the memory cache cluster, and performs a process on the retrieved set of data.Type: ApplicationFiled: March 14, 2013Publication date: December 19, 2013Applicant: Zynga Inc.Inventors: Daniel McCaffrey, Michael Fan, Rushan Chen
-
Patent number: 8086645Abstract: Techniques are provided for executing query statements, or portions thereof, in parallel without using slave SQL to communicate to each slave the operations to be performed by the slave. Instead of generating one cursor for the query coordinator (QC) based on the original statement, and separate cursors for each DFO based on the slave SQL, the techniques involve sharing the cursor that is generated from the original statement among the various participants involved in the parallel execution of the operations specified in the original statement.Type: GrantFiled: April 13, 2004Date of Patent: December 27, 2011Assignee: Oracle International CorporationInventors: Bhaskar Ghosh, Thierry Cruanes, Benoit Dageville, Rushan Chen
-
Patent number: 7958160Abstract: Techniques are provided for generating execution plans for, and executing, database statements that contain filter subqueries. Upon receiving a database statement that contains a filter subquery, the database server builds an execution plan that includes a filter operation that is fed by a subtree that corresponds to the subquery. The database server performs a cost analysis to determine whether (1) the filter operation should be parallelized, and (2) the subquery tree should be parallelized. Techniques are also described for generating plans and executing queries where (1) both the filter operation and the subquery subtree are parallelized, (2) the filter operation is parallelized but the subquery subtree operation is performed serially, and (3) the filter operation is performed serially but the subquery subtree operation is parallelized.Type: GrantFiled: May 6, 2004Date of Patent: June 7, 2011Assignee: Oracle International CorporationInventors: Bhaskar Ghosh, Thierry Cruanes, Rushan Chen, Shrikanth Shankar
-
Patent number: 7779008Abstract: Techniques are provided for performing a parallel aggregation operation on data that resides in a container, such as a relational table. During generation of the execution plan for the operation, it is determined whether partition-wise aggregation should be performed, based on the grouping keys involved in the aggregation and the partition keys used to partition the container. If partition-wise aggregation is to be performed, then the assignments given to the slave processes that are assigned to scan a container are made on a partition-wise basis. The scan slaves themselves may perform full or partial aggregation (depending on whether they are the only scan slaves assigned to the partition). If the scan slaves perform no aggregation, or only partial aggregation, then the scan slaves redistribute the data items to aggregation slaves that are local to the scan slaves.Type: GrantFiled: February 16, 2005Date of Patent: August 17, 2010Assignee: Oracle International CorporationInventors: Benoit Dageville, Bhaskar Ghosh, Rushan Chen, Thierry Cruanes, Mohamed Zait
-
Patent number: 7203676Abstract: A query coordinator handles a multiple-server dynamic performance query by sending remote query slaves (1) first information for generating a complete plan for the query, and (2) second information for participating in the dynamic performance view portion of the query. If the slaves on the remote servers are unable to use the first information to generate an equivalent query (for example, if they reside in a database server that has closed the database), then the slaves on the remote servers use the second information to participate in the dynamic performance view portion of the query.Type: GrantFiled: July 23, 2004Date of Patent: April 10, 2007Assignee: Oracle International CorporationInventors: Rushan Chen, Bhaskar Ghosh, Thierry Cruanes, Patrick A. Amor, Benoit Dageville
-
Publication number: 20060182046Abstract: Techniques are provided for performing a parallel aggregation operation on data that resides in a container, such as a relational table. During generation of the execution plan for the operation, it is determined whether partition-wise aggregation should be performed, based on the grouping keys involved in the aggregation and the partition keys used to partition the container. If partition-wise aggregation is to be performed, then the assignments given to the slave processes that are assigned to scan a container are made on a partition-wise basis. The scan slaves themselves may perform full or partial aggregation (depending on whether they are the only scan slaves assigned to the partition). If the scan slaves perform no aggregation, or only partial aggregation, then the scan slaves redistribute the data items to aggregation slaves that are local to the scan slaves.Type: ApplicationFiled: February 16, 2005Publication date: August 17, 2006Inventors: Benoit Dageville, Bhaskar Ghosh, Rushan Chen, Thierry Cruanes, Mohamed Zait
-
Patent number: 7089356Abstract: A method is described for parallel processing of sequence operations, in which contention for the sequence operation is reduced among multiple parallel processes. Contention is reduced by caching sequence values locally for each parallel process. Each process accesses the sequence operation, or an instance level cache of sequence values, in a batched manner, thereby returning a block of unique sequence values instead of a single sequence value. The block of sequence values, or at least information that indicates a range of sequence values that define the block, is then cached locally in association with a given process of the multiple processes. Hence, future requests for sequence values from the given process are serviced from the local cache, rather than having to access the sequence operation and risk contention for the operation with other processes.Type: GrantFiled: November 21, 2002Date of Patent: August 8, 2006Assignee: Oracle International CorporationInventors: Rushan Chen, Bhaskar Ghosh
-
Publication number: 20050131877Abstract: Techniques are provided for generating execution plans for, and executing, database statements that contain filter subqueries. Upon receiving a database statement that contains a filter subquery, the database server builds an execution plan that includes a filter operation that is fed by a subtree that corresponds to the subquery. The database server performs a cost analysis to determine whether (1) the filter operation should be parallelized, and (2) the subquery tree should be parallelized. Techniques are also described for generating plans and executing queries where (1) both the filter operation and the subquery subtree are parallelized, (2) the filter operation is parallelized but the subquery subtree operation is performed serially, and (3) the filter operation is performed serially but the subquery subtree operation is parallelized.Type: ApplicationFiled: May 6, 2004Publication date: June 16, 2005Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Bhaskar Ghosh, Thierry Cruanes, Rushan Chen, Shrikanth Shankar
-
Publication number: 20050131878Abstract: A query coordinator handles a multiple-server dynamic performance query by sending remote query slaves (1) first information for generating a complete plan for the query, and (2) second information for participating in the dynamic performance view portion of the query. If the slaves on the remote servers are unable to use the first information to generate an equivalent query (for example, if they reside in a database server that has closed the database), then the slaves on the remote servers use the second information to participate in the dynamic performance view portion of the query.Type: ApplicationFiled: July 23, 2004Publication date: June 16, 2005Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Rushan Chen, Bhaskar Ghosh, Thierry Cruanes, Patrick Amor, Benoit Dageville
-
Publication number: 20050132383Abstract: Techniques are provided for executing query statements, or portions thereof, in parallel without using slave SQL to communicate to each slave the operations to be performed by the slave. Instead of generating one cursor for the query coordinator (QC) based on the original statement, and separate cursors for each DFO based on the slave SQL, the techniques involve sharing the cursor that is generated from the original statement among the various participants involved in the parallel execution of the operations specified in the original statement.Type: ApplicationFiled: April 13, 2004Publication date: June 16, 2005Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Bhaskar Ghosh, Thierry Cruanes, Benoit Dageville, Rushan Chen