BackgroundCheck.run
Search For

Tom C Reyes, 70107 Hawthorne Cir, Calvin, TX 78602

Tom Reyes Phones & Addresses

107 Hawthorne Cir, Bastrop, TX 78602    512-3512769   

Cedar Park, TX   

4701 Duval St, Austin, TX 78727    512-2188056    512-3468982   

2309 Golden Gate Park, Austin, TX 78732    512-5519402   

San Antonio, TX   

Round Rock, TX   

Travis, TX   

Work

Position: Professional/Technical

Education

Degree: Graduate or professional degree

Mentions for Tom C Reyes

Tom Reyes resumes & CV records

Resumes

Tom Reyes Photo 45

. At .

Location:
United States
Industry:
Events Services
Tom Reyes Photo 46

Tom Reyes

Industry:
Construction
Work:
Reyes & Kids Wood Working
Owner
Tom Reyes Photo 47

Tom Reyes

Tom Reyes Photo 48

Tom Reyes

Tom Reyes Photo 49

Tom Reyes

Tom Reyes Photo 50

Software Designer At Hp/Compaq/Tandem

Position:
software designer at HP, software designer at HP/Compaq/Tandem
Location:
Austin, Texas Area
Industry:
Computer Software
Work:
HP since Aug 1997
software designer
HP/Compaq/Tandem - Austin, Texas Area since 1997
software designer
UniSQL 1991 - 1997
software engineer
Amoco Research Center 1984 - 1991
software research scientist
Education:
University of Wisconsin-Madison 1981 - 1983
M.S., Computer Sciences
University of the Philippines 1975 - 1979
M. Eng., Industrial Engineering
Skills:
Databases, Query Optimization, Software Engineering, Compiler Construction, Parsing, C++, gdb, emacs, Unix, Linux, Linkers
Tom Reyes Photo 51

Tom Reyes

Location:
United States
Tom Reyes Photo 52

Tom Reyes

Location:
United States

Publications & IP owners

Us Patents

Hybrid Database Query Caching

US Patent:
7743053, Jun 22, 2010
Filed:
Oct 17, 2006
Appl. No.:
11/581942
Inventors:
Awny K. Al-Omari - Austin TX, US
Tom C. Reyes - Austin TX, US
Robert Wehrmeister - Austin TX, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 7/00
G06F 17/30
US Classification:
707718, 707721, 707706
Abstract:
In one embodiment, a computer system comprises one or more processors, and a memory module communicatively connected to the one or more processors. The memory module comprises logic instructions stored on a computer readable medium which, when executed on the one or more processors configure the one or more processors to receive, in a hybrid caching module, database query, determine whether at least a portion of an existing execution plan stored in a memory module coupled to the hybrid caching module can be reused to implement the database query, reuse at least a portion of an existing execution plan stored in the memory module coupled to the hybrid caching module when possible, and generate a new execution plan when the memory module lacks an existing execution plan adaptable for use with the database query.

Selectivity-Based Optimized-Query-Plan Caching

US Patent:
8224806, Jul 17, 2012
Filed:
Jul 31, 2009
Appl. No.:
12/533365
Inventors:
Awny K. Al-Omari - Cedar Park TX, US
Tom C. Reyes - Austin TX, US
Robert M. Wehrmeister - Austin TX, US
Ahmed K. Ezzat - Cupertino CA, US
QiFan Chen - Austin TX, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 7/00
G06F 17/30
US Classification:
707713, 707715, 707718
Abstract:
Optimized query plans are partitioned into equivalence groups that each include equivalence classes. Each equivalence group corresponds to a particular compiled, normalized, and parameterized query plan prior to optimization. Each equivalence class within an equivalence group corresponds to a different query plan corresponding to the particular compiled, normalized, and parameterized query plan represented by the equivalence group that has been optimized with respect to the selectivity of one or more predicate clauses of the query that is compiled to produce the particular compiled, normalized, and parameterized query plan. Optimized query plans are cached according to their respective equivalence groups and equivalence classes. When a query, similar to a query already compiled, optimized, and cached, is subsequently received and compiled, a selectivity for a predicate of the compiled query is computed, allowing the database management system to retrieve a cached query plan optimized for a similar query with similar selectivity.

System And Method For Optimizing Queries

US Patent:
8380699, Feb 19, 2013
Filed:
Sep 4, 2009
Appl. No.:
12/554254
Inventors:
Awny K. Al-Omari - Cedar Park TX, US
Hansjorg Zeller - Los Altos CA, US
Tom C. Reyes - Austin TX, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 17/30
US Classification:
707713, 707718, 707719, 707769
Abstract:
There is provided a computer-implemented method of optimizing a query. An exemplary method comprises determining a maximum cardinality for an operator. The query may comprise the operator. The exemplary method also comprises determining a plurality of potential implementations for the operator. The exemplary method additionally comprises generating a query plan for the query based on the maximum cardinality and the potential implementations.

Risk-Premium-Based Database-Query Optimization

US Patent:
2010019, Jul 29, 2010
Filed:
Jan 29, 2009
Appl. No.:
12/322164
Inventors:
Awny K. Al-Omari - Cedar Park TX, US
Hansjorg Zeller - Los Altos CA, US
Tom C. Reyes - Austin TX, US
International Classification:
G06F 17/30
US Classification:
707718, 707E17017, 707E17005
Abstract:
Embodiments of the present invention are directed to query-optimization methods and systems that employ risk premiums assigned to database operations in order to increase the robustness and reliability of the evaluation and selection of query-execution plans for executing high-level database queries. Using risk-premium estimates, selection of query-execution plans that include potentially inefficient database operations and inefficient database-operation-execution sequences, often selected by currently available query-optimization methods and systems, are avoided.

Systems And Methods For Searching A Search Space Of A Query

US Patent:
2012017, Jul 12, 2012
Filed:
Jan 6, 2011
Appl. No.:
12/985833
Inventors:
Awny K. Al-Omari - Cedar Park TX, US
QiFan Chen - Austin TX, US
Tom C. Reyes - Austin TX, US
Kashif A. Siddiqui - Round Rock TX, US
International Classification:
G06F 17/30
US Classification:
707719, 707E17131
Abstract:
One example discloses a database management system that can comprise a memory for storing computer executable instructions and a processing unit for accessing the memory and executing the computer executable instructions. The computer executable instructions can comprise a compiler to amortize the execution resource cost of searching a search space corresponding to a received query over a plurality of searches.

NOTICE: You may not use BackgroundCheck or the information it provides to make decisions about employment, credit, housing or any other purpose that would require Fair Credit Reporting Act (FCRA) compliance. BackgroundCheck is not a Consumer Reporting Agency (CRA) as defined by the FCRA and does not provide consumer reports.