Search

Christopher Y Blaicher

from Keene Valley, NY
Age ~77
Get Report
Also known as:
Christopher V Blaicher, Christopher Y Blacher, Christophe Y Blaicher
Related to:
Jayme A Shedenhelm, 30Whitney Novak, 33Jennifer J Novak, 44Patricia A Etzel, 51Sarah Fandre, 51Kent W Warnken
Connected to:
Gay C Blaicher, 81Katie B Blaicher, 39Rosemary F Blaicher, 74Aviva Blaichman, 76Cynthia L Blaida, 72Lloyd E Blaie, 58Joann Blaikie, 74Margaret L Blaikie, 107Robin M Blaikie, 68Tamara A Blaiklock, 71

Christopher Blaicher Phones & Addresses

  • Keene Valley, NY
  • 9404 Pearlstone Cv, Austin, TX 78717 (512) 310-2100
  • Sparta, NJ
  • Mesa, AZ
  • King of Prussia, PA
  • New York, NY
  • Round Rock, TX
  • PO Box 772, Keene Valley, NY 12943 (512) 310-2100

Work

Company: Syncsort Sep 2011 Position: Principle engineer at syncsort, inc

Industries

Computer Software

Resumes

Resumes

Christopher Blaicher Photo 1

Principle Engineer At Syncsort, Inc

View page
Location:
Austin, TX
Industry:
Computer Software
Work:
Syncsort
Principle Engineer at Syncsort, Inc

Business Records

Name / Title
Company / Classification
Phones & Addresses
Christopher Y Blaicher
Director
THE OAKS SCHOOL
120 Walnut Crk Dr, Cedar Park, TX 78613
9404 Pearlstone Cv, Austin, TX 78717
Christopher Y. Blaicher
General Partner
Blaicher Partners, Ltd
8409 Caledonia Dr, Austin, TX 78717

Publications

Us Patents

Reorganizing Database Objects Using Variable Length Keys

View page
US Patent:
7496572, Feb 24, 2009
Filed:
Jul 11, 2003
Appl. No.:
10/618500
Inventors:
Christopher Y. Blaicher - Austin TX, US
Assignee:
BMC Software, Inc. - Houston TX
International Classification:
G06F 7/00
G06F 17/30
US Classification:
707 7, 707102, 707101
Abstract:
Techniques for sorting data include (1) obtaining records containing variable length key fields, (2) expanding the variable length key fields into fixed length key fields in a temporary structure, (3) sorting the temporary structure based on the fixed length key fields, and (4) reorganizing the data containing the variable length key fields in accordance with the sorted temporary structure. Reorganized data can replace the original data or be saved to temporary storage where it can later be merged with other reorganized data. Temporary storage of reorganized data does not incorporate the expanded fixed length key information used in the temporary structure.

Cascade Delete Processing

View page
US Patent:
7664790, Feb 16, 2010
Filed:
Jun 18, 2004
Appl. No.:
10/871240
Inventors:
Christopher Youngs Blaicher - Austin TX, US
Kerry Charles Tenberg - Austin TX, US
Randol Keith Bright - Austin TX, US
Assignee:
BMC Software, Inc. - Houston TX
International Classification:
G06F 12/00
G06F 17/30
US Classification:
707202, 707 3, 707100
Abstract:
A time-efficient means for identifying and processing cascading deletes due to referential constraint violations includes: logging, to an error file, all primary key (“PK”) errors detected during table load operations; building a foreign key (“FK”) index for each child table; recursively probing each relevant FK index to identify all loaded rows that violate a referential constraint due to a PK error; logging all identified FK errors to the error file; and using the (preferably sorted) error file contents to identify, mark and physically delete table rows that violate a referential constraint. The described cascade delete processing methods make only a single pass through the table data, using ordinary computer files to track and organize rows identified for deletion. Use of error files rather than tablescans (multiple passes through the loaded table data) can provide a significant reduction in table load times, especially for large or intricately “related” tables.

Constraint Processing

View page
US Patent:
7930291, Apr 19, 2011
Filed:
Jun 18, 2004
Appl. No.:
10/871160
Inventors:
Christopher Youngs Blaicher - Austin TX, US
Kerry Charles Tenberg - Austin TX, US
Randol Keith Bright - Austin TX, US
Assignee:
BMC Software, Inc. - Houston TX
International Classification:
G06F 7/00
US Classification:
707711
Abstract:
Constraint processing for a relational database generates primary (e. g. , based on primary key values) and constraint index records (e. g. , based on foreign key values) during table load operations that are then sorted in a manner that rapidly and unambiguously identifies rows that fail the specified constraint test. Rows so identified may be deleted to maintain the constraint (e. g. , referential) integrity of a child table. In one case, child table row data may be processed in constraint key order, eliminating the need first load the child table with row data and then delete those rows that subsequently fail the integrity test.

Database Reorganization Technique

View page
US Patent:
8239343, Aug 7, 2012
Filed:
May 23, 2003
Appl. No.:
10/446276
Inventors:
Christopher Y. Blaicher - Austin TX, US
Donald W. Black - Round Rock TX, US
Assignee:
BMC Software, Inc. - Houston TX
International Classification:
G06F 7/00
US Classification:
707609, 707790
Abstract:
A database reorganization technique uses multiple-coordinated read, sort and write tasks to substantially reduce the overall time to reorganize a database object. Coordination between the different functional tasks (e. g. , read, sort and write tasks) is facilitated through the logical partitioning of the key values associated with the object to be reorganized. Object key values are determined by interrogating the object's associated database prior to initiating reorganization processing.

Cascade Delete Processing

View page
US Patent:
8645331, Feb 4, 2014
Filed:
Dec 28, 2009
Appl. No.:
12/647823
Inventors:
Christopher Y. Blaicher - Austin TX, US
Kerry C. Tenberg - Austin TX, US
Randol Keith Bright - Austin TX, US
Assignee:
BMC Software, Inc. - Houston TX
International Classification:
G06F 7/00
G06F 17/00
US Classification:
707691, 707602, 707692
Abstract:
A time-efficient means for identifying and processing cascading deletes due to referential constraint violations includes: logging, to an error file, all primary key (“PK”) errors detected during table load operations; building a foreign key (“FK”) index for each child table; recursively probing each relevant FK index to identify all loaded rows that violate a referential constraint due to a PK error; logging all identified FK errors to the error file; and using the (preferably sorted) error file contents to identify, mark and physically delete table rows that violate a referential constraint. The described cascade delete processing methods make only a single pass through the table data, using ordinary computer files to track and organize rows identified for deletion. Use of error files rather than tablescans (multiple passes through the loaded table data) can provide a significant reduction in table load times, especially for large or intricately “related” tables.

System And Method For Inputing Data To A Sort Utility From A User Program

View page
US Patent:
20040010494, Jan 15, 2004
Filed:
Jul 15, 2002
Appl. No.:
10/195649
Inventors:
Christopher Blaicher - Austin TX, US
International Classification:
G06F017/30
G06F007/00
US Classification:
707/007000
Abstract:
A method and system for inputing data to a sort utility from a user program. In one embodiment, first parameters may facilitate optimization for both programs, by either the user program or the sort utility. The sort utility may process the first parameters to optimize sorting by: returning second parameters to the user program; and supporting a multi-record interface between the two programs. The sort utility may process the data records into the multi-record interface by constructing reformatted data records and inserting the reformatted data records into the multi-record interface, or by utilizing an exit routine to construct and insert the reformatted data records into the multi-record interface. The sort utility may sort the data records (e.g., by directly processing them), optimizing memory usage by the sort utility and/or the user program. The processing and sorting actions of the sort utility program may be coordinated and overlapped.

Methods And Apparatus For Selective Capture Of Mainframe Operating System Records

View page
US Patent:
20180365259, Dec 20, 2018
Filed:
Jun 20, 2017
Appl. No.:
15/628290
Inventors:
- Pearl River NY, US
Christopher Youngs Blaicher - Keene Valley NY, US
International Classification:
G06F 17/30
Abstract:
A computer-based method includes receiving, at a compute device, a collected set of system measurement facility (SMF) data from a mainframe operating system. The method includes, retrieving from a memory operatively coupled to the compute device, a set of SMF field-type identifiers. Each SMF field-type identifier having a one-to-one logical relation with a conditional value from a set of conditional values. The method includes selecting SMF field values from the collected set of SMF data, based on the set of conditional values. The SMF field values is a subset of SMF field values included in the collected set of SMF data. The method further includes executing a flattening process to produce a flattened record that includes at least one flattened SMF field value converted into a target format, and inserting the flattened record into a data repository compatible with the target format.
Control profile
Christopher Y Blaicher from Keene Valley, NY, age ~77 Get Report