Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Beavin, US
Jeff Beavin, Norcross, GA US
| Patent application number | Description | Published |
|---|---|---|
| 20090020441 | COLLECTING APPARATUS WITH SEAT - A collecting apparatus having a seat, and method of use thereof, wherein the collecting apparatus comprises a plurality of selectively positionable elastic members secured to a plurality of securing points on a lower portion of a frame or a removable base section connected to the frame. The elastic members are secured to user-selected securing points so that the distance between the elastic members can accommodate objects of different sizes. The collecting apparatus is pressed on top of a ball or similar object, causing the elastic members to separate and allow the ball or similar object to enter and be retained within the frame. Upon entering of the object within the frame, the elastic members retract to their original position, therein preventing the object from falling back out. Objects can be retrieved by lifting the seat or reaching through an aperture formed by a seat opening and a frame front opening. | 01-22-2009 |
| 20100278626 | Collecting Apparatus with Seat - A collecting apparatus having a seat, and method of use thereof, wherein the collecting apparatus comprises a plurality of selectively positionable elastic members secured to a plurality of securing points on a lower portion of a frame or a removable base section connected to the frame. The elastic members are secured to user-selected securing points so that the distance between the elastic members can accommodate objects of different sizes. The collecting apparatus is pressed on top of a ball or similar object, causing the elastic members to separate and allow the ball or similar object to enter and be retained within the frame. Upon entering of the object within the frame, the elastic members retract to their original position, therein preventing the object from falling back out. Objects can be retrieved by lifting the seat or reaching through an aperture formed by a seat opening and a frame front opening. | 11-04-2010 |
Thomas A. Beavin, Milpitas, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090063397 | METHOD AND SYSTEM FOR DISJUNCTIVE SINGLE INDEX ACCESS - A method for performing disjunctive single-index access on a database is disclosed. The method includes a query engine determining whether a first OR predicate and a second OR predicate map to a shared index. Responsive to the query engine determining that the first OR predicate and the second OR predicate map to the shared index, the first OR predicate and the second OR predicate are ordered in an ascending sequence. A first range of the first OR predicate is queued. A first row of the shared index is probed for the first range of the first OR predicate. Whether the first row is disqualified by the first OR predicate is determined. Responsive to determining that the first row is not disqualified by the first OR predicate, the row is reported in a result reporting structure. Responsive to determining that the row is disqualified by the first OR predicate, whether the first range of the first OR predicate overlaps a second range of the second OR predicate is determined, and, responsive to determining that the first range of the first OR predicate overlaps the second range of the second OR predicate, the row is checked against second range of the second or predicate. | 03-05-2009 |
| 20090063458 | METHOD AND SYSTEM FOR MINIMIZING SORTING - A method for minimizing the sorting of data comprises retrieving a database having an index of entries arranged according to a first, second, and third data entries. Additionally, partitioning the index of entries into a first partially-ordered list, wherein the first partially-ordered list comprises information arranged in the form of the first, second, and third data entries. The first partially-ordered list share the same first data entry. Furthermore, partitioning the index of entries into a second partially-ordered list, wherein the second partially-ordered list comprises information arranged in the form of first data entry, second data entry, third data entry. The first data entry within the second partially-ordered list is not the same as the first data entry in the first partially-ordered list. Additionally, querying the first partially-ordered list without querying the second partially-ordered list according to a set of query instructions. | 03-05-2009 |
| 20100114868 | QUERY EXECUTION PLAN EFFICIENCY IN A DATABASE MANAGEMENT SYSTEM - An apparatus, system, and method are disclosed for improving query execution plan efficiency in a database management system. The present invention binds both static database queries and dynamic database queries to new query execution plans (QEPs) that produce the same result set as a former QEP bound to the database queries. Next, the present invention identifies one of the former QEPs and the new QEP as an active QEP and automatically collects execution statistics for one of the former QEPs and the new QEP. Finally, the present invention automatically selects one of the former QEPs and the new QEP as the active QEP in response to completion of the automatic collection of execution statistics, the active QEP selected such that the automatically selected QEP provides optimal execution performance based on performance criteria in comparison to the automatically unselected QEP, the active QEP selected based on the execution statistics. | 05-06-2010 |
Thomas Abel Beavin, Milpitas, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20080215534 | COST-BASED SUBQUERY CORRELATION AND DECORRELATION - Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table. | 09-04-2008 |
| 20090019040 | PROCESSING CROSS-TABLE NON-BOOLEAN TERM CONDITIONS IN DATABASE QUERIES - Processing non-Boolean term conditions in database queries. A query that is a request for data in a database is received and includes at least one uneven non-Boolean term condition that spans multiple tables in the database. The non-Boolean term condition is split into separate portions, each of the portions providing a Boolean term that can be satisfied by accessing one table in the database. The separate portions are executed independently to find at least one data result in the database that satisfies the Boolean term of each separate portion, and the data result from each separate portion are combined into a final result that satisfies the query. | 01-15-2009 |
| 20090070303 | GENERALIZED PARTITION PRUNING IN A DATABASE SYSTEM - A system for executing a query on data that has been partitioned into a plurality of partitions is provided. The system includes providing partitioned data including one or more columns and the plurality of partitions. The partitioned data includes a limit key value associated with each column for a given partition. The system further includes receiving a query including a predicate on one of the one or more columns of the partitioned data; and utilizing the predicate on the one of the one or more columns in a pruning decision on at least one of the one or more partitions based on the limit key values associated with the plurality of partitions. | 03-12-2009 |
William C. Beavin, Webster Groves, MO US
| Patent application number | Description | Published |
|---|---|---|
| 20110010022 | SYSTEMS AND METHODS FOR REMOTELY COLLABORATIVE VEHICLES - Methods and architecture systems for controlling vehicle systems are disclosed. In one embodiment, a method of remotely controlling a vehicle includes estimating a position of the vehicle. A position estimation algorithm may estimate the position of the vehicle. A position data packet received from the vehicle may be used to update the estimated position of the vehicle. A display device may display a virtual representation of the vehicle based on the updated estimated position of the vehicle. Command signals may be transmitted to the vehicle based on the displayed virtual representation of the vehicle. | 01-13-2011 |