Search

Johannes Ernst Gehrke

from Bellevue, WA
Age ~54

Johannes Gehrke Phones & Addresses

  • 5789 173Rd Ave SE, Bellevue, WA 98006
  • 59 Highgate, Ithaca, NY 14850 (607) 257-5438
  • 7 Pheasant Ln, Ithaca, NY 14850 (607) 272-5933
  • 11 Sanctuary Dr, Ithaca, NY 14850 (607) 266-9239
  • Madison, WI
  • Tompkins, NY
  • Austin, TX

Work

Company: Cornell university Nov 2009 Position: Professor

Education

Degree: PhD School / High School: University of Wisconsin-Madison Aug 1995 to Aug 1999 Specialities: Computer Science

Skills

Distributed Systems • Big Data • Machine Learning • Algorithms • Data Mining • Natural Language Processing • Cloud Computing • Software Development • Databases • Software Engineering • Information Retrieval • Data Management • Data Science • Artificial Intelligence • Java • Data Privacy • Software Design • Enterprise Software • Database Systems • Linux • C++ • C • Enterprise Search • Text Mining • Human Computer Interaction • Unix • High Performance Computing • Pattern Recognition • Image Processing • Statistical Modeling • Simulations • Statistics • Parallel Computing • Information Extraction • Computer Architecture • Predictive Analytics • Computer Science • Search • Scalability • Python • Business Intelligence • Ruby • Object Oriented Design • R • Mathematical Modeling • Perl • Hadoop • Open Source • Programming • Mapreduce

Industries

Computer Software

Resumes

Resumes

Johannes Gehrke Photo 1

Technical Fellow

View page
Location:
Bellevue, WA
Industry:
Computer Software
Work:
Cornell University since Nov 2009
Professor

Microsoft since Aug 2009
Technical Advisor

Max Planck Institute for Software Systems since Jul 2009
Visiting Faculty

University of Tromsø since Sep 2007
Adjunct Professor

Cornell University Sep 2004 - Oct 2009
Associate Professor
Education:
University of Wisconsin-Madison Aug 1995 - Aug 1999
PhD, Computer Science
The University of Texas at Austin
Universität Karlsruhe (TH)
Skills:
Distributed Systems
Big Data
Machine Learning
Algorithms
Data Mining
Natural Language Processing
Cloud Computing
Software Development
Databases
Software Engineering
Information Retrieval
Data Management
Data Science
Artificial Intelligence
Java
Data Privacy
Software Design
Enterprise Software
Database Systems
Linux
C++
C
Enterprise Search
Text Mining
Human Computer Interaction
Unix
High Performance Computing
Pattern Recognition
Image Processing
Statistical Modeling
Simulations
Statistics
Parallel Computing
Information Extraction
Computer Architecture
Predictive Analytics
Computer Science
Search
Scalability
Python
Business Intelligence
Ruby
Object Oriented Design
R
Mathematical Modeling
Perl
Hadoop
Open Source
Programming
Mapreduce

Publications

Wikipedia References

Johannes Gehrke Photo 2

Johannes Gehrke

Work:
Company:

Cornell University faculty

Education:
Studied at:

University of Wisconsin - Madison

Area of science:

Data mining

Academic degree:

Philosophiae Doctor

Johannes Gehrke Photo 3

Johannes Gehrke

Isbn (Books And Publications)

Database Management Systems

View page
Author

Johannes Gehrke

ISBN #

0071151109

Database Management Systems

View page
Author

Johannes Gehrke

ISBN #

0072322063

Database Management Systems

View page
Author

Johannes Gehrke

ISBN #

0072440422

Database Management Systems

View page
Author

Johannes Gehrke

ISBN #

0072450525

Database Management Systems

View page
Author

Johannes Gehrke

ISBN #

0072465638

Data Stream Management: Processing High-speed Data Streams

View page
Author

Johannes Gehrke

ISBN #

3540286071

Us Patents

Method Of Constructing Binary Decision Trees With Reduced Memory Access

View page
US Patent:
6442561, Aug 27, 2002
Filed:
Dec 15, 1999
Appl. No.:
09/465203
Inventors:
Johannes E. Gehrke - Madison WI
Venkatesh Ganti - Madison WI
Raghu Ramakrishnan - Madison WI
Assignee:
Wisconsin Alumni Research Foundation - Madison WI
International Classification:
G06F 1730
US Classification:
707102
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.

Sketch-Based Multi-Query Processing Over Data Streams

View page
US Patent:
7328220, Feb 5, 2008
Filed:
Dec 29, 2004
Appl. No.:
11/025211
Inventors:
Alin Dobra - Gainesville FL, US
Johannes Gehrke - Ithaca NY, US
Rajeev Rastogi - New Providence NJ, US
Minos Garofalakis - Morristown NJ, US
Assignee:
Lucent Technologies Inc. - Murray Hill NJ
International Classification:
G06F 17/00
US Classification:
707101, 707 6
Abstract:
A method of efficiently providing estimated answers to workloads of aggregate, multi-join SQL-like queries over a number of input data-streams. The method only examines each data elements once and uses a limited amount of computer memory. The method uses join graphs and atomic sketches that are essentially pseudo-random summaries formed using random binary variables. The estimated answer is the product of all the atomic sketches for all the vertices in the query join graph. A query workload is processed efficiently by identifying and sharing atomic sketches common to distinct queries, while ensuring that the join graphs remain well formed. The method may automatically minimize either the average query error or the maximum query error over the workload.

System And Method For Scaling Simulations And Games

View page
US Patent:
8443350, May 14, 2013
Filed:
Jun 8, 2009
Appl. No.:
12/480261
Inventors:
Johannes Gehrke - Ithaca NY, US
Alan John Demers - Hector NY, US
Christoph Emanuel Koch - Ithaca NY, US
Walker White - Lansing NY, US
Assignee:
Cornell University - Ithaca NY
International Classification:
G06F 9/45
G06F 9/44
G06F 9/455
G06F 17/50
G06F 17/00
G06F 15/16
G06F 15/177
US Classification:
717149, 717115, 717135, 717140, 716106, 706 46, 706 47, 709204, 715733
Abstract:
A system and method for modeling simulation and game artificial intelligence as a data management problem are described. A scripting language provides game designers and players with a data-driven artificial intelligence scheme for customizing behavior for individual agents. Query processing and indexing techniques efficiently execute large numbers of agent scripts, thus providing a framework for games with a large number of agents.

Method For Matching Xml Twigs Using Index Structures And Relational Query Processors

View page
US Patent:
20060053122, Mar 9, 2006
Filed:
Sep 9, 2004
Appl. No.:
10/937641
Inventors:
Philip Korn - New York NY, US
Nikolaos Koudas - Springfield NJ, US
Divesh Srivastava - Summit NJ, US
Zhiyuan Chen - Columbia MD, US
Johannes Gehrke - Ithaca NY, US
Jayavel Shanmugasundaram - Tompkins NY, US
International Classification:
G06F 7/00
US Classification:
707100000
Abstract:
A framework defining a family of index structures useful in evaluating XML path expressions (i.e., twigs) in XML database is disclosed. Within this framework, two particular index structures with different space-time tradeoffs are presented that prove effective for the evaluation of twigs with value conditions. These index structures can be realized using access methods of an underlying relational database system. Experimental results show that the indices disclosed achieve significant improvement in performance for evaluating twig queries as compared with previously proposed XML path indices.

Semantic Transactions In Online Applications

View page
US Patent:
20100198914, Aug 5, 2010
Filed:
Jul 11, 2008
Appl. No.:
12/668697
Inventors:
Johannes E. Gehrke - Ithaca NY, US
Nitin Gupta - New Delhi, IN
Philipp T. Unterbrunner - Zurich, CH
Alan J. Demers - Hector NY, US
Assignee:
CORNELL UNIVERSITY - Ithaca NY
International Classification:
G06F 15/16
US Classification:
709203
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.

Method And System For Efficient And Expressive Advertising Auctions

View page
US Patent:
20100257054, Oct 7, 2010
Filed:
Aug 27, 2008
Appl. No.:
12/675418
Inventors:
David J. Martin - Ithaca NY, US
Joseph Y. Halpern - Ithaca NY, US
Johannes Gehrke - Ithaca NY, US
Assignee:
CORNELL UNIVERSITY - Ithaca NY
International Classification:
G06Q 30/00
G06Q 10/00
G06Q 50/00
US Classification:
705 1446, 705 1471
Abstract:
A system and method for allowing advertisers to express bids as bidding programs that take as input, for example, a search query and various statistics about auction history and performance, for outputting bids on output characteristics such as, for example, clicks, purchases, and slot positions, and for providing an efficient, scalable, and parallelizable algorithm to solve winner determination given the bids output by the bidding programs.

Protecting The Integrity And Privacy Of Data With Storage Leases

View page
US Patent:
20120110338, May 3, 2012
Filed:
Oct 27, 2011
Appl. No.:
13/282847
Inventors:
Peter Druschel - Saarbruecken, DE
Rodrigo Rodrigues - Saarbruecken, DE
Ansley Post - Zurich, CH
Johannes Gehrke - Ithaca NY, US
Anjo Lucas Vahldiek - Saarbruecken, DE
Assignee:
Max Planck Gesellschaft zur Foerderung der Wissenschaften - Muenchen
International Classification:
G06F 21/24
US Classification:
713182, 726 21
Abstract:
Storage leases specify access restrictions and time periods, restricting access to their associated data during the storage lease time period. Storage leases may be assigned to individual data storage blocks or groups of data storage blocks in a data storage device. A data storage device may include any arbitrary number of different storage leases assigned to different portions of its data storage blocks. Storage lease-enabled devices may provide security certificates to verify that data access operations have been performed as requested and that their storage leases are being enforced. Storage lease-enabled devices compare storage lease information for data units with the current time using a clock isolated from access by storage clients or time certificates from one or more trusted time servers. Storage leases may be used in combination with backup applications, file systems, database systems, peer-to-peer data storage, and cloud storage systems.

Automatic Subspace Clustering Of High Dimensional Data For Data Mining Applications

View page
US Patent:
60030291, Dec 14, 1999
Filed:
Aug 22, 1997
Appl. No.:
8/916347
Inventors:
Rakesh Agrawal - San Jose CA
Johannes Ernst Gehrke - Madison WI
Dimitrios Gunopulos - San Jose CA
Prabhakar Raghavan - Saratoga CA
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 1730
US Classification:
707 7
Abstract:
A method for finding clusters of units in high-dimensional data having the steps of determining dense units in selected subspaces within a data space of the high-dimensional data, determining each cluster of dense units that are connected to other dense units in the selected subspaces within the data space, determining maximal regions covering each cluster of connected dense units, determining a minimal cover for each cluster of connected dense units, and identifying the minimal cover for each cluster of connected dense units.
Johannes Ernst Gehrke from Bellevue, WA, age ~54 Get Report