Patents by Inventor Johannes E. Gehrke

Johannes E. Gehrke 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).

  • Semantic transactions in online applications
    Patent number: 8825743
    Abstract: A system and method for enabling distributed transaction processing by moving all application logic away from the server and into the client by using an optimistic concurrency control framework with client-side transaction validation including virtual full replication under a transactional programming model with full Atomicity, Consistency, Isolation, and Durability (ACID) properties.
    Type: Grant
    Filed: July 11, 2008
    Date of Patent: September 2, 2014
    Assignee: Cornell University
    Inventors: Johannes E. Gehrke, Nitin Gupta, Philipp T. Unterbrunner, Alan J. Demers
  • SEMANTIC TRANSACTIONS IN ONLINE APPLICATIONS
    Publication number: 20100198914
    Abstract: A system and method for enabling distributed transaction processing by moving all application logic away from the server and into the client by using an optimistic concurrency control framework with client-side transaction validation including virtual full replication under a transactional programming model with full Atomicity, Consistency, Isolation, and Durability (ACID) properties.
    Type: Application
    Filed: July 11, 2008
    Publication date: August 5, 2010
    Applicant: CORNELL UNIVERSITY
    Inventors: Johannes E. Gehrke, Nitin Gupta, Philipp T. Unterbrunner, Alan J. Demers
  • Method of constructing binary decision trees with reduced memory access
    Patent number: 6442561
    Abstract: A method of creating and updating a binary decision tree from training databases that cannot be fit in high speed solid state memory is provided in which a subset of the training database which can fit into high speed memory is used to create a statistically good estimate of the binary decision tree desired. This statistically good estimate is used to review the entire training database in as little as one sequential scan to collect statistics necessary to verify the accuracy of the binary decision tree and to refine the binary decision tree to be identical to that which would be obtained by a full analysis of the training database.
    Type: Grant
    Filed: December 15, 1999
    Date of Patent: August 27, 2002
    Assignee: Wisconsin Alumni Research Foundation
    Inventors: Johannes E. Gehrke, Venkatesh Ganti, Raghu Ramakrishnan