Patents by Inventor Keith BRIGHT
Keith BRIGHT 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).
-
Patent number: 9943201Abstract: A movable fluid collection device includes a mat assembly, a first conduit segment, and a second conduit segment. The mat assembly includes an absorption material and a low-friction sliding floor-contact material. The first conduit segment may include a loop of tubing having at least one fluid collection opening formed therein, and the second conduit segment connects the first conduit to a suction collection system.Type: GrantFiled: May 22, 2015Date of Patent: April 17, 2018Assignee: BIG FOOT SUCTION, LLCInventors: Nicholas A. Esposito, Carol M. Wolfe, Justin Pagano, Keith Bright
-
Patent number: 9449067Abstract: 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.Type: GrantFiled: February 14, 2011Date of Patent: September 20, 2016Assignee: BMC Software, Inc.Inventors: Chistopher Youngs Blaicher, Kerry Charles Tenberg, Randol Keith Bright
-
Publication number: 20150342425Abstract: A movable fluid collection device includes a mat assembly, a first conduit segment, and a second conduit segment. The mat assembly includes an absorption material and a low-friction sliding floor-contact material. The first conduit segment may include a loop of tubing having at least one fluid collection opening formed therein, and the second conduit segment connects the first conduit to a suction collection system.Type: ApplicationFiled: May 22, 2015Publication date: December 3, 2015Applicant: BIG FOOT SUCTION, LLCInventors: Nicholas A. ESPOSITO, Carol M. WOLFE, Justin PAGANO, Keith BRIGHT
-
Patent number: 8645331Abstract: 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.Type: GrantFiled: December 28, 2009Date of Patent: February 4, 2014Assignee: BMC Software, Inc.Inventors: Christopher Y. Blaicher, Kerry C. Tenberg, Randol Keith Bright
-
Publication number: 20110137887Abstract: 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.Type: ApplicationFiled: February 14, 2011Publication date: June 9, 2011Applicant: BMC SOFTWARE, INC.Inventors: Chistopher Youngs Blaicher, Kerry Charles Tenberg, Randol Keith Bright
-
Patent number: 7930291Abstract: 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.Type: GrantFiled: June 18, 2004Date of Patent: April 19, 2011Assignee: BMC Software, Inc.Inventors: Christopher Youngs Blaicher, Kerry Charles Tenberg, Randol Keith Bright
-
Publication number: 20100100533Abstract: 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.Type: ApplicationFiled: December 28, 2009Publication date: April 22, 2010Applicant: BMC SOFTWARE, INC.Inventors: Christopher Youngs Blaicher, Kerry C. Tenberg, Randol Keith Bright
-
Patent number: 7664790Abstract: 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.Type: GrantFiled: June 18, 2004Date of Patent: February 16, 2010Assignee: BMC Software, Inc.Inventors: Christopher Youngs Blaicher, Kerry Charles Tenberg, Randol Keith Bright