| Patent application number | Description | Published |
|---|
| 20090020725 | FLUSH VALVE APPARATUS AND METHOD FOR FORMING A FRAME AND HOUSING FOR A FLUSH VALVE - A method of manufacturing a flush valve device is provided, including forming a mold for a first half and a second half of the flush valve device, performing injection molding on the mold, upon cooling, removing the first half and the second half from the mold, and forming the flush valve device by joining the first half and the second half. | 01-22-2009 |
| 20090025129 | FLUSH VALVE MECHANISMS - A flush valve is provided for flushing a toilet bowl. The flush valve includes a center tube, a flush activation device configured to initially raise the center tube, and at least one timing mechanism configured to control movement of the center tube. The timing mechanism controls volume of fluid used during a flush. | 01-29-2009 |
| 20090025130 | FLUSH VALVE MECHANISM - A flush valve is provided for flushing a toilet bowl. The flush valve includes a center tube having a lug, a flush activation device configured to initially raise the center tube, at least one latching mechanism configured to control movement of the center tube, and at least one rack configured to have movement controlled by the at least one latching mechanism. The at least one latching mechanism controls volume of fluid used during a flush. | 01-29-2009 |
| Patent application number | Description | Published |
|---|
| 20080282057 | Database Heap Management System With Variable Page Size and Fixed Instruction Set Address Resolution - A heap management system for a database uses “sets” of pages to store database information. As memory for each successive set of pages is allocated, more memory is allocated for storing rows in each page of the set. Similarly, the maximum number of rows of information storable in each page of each set is greater for each successive set of pages. The number of computer instructions needed to resolve (or calculate) the memory address for a particular row is fixed. Given a target row number, (and the number of rows in the first page, and the width of the column or column group), only a fixed number of computer instructions need to be executed to resolve the starting memory address for the target row. In addition, information of the same type (i.e., one or more columns of a table) may be stored in different pages, and these pages may be located in discontiguous memory segments. This allows space for new rows to be allocated, without requiring all pre-existing rows to be moved to a different memory segment. | 11-13-2008 |
| 20090125478 | Database heap management system with variable page size and fixed instruction set address resolution - A heap management system for a database uses “sets” of pages to store database information. As memory for each successive set of pages is allocated, more memory is allocated for storing rows in each page of the set. Similarly, the maximum number of rows of information storable in each page of each set is greater for each successive set of pages. The number of computer instructions needed to resolve (or calculate) the memory address for a particular row is fixed. Given a target row number, (and the number of rows in the first page, and the width of the column or column group), only a fixed number of computer instructions need to be executed to resolve the starting memory address for the target row. In addition, information of the same type (i.e., one or more columns of a table) may be stored in different pages, and these pages may be located in discontiguous memory segments. This allows space for new rows to be allocated, without requiring all pre-existing rows to be moved to a different memory segment. | 05-14-2009 |
