Search

Daniel E Beuch

age ~60

from Rochester, MN

Also known as:
  • Daniel Edward Beuch
  • Daniel E Buech
  • Dan Beuch
  • Daniel Bench
Phone and address:
1006 Northway Ln NE, Rochester, MN 55906
5072895595

Daniel Beuch Phones & Addresses

  • 1006 Northway Ln NE, Rochester, MN 55906 • 5072895595
  • Lanesboro, MN
  • Mechanicsburg, PA
  • Saint Paul, MN

Us Patents

  • Processing Of Deterministic User-Defined Functions Using Multiple Corresponding Hash Tables

    view source
  • US Patent:
    7890480, Feb 15, 2011
  • Filed:
    Feb 11, 2008
  • Appl. No.:
    12/028869
  • Inventors:
    Eric Lawrence Barsness - Pine Island MN, US
    Daniel E. Beuch - Rochester MN, US
    Theresa Renee Euler - Oronoco MN, US
    Paul Stuart Nelsestuen - Rochester MN, US
    John Matthew Santosuosso - Rochester MN, US
  • Assignee:
    International Business Machines Corporation - Armonk NY
  • International Classification:
    G06F 17/30
  • US Classification:
    707702
  • Abstract:
    A deterministic UDF processing mechanism processes user-defined functions (UDFs) using multiple hash tables. Data access patterns for a UDF are collected, and an appropriate hash table set is then determined for the UDF from the data access patterns. If a UDF accesses some similar columns and some disjoint columns, the similar columns are grouped together, and one or more hash tables are allocated to the similar columns. Disjoint columns are allocated their own hash tables. In addition, the allocation of hash tables may be adjusted based on historical access patterns collected over time. By dynamically allocating and adjusting sets of hash tables to a deterministic UDF, the performance of the UDF is greatly increased.
  • Database Execution Detail Repository

    view source
  • US Patent:
    8452756, May 28, 2013
  • Filed:
    Nov 9, 2006
  • Appl. No.:
    11/558104
  • Inventors:
    Mark John Anderson - Oronoco MN, US
    Robert Joseph Bestgen - Rochester MN, US
    Daniel E. Beuch - Rochester MN, US
    Curtis Neal Boger - Oronoco MN, US
    James Michael Flanagan - Rochester MN, US
    Scott Forstie - Rochester MN, US
    Shantan Kethireddy - Rochester MN, US
    Thomas Owen McKinley - Rochester MN, US
    Michael Donald Pfeifer - Rochester MN, US
  • Assignee:
    International Business Machines Corporation - Armonk NY
  • International Classification:
    G06F 17/30
    G06F 15/16
  • US Classification:
    707719, 707721
  • Abstract:
    A database query optimizer includes an access plan storage mechanism that stores execution detail corresponding to a query statement in an access plan cache. By storing execution detail in the access plan cache along with the query statement, the execution detail is available when needed to debug database problems, even after a problem occurs. The execution detail stored in the access plan cache may be mined and analyzed after-the-fact, producing a very powerful tool for debugging database problems. Snapshots of the execution detail may also be created by a user. In addition, the user may setup autonomic snapshots and comparisons so that a user may be alerted from a degradation in database performance between two snapshots.
  • Method And System For Managing Aggregation Data Structures

    view source
  • US Patent:
    20050192988, Sep 1, 2005
  • Filed:
    Feb 26, 2004
  • Appl. No.:
    10/787632
  • Inventors:
    Eric Barsness - Pine Island MN, US
    Daniel Beuch - Rochester MN, US
    Randy Ruhlow - Rochester MN, US
    John Santosuosso - Rochester MN, US
  • Assignee:
    INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY
  • International Classification:
    G06F017/00
  • US Classification:
    707101000
  • Abstract:
    A method, system and article of manufacture for processing aggregation queries that are executed against a database and, more particularly, for managing aggregation data structures associated with tables of a database. One embodiment provides a method for managing creation of aggregation data structures for tables of a database. The method comprises receiving an aggregation query specifying at least one aggregation operation on data of a table of the database, determining aggregation information for the aggregation query, the aggregation information describing aspects of the aggregation query and its respective aggregation operation, determining whether the aggregation information satisfies predefined conditions, and, if the predefined conditions are satisfied by the aggregation information, creating an aggregation data structure for the table of the database in a manner allowing return of aggregation data of the created aggregation data structure upon receipt of a suitable aggregation query without executing the suitable aggregation query against the table of the database, wherein the suitable aggregation query includes the aggregation operation contained in the aggregation query for which the aggregation data structure was created.
  • Method And System For Providing Referential Integrity Constraints

    view source
  • US Patent:
    20060085464, Apr 20, 2006
  • Filed:
    Oct 14, 2004
  • Appl. No.:
    10/965124
  • Inventors:
    Daniel Beuch - Rochester MN, US
    John Santosuosso - Rochester MN, US
  • Assignee:
    INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY
  • International Classification:
    G06F 7/00
  • US Classification:
    707101000
  • Abstract:
    A master table and one or more slave tables are linked together by different referential integrity constraints. A database engine maintains a separate data structure that includes information about which slave tables include corresponding records that may be affected by a constraint. Accordingly, when an operation is performed on the master table, the data structure is referenced to determine which slave tables has records which are affected as well. The data structure may be a bitmap, an encoded vector index, or separate fields within the master database. As a result of this data structure, unnecessary I/O operations are avoided involving slave tables without a corresponding record.
  • Apparatus And Method For Call Stack Profiling For A Software Application

    view source
  • US Patent:
    20060130001, Jun 15, 2006
  • Filed:
    Nov 30, 2004
  • Appl. No.:
    11/000449
  • Inventors:
    Daniel Beuch - Rochester MN, US
    Richard Saltness - Rochester MN, US
    John Santosuosso - Rochester MN, US
  • Assignee:
    INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY
  • International Classification:
    G06F 9/44
  • US Classification:
    717130000
  • Abstract:
    A method and apparatus for monitoring the performance of a computer system with one or more active programs. A periodic sampling of the call stack is obtained. The sampled call stack is examined to infer the system performance similar to that obtained using prior art event based profiling. Embodiments also are directed to a combination approach to describing the system performance using a historical sampling to infer additional detail to fill in the gaps of the sampled data.
  • Apparatus And Method For Dynamically Determining Index Split Options From Monitored Database Activity

    view source
  • US Patent:
    20070005631, Jan 4, 2007
  • Filed:
    Jun 30, 2005
  • Appl. No.:
    11/171728
  • Inventors:
    Eric Barsness - Pine Island MN, US
    Daniel Beuch - Rochester MN, US
    John Santosuosso - Rochester MN, US
  • Assignee:
    INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY
  • International Classification:
    G06F 7/00
  • US Classification:
    707102000
  • Abstract:
    The activity of a database is monitored, and index split options are dynamically determined from the monitored database activity. Appropriate action may then be taken based on the dynamically determined index split options. For example, the index may be automatically split using the dynamically determined index split options. A user command that specifies index split options may be compared to the dynamically determined index split options, and if the user command is not compatible with the dynamically determined index split options, the command may be inhibited, or the user may receive a warning message in response to the command. In addition, existing index use may be monitored, and if the monitored index use indicates the index is split poorly, the index may be re-generated using the dynamically determined index split options.
  • Autonomically Adjusting The Collection Of Performance Data From A Call Stack

    view source
  • US Patent:
    20070150871, Jun 28, 2007
  • Filed:
    Dec 22, 2005
  • Appl. No.:
    11/316287
  • Inventors:
    Eric Barsness - Pine Island MN, US
    Daniel Beuch - Rochester MN, US
    Richard Saltness - Rochester MN, US
    John Santosuosso - Rochester MN, US
  • Assignee:
    INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY
  • International Classification:
    G06F 9/44
  • US Classification:
    717128000
  • Abstract:
    A program product, an apparatus, and method of autonomically adjusting when performance data from a call stack is collected during a trace. In particular, the sampling interval between call stack collections may be autonomically adjusted while a trace is executing based upon the call stack, various performance metrics, and/or previous call stack collections.
  • Methods And Apparatus For Ide Integration Of Database Changes

    view source
  • US Patent:
    20090089743, Apr 2, 2009
  • Filed:
    Oct 2, 2007
  • Appl. No.:
    11/865995
  • Inventors:
    Eric L. Barsness - Pine Island MN, US
    Daniel E. Beuch - Rochester MN, US
    Paul S. Nelsestuen - Oronoco MN, US
    John M. Santosuosso - Rochester MN, US
  • International Classification:
    G06F 9/44
  • US Classification:
    717106
  • Abstract:
    In one aspect, a method is provided. The method includes (1) generating code in an integrated development environment (IDE), the code including instructions for a database; and (2) receiving feedback in the IDE, the feedback relating to the instructions for the database.

Get Report for Daniel E Beuch from Rochester, MN, age ~60
Control profile