Sanjeev Gupta

US Patent:

6789096, Sep 7, 2004

Filed:

Jun 25, 2001

Appl. No.:

09/891818

Inventors:

Mohan Sankaran - Union City CA
Sanjeev K. Gupta - Sunnyvale CA
Sen Ma - San Jose CA

Assignee:

Informatica Corporation - Palo Alto CA

International Classification:

G06F 1730

US Classification:

707203, 707 10, 707 4, 707100, 707101, 707103

Abstract:

A method and system thereof for performing real time transformations of dynamically increasing databases is described. A session, identified as a real time session, is initialized. The real time session repeatedly executes a persistent (e. g. , continually running) data transport pipeline of the analytic application. The data transport pipeline extracts data from a changing database, transforms the data, and writes the transformed data to storage (e. g. , a data warehouse or data mart). The data transport pipeline is executed at the end of each time interval in a plurality of contiguous time intervals occurring during the real time session. The data transport pipeline remains running after it is executed, until the real time session is completed. Accordingly, new data are transformed in a timely manner, and processing resources are not consumed by having to repeatedly re-establish (re-initialize) the data transport pipeline.

US Patent:

7327752, Feb 5, 2008

Filed:

Sep 26, 2002

Appl. No.:

10/256525

Inventors:

Somnath Mitra - San Leandro CA, US
Sanjeev K. Gupta - Fremont CA, US

Assignee:

Cisco Technology, Inc. - San Jose CA

International Classification:

H04B 7/212
H04L 12/66

US Classification:

370442, 370241, 370352, 370503

Abstract:

Methods and apparatus for achieving universal cross connect for Time Domain Modulated (TDM) data between a first and second data streams each having a corresponding time slot assignment are disclosed. Cross connect may be achieved through the use of a time slot assignment table.

US Patent:

7669179, Feb 23, 2010

Filed:

Nov 4, 2003

Appl. No.:

10/700431

Inventors:

Sanjeev Gupta - San Jose CA, US
Ravi Shankar - Sunnyvale CA, US
Ajai Kapoor - Cupertino CA, US
Prakash Kumar Pati - San Jose CA, US
Corvin Bazgan - San Carlos CA, US
Subbarao Nimmakayala - Livermore CA, US

Assignee:

Realization Technologies, Inc. - San Jose CA

International Classification:

G06F 9/44

US Classification:

717101

Abstract:

A method on a computer for providing critical chain-based project management across a plurality of projects is disclosed. The method includes generating a plurality of plans, each of the plurality of plans corresponding to one of the plurality of projects, wherein a project comprises at least one task. The method further includes generating buffers for each of the plurality of projects and reconciling project resources among the plurality of projects. The method further includes executing the plurality of project plans, including allowing a user to manage the buffers across the plurality of projects. The user is further provided with information associated with buffers for the plurality of projects, so as to evaluate the status of the plurality of projects. Additionally, the user is provided with task prioritization for any task of the plurality of projects, wherein task prioritization is calculated across the plurality of projects.

US Patent:

7774742, Aug 10, 2010

Filed:

Jun 8, 2005

Appl. No.:

11/147479

Inventors:

Sanjeev Gupta - San Jose CA, US
Ajai Kapoor - San Jose CA, US
Ravi Shankar - San Jose CA, US
Prakash Pati - San Jose CA, US
Subramanian Muthu - Santa Clara CA, US
Anthony Hoang - Milpitas CA, US
Sridharan Chandrasekaran - San Jose CA, US

Assignee:

Realization Technologies, Inc. - San Jose CA

International Classification:

G06F 9/44

US Classification:

717101, 717102, 717103, 717100

Abstract:

A method on a computer for providing critical chain-based project management is disclosed. The method includes receiving at least one project plan for a project comprising a plurality of tasks and calculating a task priority for each of the plurality of tasks based on the at least one project plan. The method further includes receiving at least one sub-task for a first task of the plurality of tasks and assigning the at least one sub-task a task priority identical to the task priority of the first task. In one alternative, the method further includes receiving a new task priority for the first task, assigning the new task priority to the first task and assigning the new task priority to the at least one sub-task of the first task. The method may also include an interface to allow starting of sub-tasks only when the parent task is started.

US Patent:

7792784, Sep 7, 2010

Filed:

Jun 19, 2007

Appl. No.:

11/765277

Inventors:

Sanjeev Kumar Gupta - Sunnyvale CA, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 7/00
G06F 17/00

US Classification:

707602, 707606, 707610, 707957, 707E17056

Abstract:

A data warehouse comprises a multidimensional data storage area to store multidimensional data and a transactional data storage area to store underlying transactional data from which the multidimensional data is generated. The data warehouse also comprises a multidimensional query processor to provide one or more interfaces to issue a first set of queries conforming to one or more multidimensional query languages to retrieve the multidimensional data from the multidimensional data storage area. Furthermore, the data warehouse comprises a dynamic query engine to provide an additional interface to issue a second set of queries that bypass the interfaces provided by the multidimensional query processor to retrieve the transactional data from the transactional data storage area, wherein the second set of queries do not conform to any of the one or more multidimensional query languages.

US Patent:

7921405, Apr 5, 2011

Filed:

Sep 7, 2005

Appl. No.:

11/221447

Inventors:

Sanjeev Gupta - San Jose CA, US
Ajai Kapoor - San Jose CA, US
Ravi Shankar - San Jose CA, US
Corvin Bazgan - San Carlos CA, US
Anthony Hoang - Milpitas CA, US

Assignee:

Realization Technologies, Inc. - San Jose CA

International Classification:

G06F 9/44
G06F 9/46

US Classification:

717102, 717100, 717105, 705 8

Abstract:

A method on a computer for providing critical chain-based project management is disclosed. The method includes generating a list of sequential time periods for a project comprising a plurality of tasks and calculating a number of tasks for each time period. The method further includes generating a graphic that visually indicates the number of tasks for each time period and a priority of each task and providing the graphic to a user.

US Patent:

20120096425, Apr 19, 2012

Filed:

Oct 15, 2010

Appl. No.:

12/905122

Inventors:

Sanjeev K. Gupta - Santa Clara CA, US
Cleo X. Barretto - San Jose CA, US
Jasmeet Bhatia - San Jose CA, US
Rakesh R. Kamath - Santa Clara CA, US
Sukhwinder Singh - Pleasanton CA, US

Assignee:

CISCO TECHNOLOGY, INC. - San Jose CA

International Classification:

G06F 9/44
G06F 3/00

US Classification:

717101

Abstract:

In one embodiment a method is provided for rendering a software map. The method includes storing, in an electronic database, information associated with a software development project, the information including start and end dates of particular efforts made in connection with the software development project and dates of specific events associated with the software development project, rendering on a display a timeline, and rendering on the display a software map, wherein the software map includes horizontal lines representing the particular efforts that extend between endpoints defined, substantially, by the start and end dates, and that are aligned with a time scale of the timeline, and vertically or substantially vertical extending lines between and connecting pairs of horizontal lines, wherein each vertically or substantially vertically extending line represents one of the specific events associated with the software development project.

US Patent:

20130086116, Apr 4, 2013

Filed:

Oct 4, 2011

Appl. No.:

13/252465

Inventors:

Manoj K. Agarwal - Noida, IN
Himanshu Gupta - New Delhi, IN
Rajeev Gupta - Noida, IN
Sanjeev K. Gupta - Los Altos CA, US
Mukesh K. Mohania - Agra, IN
Sriram K. Padmanabhan - San Jose CA, US
Prasan Roy - Karnataka, IN

Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

International Classification:

G06F 7/00

US Classification:

707792, 707E17044

Abstract:

A method for receiving a declarative specification including a plurality of stages. Each stage specifies an atomic operation, a data input to the atomic operation, and a data output from the atomic operation. The data input is characterized by a data type. Links between at least two of the stages are generated to create a data integration workflow. The data integration workflow is compiled to generate computer code for execution on a parallel processing platform. The computer code configured to perform at least one of data preparation and data analysis.