Search

Garret F Swart

from Palo Alto, CA
Age ~66

Garret Swart Phones & Addresses

  • 770 La Para Ave, Palo Alto, CA 94306 (650) 493-8877
  • San Francisco, CA
  • Cupertino, CA
  • Mountain View, CA
  • Seattle, WA
  • Los Altos, CA
  • 770 La Para Ave, Palo Alto, CA 94306

Resumes

Resumes

Garret Swart Photo 1

Principal Architect

View page
Location:
Palo Alto, CA
Industry:
Computer Software
Work:
Oracle since Sep 2007
Architect

TripSketch Corporation since Aug 2007
Technology Advisor

IBM Almaden 2004 - 2007
Research Staff

University College Cork 2002 - 2004
College Lecturer

Xtime, Inc. 1999 - 2002
CTO
Education:
University of Washington 1979 - 1985
Brown University 1974 - 1979
Skills:
Databases
Oracle
Distributed Systems
Software Development
Software Engineering
Scalability
Cloud Computing
Hadoop
Software Design
Java
Linux
Big Data
Enterprise Software
Unix
System Architecture
Algorithms
Management
Java Enterprise Edition
Architecture
Enterprise Architecture
Agile Methodologies
Architectures
Saas
Garret Swart Photo 2

Architect At Oracle

View page
Location:
San Francisco Bay Area
Industry:
Computer Software

Publications

Us Patents

Method For Compressed Data With Reduced Dictionary Sizes By Coding Value Prefixes

View page
US Patent:
7609179, Oct 27, 2009
Filed:
Jan 8, 2008
Appl. No.:
11/970844
Inventors:
Pablo Diaz-Gutierrez - Granada, ES
Vijayshankar Raman - Sunnyvale CA, US
Garret Swart - Palo Alto CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
H03M 7/38
US Classification:
341 51, 341 50
Abstract:
The speed of dictionary based decompression is limited by the cost of accessing random values in the dictionary. If the size of the dictionary can be limited so it fits into cache, decompression is made to be CPU bound rather than memory bound. To achieve this, a value prefix coding scheme is presented, wherein value prefixes are stored in the dictionary to get good compression from small dictionaries. Also presented is an algorithm that determines the optimal entries for a value prefix dictionary. Once the dictionary fits in cache, decompression speed is often limited by the cost of mispredicted branches during Huffman code processing. A novel way is presented to quantize Huffman code lengths to allow code processing to be performed with few instructions, no branches, and very little extra memory. Also presented is an algorithm for code length quantization that produces the optimal assignment of Huffman codes and show that the adverse effect of quantization on the compression ratio is quite small.

Frequency Partitioning: Entropy Compression With Fixed Size Fields

View page
US Patent:
7827187, Nov 2, 2010
Filed:
Apr 4, 2008
Appl. No.:
12/098079
Inventors:
Vijayshankar Raman - Sunnyvale CA, US
Garret Frederick Swart - Palo Alto CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 17/30
US Classification:
707750, 707752, 382239
Abstract:
A frequency partitioning technique is introduced that amortizes the work of computing codeword lengths within a tuplecode by grouping together tuples that have the same pattern of codeword lengths. Specifically, the technique entropy codes and partitions column values in each column into disjoint sets called column partitions, assigns a codeword length to each of the column partitions, identifies cells (a combination of codeword lengths), and collectively storing tuples associated with each of the cells.

Method For Evaluating A Conjunction Of Equity And Range Predicates Using A Constant Number Of Operations

View page
US Patent:
7840554, Nov 23, 2010
Filed:
Mar 27, 2008
Appl. No.:
12/056999
Inventors:
F Ryan Johnson - Pittsburgh PA, US
Vijayshankar Raman - Sunnyvale CA, US
Garret Frederick Swart - Palo Alto CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 7/00
US Classification:
707714, 707719, 707757, 706 47, 716 4
Abstract:
Methods are described to simultaneously apply conjugates of equality, range, and in-list predicates. A first set of methods are described for the simultaneous application of equality predicates. A second set of methods are described for the simultaneous application of a mixture of range and equality predicates. A third method is described for the simultaneous applying a mixture of in-list predicates. The described methods allow for quick evaluation of complex predicates as they efficiently implement the computation done per record, while maintaining the same execution time irrespective of the number of fields.

System To Delegate Virtual Storage Access Method Related File Operations To A Storage Server Using An In-Band Rpc Mechanism

View page
US Patent:
7882202, Feb 1, 2011
Filed:
Apr 1, 2008
Appl. No.:
12/060501
Inventors:
Guillermo Alejandro Alvarez - San Jose CA, US
David Darden Chambliss - Morgan Hill CA, US
Prashant Pandey - San Jose CA, US
Vijayshankar Raman - Sunnyvale CA, US
James Alan Ruddy - San Jose CA, US
Garret Frederick Swart - Palo Alto CA, US
Harry Morris Yudenfriend - Poughkeepsie NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 15/16
US Classification:
709217, 709203, 709216, 709218, 709219
Abstract:
A method is disclosed that places data-intensive subprocesses in close physical and logical proximity to the facility responsible for storing the data, so that high efficiencies at reduced cost are achieved. In one specific example, new computer programs, termed adjuncts, are added and placed in a logical partition on a storage facility so that they can be invoked using appropriate commands issued on the I/O channel. Further, programs or changes are added to existing programs on the host machine, wherein such programs or changes discover the function extensions and invoke them to perform data processing.

Method For Laying Out Fields In A Database In A Hybrid Of Row-Wise And Column-Wise Ordering

View page
US Patent:
8099440, Jan 17, 2012
Filed:
Aug 15, 2008
Appl. No.:
12/192504
Inventors:
F. Ryan Johnson - Lindon UT, US
Vijayshankar Raman - Sunnyvale CA, US
Frederick R. Reiss - Sunnyvale CA, US
Richard S. Sidle - Mountain View CA, US
Garret F. Swart - Palo Alto CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 7/00
US Classification:
707802
Abstract:
A method, system, and article are provided for employment of a hybrid layout of representation of data objects in computer memory. Columns of the database are separated based upon a classification of the columns. A vertical partition in the form of a bank is provided to receive an assignment of one or more data objects identified in the columns. Each bank is sized to be a divisor of a size of an associated hardware register. Assignment of data objects to banks organizes the data in a manner that support efficient query processing that mitigates the quantity of banks required to respond to the query.

Applying Various Hash Methods Used In Conjunction With A Query With A Group By Clause

View page
US Patent:
8108401, Jan 31, 2012
Filed:
Mar 28, 2008
Appl. No.:
12/057979
Inventors:
Lin Qiao - San Jose CA, US
Vijayshankar Raman - Sunnyvale CA, US
Garret Frederick Swart - Palo Alto CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 17/30
G06F 7/00
US Classification:
707747, 707769
Abstract:
A novel method is described for applying various hash methods used in conjunction with a query with a Group By clause. A plurality of drawers are identified, wherein each of the drawers is made up of a collection of cells from a single partition of a Group By column and each of the drawers being defined for a specific query. A separate hash table is independently computed for each of the drawers and a hashing scheme (picked from among a plurality of hashing schemes) is independently applied for each of the drawers.

Efficient Predicate Evaluation Via In-List

View page
US Patent:
8135738, Mar 13, 2012
Filed:
Aug 20, 2008
Appl. No.:
12/195035
Inventors:
Lin Qiao - San Jose CA, US
Vijayshankar Raman - Sunnyvale CA, US
Frederick Ralph Reiss - Sunnyvale CA, US
Richard S. Sidle - Mountain View CA, US
Garret Frederick Swart - Palo Alto CA, US
F. Ryan Johnson - Lausanne, CH
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 7/00
G06F 17/30
US Classification:
707776, 707779, 707780
Abstract:
A predicate over a single column of a table is converted into at least one IN-list, wherein the IN-list is generated for a set of tuples of the column, and the generation is done over a data structure representing a set of distinct values of the column where the predicate applies and having a smaller cardinality than the table. The generated IN-list is evaluated over the set of tuples and the results of the evaluation are outputted as an evaluation of the predicate.

Portable Embedded Local Server For Write-Through Cache

View page
US Patent:
8549101, Oct 1, 2013
Filed:
Nov 13, 2009
Appl. No.:
12/618654
Inventors:
Nikunj R. Mehta - Cupertino CA, US
Garret Swart - Palo Alto CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 15/16
G06F 17/30
H04L 9/32
US Classification:
709217, 709203, 709224, 709229
Abstract:
A method of facilitating, via an embedded local server, dynamic responses to requests originating from an application and directed to a server is disclosed. An intermediary intercepts requests responds to the requests with locally stored data. The intermediary may also forward requests to an embedded local server for processing based on local data.
Garret F Swart from Palo Alto, CA, age ~66 Get Report