Anupam Vijay Singh, 50San Francisco, CA

7979422, Jul 12, 2011

Jul 30, 2008

12/221131

Peter Belknap - Redwood City CA, US
Khaled Yagoub - Newark CA, US
Karl Dias - Foster City CA, US
Benoit Dageville - Foster City CA, US
Thierry Cruanes - Foster City CA, US
Anupam Singh - San Jose CA, US

Oracle International Corp. - Redwood Shores CA

G06F 17/30

707713

Systems, methods, and other embodiments associated with hybrid optimization strategies in automatic SQL tuning are described. One example method includes receiving a first (e. g. , cost-based) execution plan for a user structured query language statement (User SQL) from a first (e. g. , cost-based) optimizer. The example method may also include receiving a second (e. g. , rules-based) execution plan for the User SQL from a second, different (e. g. , rules-based) query optimizer. The method may include identifying a preferred execution plan based on data produced by test executing the execution plans in a reproduced execution environment that reproduces at least a portion of an execution environment in which the user SQL runs. The method may also include controlling a database to execute the User SQL using the preferred execution plan.

8090974, Jan 3, 2012

Feb 6, 2009

12/366958

Parveen Jain - San Jose CA, US
Satya Ramachandran - Fremont CA, US
Sushil Thomas - San Francisco CA, US
Anupam Singh - San Jose CA, US

Joviandata, Inc. - San Jose CA

G06F 11/00

714 3, 714 39, 714 21, 714 3813, 714 472

A computer readable storage medium with executable instructions specifies the execution of a state machine operating across a set of computing nodes in a distributed computing system. The executable instructions execute a set of operators, where the execution of each operator is under the control of a state machine that periodically invokes pause control states to pause the execution of an operator in response to a violation of a service level agreement specifying an operating condition threshold within the distributed computing system. Partitions of input data are formed that are worked on independently within the distributed computing system. A set of data batches associated with the input data is processed. Data partition control states to process the partitions associated with the set of data batches are specified. Key control states to process a set of keys associated with a data partition of the partitions are defined.

8200741, Jun 12, 2012

Feb 6, 2009

12/366937

Parveen Jain - San Jose CA, US
Satya Ramachandran - Fremont CA, US
Sushil Thomas - San Francisco CA, US
Anupam Singh - San Jose CA, US

Joviandata, Inc. - San Jose CA

G06F 15/16
G06F 9/44

709201, 717127

A distributed computing system includes a memory storing execution state collected prior to an operator pause state. A controller modifies, during the operator pause state, characteristics of the distributed computing system. The controller invokes execution of the operator after the pause state such that the operator accesses the execution state to complete an operation.

8290977, Oct 16, 2012

Oct 21, 2004

10/904055

Gajanan S. Chinchwadkar - Fremont CA, US
Anupam Singh - Dublin CA, US
Srikanth Sampath - Fremont CA, US
Phil Shaw - Huntington Beach CA, US

Sybase Inc. - Dublin CA

G06F 7/00

707778

A database system providing methodology for execution of functions in queries requesting data from markup language documents is described. In one embodiment, for example, a method is described for executing a function in a query requesting data from a markup language document stored in a database, the markup language document organized hierarchically into nodes, the method comprises steps of: receiving the query requesting data from the markup language document, the query including a function to be executed during execution of the query; determining nodes of the markup language document satisfying the query; deriving values of the nodes of the markup language document; and executing the function with the derived values and the nodes of the markup language document.

8352775, Jan 8, 2013

Dec 9, 2011

13/315500

Parveen Jain - San Jose CA, US
Satya Ramachandran - Fremont CA, US
Sushil Thomas - San Francisco CA, US
Anupam Singh - San Jose CA, US

Joviandata, Inc. - San Jose CA

G06F 11/00

714 3, 714 42, 714 39, 714 3813

A computer readable storage medium with executable instructions specifies the execution of a state machine operating across a set of computing nodes in a distributed computing system. The executable instructions execute a set of operators, where the execution of each operator is under the control of a state machine that periodically invokes pause control states to pause the execution of an operator in response to a violation of a service level agreement specifying an operating condition threshold within the distributed computing system. Partitions of input data are formed that are worked on independently within the distributed computing system. A set of data batches associated with the input data is processed. Data partition control states to process the partitions associated with the set of data batches are specified. Key control states to process a set of keys associated with a data partition of the partitions are defined.

2003010, May 29, 2003

Jan 30, 2002

10/066134

Vadiraja Bhatt - Alameda CA, US
Srikanth Sampath - Danville CA, US
Anupam Singh - Alameda CA, US
Raghavan Eachampadi - Pleasanton CA, US

Sybase, Inc.

G06F007/00

707/003000

A system providing methods enabling data in Extensible Markup Language (“XML”) format to be extracted, transformed and stored in a database, file system or main memory is described. The extraction and transformation process is generalized and can be used on various types of XML data, enabling XML data to be stored and queried using standard database query methodologies. The system includes parse-time functionality to transform XML documents into a structure having an interface that enables efficient access to the underlying data. The system also includes query execution-time functionality providing greater efficiency by bringing only the relevant portions of transformed XML data into memory in response to a query. The system parses and translates queries into a structure that can be executed without the need to write custom application-specific navigation code to search XML data. The system also enables original XML documents (or portions thereof) to be recomposed when required.

2013003, Feb 7, 2013

Aug 5, 2011

13/204585

David Cavander - Los Angeles CA, US
Dominique Hanssens - Santa Monica CA, US
Satya Ramachandran - Fremont CA, US
Anupam Singh - San Jose CA, US
Amit Paunikar - Los Angeles CA, US
Jon Vein - Los Angeles CA, US
Wes Nichols - Pacific Palisades CA, US
Peter Kamvysselis - Santa Monica CA, US

G06Q 10/06

705 722

A software facility that analyzes consumer interactions with one or more marketing campaigns and the results of those interactions to generate a cross-media or cross-channel attribution model representing the true impact of marketing resource allocation decisions is provided. The facility collects, from a plurality of sources, information representing consumer interactions with marketing campaigns and any results of those interactions. The facility aggregates the information to assess or determine the behavior of consumers with respect to different marketing campaigns and marketing channels. The facility analyzes the information according to varying depths or levels of channel granularity to generate models representative of the true impact of resources allocated to each channel or sub-channel on the performance or effectiveness of the marketing campaign. The facility or other processes may use the generated models to inform future marketing resource allocation decisions.

2020025, Aug 6, 2020

Mar 20, 2020

16/826113

- Palo Alto CA, US
Anupam Singh - Palo Alto CA, US
Prithviraj Pandian - Palo Alto CA, US

G06F 16/248
G06F 16/2455
G06F 16/28
G06F 16/21
G06F 16/84

Systems and methods very fast grouping of “similar” SQL queries according to user-supplied similarity criteria are disclosed. The user-supplied similarity criteria includes a threshold quantifying the degree of similarity between SQL queries and common artifacts included in the queries. A similarity-characterizing data structure is disclosed that allows for the very fast grouping of “similar” SQL queries. Because the computation is distributed among multiple compute nodes, a small cluster of compute nodes takes a short time to compute the similarity-characterizing data on a workload of tens of millions of queries. The user can supply the similarity criteria through a UI or a command line tool. Furthermore, in some embodiments, the user can adjust the degree of similarity by supplying new similarity criteria. Accordingly, the system can display in real time or near real time, updated SQL groupings corresponding to the newly supplied similarity criteria using the originally computed similarity-characterizing data structure.