Search

Bipul Sinha

from San Mateo, CA
Get Report
Connected to:
Aakash Sinha, 50Agam N Sinha, 77Amritanshu Sinha, 46Anamika Sinha, 52Anil K Sinha, 82Anindya Sinha, 49Anirban Sinha, 38Aprajita Sinha, 40Ashwin Sinha, 32Atish P Sinha, 66

Bipul Sinha Phones & Addresses

  • San Mateo, CA
  • San Francisco, CA
  • Emeryville, CA
  • Boston, MA
  • 280 Loon Ct, Foster City, CA 94404

Work

Position: Professional/Technical

Education

Degree: Graduate or professional degree

Resumes

Resumes

Bipul Sinha Photo 1

Senior Product Manager

View page
Location:
San Francisco, CA
Industry:
Internet
Work:
Twitch
Senior Product Manager
Amazon Web Services Jun 2017 - Jul 2018
Senior Product Manager
Quantcast Jun 2016 - Aug 2016
Product Management Intern
Carousell May 2015 - Jul 2015
Summer Intern
Inmobi Oct 2013 - Apr 2015
Manager, Strategy and Operations
Education:
Harvard Business School 2015 - 2017
Master of Business Administration, Masters Indian Institute of Technology, Delhi 2007 - 2011
Bachelors, Bachelor of Technology, Chemical Engineering Imt Mines Albi 2009 - 2009
Army Public School, Pune 2007
The Army Public School 2005 - 2007
Hutchings High School Pune 2000 - 2005
Indian Institute of Technology Delhi
Interests:
Catia
Languages:
French
Bipul Sinha Photo 2

Co-Founder And Chief Executive Officer

View page
Location:
Palo Alto, CA
Industry:
Computer Software
Work:
Lightspeed Venture Partners since 2010
Partner
Nutanix since 2009
Founding Investor and Board Member
PernixData since 2012
Founding Investor and Board Member
Stealth Small Data NewCo since 2012
Founding Investor and Board Member
Bromium since 2011
Founding Venture Investor
Education:
University of Pennsylvania - The Wharton School
MBA Indian Institute of Technology, Kharagpur
B.Tech (Hons.), Electrical Engineering
Skills:
Venture Capital
Start Ups
Cloud Computing
Strategic Partnerships
Mergers and Acquisitions
Mobile Devices
Enterprise Software
Product Management
Entrepreneurship
Saas
Distributed Systems
Strategy
Leadership
Product Marketing
Go To Market Strategy
Data Center
Business Development
Big Data
E Commerce
Mergers
Program Management
Competitive Analysis
Cross Functional Team Leadership
Mobile Applications
Business Strategy
Professional Services
Investment Banking
Analytics
Business Intelligence
Business Planning
Investments
Scalability
Crm
Executive Management
Business Alliances
Financial Modeling
Paas
Market Analysis
Business Modeling
Management Consulting
Partner Management
Corporate Development
Angel Investing
Private Equity
Monetization
Mobile Technology
M&A Experience
Global Business Development
Venture Financing
Thought Leadership
Interests:
Saas
Data Center Automation
Digital Media
Social Media
Internet
Consumer Internet
Enterprise Software
Bipul Sinha Photo 3

Senior Product Manager

View page
Location:
San Francisco, CA
Work:

Senior Product Manager
Education:
Harvard Business School
Master of Business Administration, Masters

Business Records

Name / Title
Company / Classification
Phones & Addresses
Bipul Sinha
Director
Pernixdata, Inc
Custom Computer Programing · Nonclassifiable Establishments
1731 Technology Dr, San Jose, CA 95110
1735 N 1 St, San Jose, CA 95112

Publications

Us Patents

Method And Apparatus For Accessing Data As It Existed At A Previous Point In Time

View page
US Patent:
6983286, Jan 3, 2006
Filed:
Dec 18, 2002
Appl. No.:
10/325211
Inventors:
Bipul Sinha - Foster City CA, US
Namit Jain - Foster City CA, US
Amit Ganesh - San Jose CA, US
Archna Kalra Johnson - Sunnyvale CA, US
Srinivas Vemuri - Foster City CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 17/30
US Classification:
707102
Abstract:
Techniques are provided for sharing of flashback cursors by adding a time domain property to flashback cursors. This time domain property defines the range of flashback times for which the flashback cursor is valid. According to one embodiment, this “validity range” is closed at the lower bound and open at the upper bound. A subsequent flashback query can share an existing flashback cursor if the flashback time of the subsequent flashback query falls within the validity range of the existing flashback cursor. In one embodiment, the validity range of a flashback cursor is established based on times associated with indexes used to process the flashback query for which the flashback cursor was made. Consequently, an existing flashback cursor is less likely to be used by a subsequent flashback query when it would be inefficient to do so.

Providing Mappings Between Logical Time Values And Real Time Values

View page
US Patent:
7240065, Jul 3, 2007
Filed:
May 27, 2004
Appl. No.:
10/856569
Inventors:
Wanli Yang - San Mateo CA, US
Bipul Sinha - Foster City CA, US
Amit Ganesh - San Jose CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 17/00
G06F 7/00
US Classification:
707100, 707201
Abstract:
Techniques are provided for providing mappings between logical time values and real time values for a database. The techniques include, if a first event related to the database occurs, writing an entry of a current LTV and a current RTV in a volatile mapping data structure; and if a second event related to the database occurs, writing one or more entries in a non-volatile mapping data structure based on information contained in the volatile mapping data structure. The techniques also include, once a request from a requestor to provide an LTV that is mapped to a particular RTV is received, determining the LTV for the particular RTV, based on the particular RTV and information from a source, wherein the source is one of the volatile mapping data structure and the non-volatile mapping data structure; and providing the LTV that is mapped to the particular RTV to the requestor.

Providing Mappings Between Logical Time Values And Real Time Values In A Multinode System

View page
US Patent:
7251660, Jul 31, 2007
Filed:
Jun 10, 2004
Appl. No.:
10/866234
Inventors:
Wanli Yang - San Mateo CA, US
Bipul Sinha - Foster City CA, US
Amit Ganesh - San Jose CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 17/00
G06F 7/00
US Classification:
707100, 707201
Abstract:
Techniques are provided for providing mappings between logical time values and real time values in a multinode system. The techniques include, if a first event occurs, then writing an LTV-to-RTV mapping to a non-volatile data structure. If a second event occurs, then a check is performed to determine whether any of the LTV-to-RTV mappings in the volatile data structure are newer than all LTV-to-RTV mappings in a non-volatile data structure. If there are newer mappings in the volatile data structure, then one or more LTV-to-RTV mappings are written to the non-volatile data structure based on those “newer” LTV-to-RTV mappings from the volatile data structure. Upon receiving a request an LTV for a particular RTV, the particular RTV is determined based on information from an information source such as the volatile data structure or the non-volatile data structure.

Deferred Piggybacked Messaging Mechanism For Session Reuse

View page
US Patent:
7346690, Mar 18, 2008
Filed:
May 30, 2002
Appl. No.:
10/160128
Inventors:
Bipul Sinha - Foster City CA, US
Amit Ganesh - San Jose CA, US
Lakshminarayanan Chidambaran - Fremont CA, US
Assignee:
Oracle International Corporation - Redwood Shores
International Classification:
G06F 15/16
G06F 7/00
US Classification:
709227, 707 10, 707101
Abstract:
Described herein is a session reuse approach that reuses a session already established on a remote participant to execute an autonomous transaction. The session is reused in a manner that avoids affecting the session's state in a way adverse to later execution of the containing transaction. When beginning an autonomous transaction on a local participant, a request to initiate an autonomous transaction on a remote participant is deferred or not sent at all if the containing transaction is a distributed one. The request may be sent later, piggybacked to another message, using a piggyback messaging system. When ending an autonomous transaction, a local participant may send a request to a remote participant requesting that the remote participant commence execution of its respective containing transaction. The request is piggybacked to another message, and is thus transmitted without having to transmit the request separately, avoiding a message round trip.

Two-Phase Commit With Queryable Caches

View page
US Patent:
7401084, Jul 15, 2008
Filed:
Jun 14, 2001
Appl. No.:
09/881505
Inventors:
Bipul Binit Sinha - Foster City CA, US
Amit Ganesh - San Jose CA, US
Lakshminarayanan Chidambaran - Fremont CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 17/30
US Classification:
707 10
Abstract:
An optimization of the two-phase commit protocol employed in distributed systems. Each cohort component of the distributed system augments messages that are accessible to the coordinator component with state information indicating whether the cohort is read-only with regard to a transaction that the coordinator is coordinating. The coordinator retains the most recent state information. The coordinator reads the retained state information for the cohorts and when the transaction terminates, the coordinator reads the retained state information. Where the cohort's state is read-only, the coordinator simply sends an abort message instead of performing the full two-phase commit protocol with regard to the read-only cohort. In the trees of distributed system components that are defined by transactions, any cohort which has children in the tree is a local coordinator for its children. The general technique of cohorts augmenting messages accessible to a coordinator with state information that is relevant to an action to be performed by the coordinator and the coordinator acting in accordance with state retained from the messages has other uses as well.

Guaranteed Undo Retention

View page
US Patent:
7437525, Oct 14, 2008
Filed:
Aug 17, 2004
Appl. No.:
10/920874
Inventors:
Wanli Yang - San Mateo CA, US
Bipul Sinha - Foster City CA, US
Amit Ganesh - San Jose CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 12/16
US Classification:
711162, 714 19, 707202
Abstract:
Techniques are provided for guaranteed undo retention. The techniques include a database server attempting to store undo information in undo storage. In order to store the undo information, the database server may overwrite expired undo records; write to empty undo extents; allocate new undo extents and write to the newly-allocated extents; or overwrite unexpired undo records that do not have guaranteed undo retention. If an undo record does not have guaranteed undo retention, then the undo record may be overwritten before the expiration time has elapsed. If no undo extent is empty or unallocated, and if all of the undo records are unexpired and have guaranteed undo retention, then the database system has, at least temporarily, run out of usable and reusable space and an error may be reported to an appropriate party.

Querying Past Versions Of Data In A Distributed Database

View page
US Patent:
7552149, Jun 23, 2009
Filed:
Jun 10, 2004
Appl. No.:
10/866333
Inventors:
Bipul Sinha - Foster City CA, US
Amit Ganesh - San Jose CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 17/30
US Classification:
707203, 707 1, 707 3, 707200, 707201, 711162
Abstract:
Past versions of data in a distributed database system comprising multiple databases and associated database servers are queried using temporal database access mechanisms, where a request for data in a past state from a “remote” database can be received at a “local” database server and relevant portions of the request are passed to the remote server for processing. The processing performed by the remote server includes returning the requested data in the specified past state to the local server, or at least with enough information to reconstruct the data into the past state.

Cross-Platform Transportable Database

View page
US Patent:
7571173, Aug 4, 2009
Filed:
Oct 15, 2004
Appl. No.:
10/966961
Inventors:
Wanli Yang - San Mateo CA, US
Bipul Sinha - Foster City CA, US
Amit Ganesh - San Jose CA, US
Wei Hu - Palo Alto CA, US
Alok Pareek - Brisbane CA, US
Alexander H. Hwang - Orinda CA, US
Steven Charles Wertheimer - Kentfield CA, US
Francisco M. Sanchez - San Carlos CA, US
Dmitry Mikhailovich Potapov - Emerald Hills CA, US
Juan R. Loaiza - Redwood City CA, US
William H. Bridge - Alameda CA, US
J. William Lee - Redwood Shores CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 7/00
US Classification:
707101
Abstract:
A method and apparatus for creating a target database on a target platform based on a source database on a source platform is provided. A target database is created on the target platform based on data, metadata (for example, data in the system tablespace and control files), and external objects (for example, password files and externally stored tables) comprised within the source database. Data and metadata stored in tablespaces of the source database are converted to the format compatible with the target platform. The conversion of the data and metadata may be performed either at the source database or the target database. Redo information and undo information of the source database are not copied from the source database to the target database. Certain files, e. g. , a password files, and links to externally stored object may be recreated on the target database.
Control profile
Bipul Sinha from San Mateo, CA Get Report