Search

Thomas Fanghaenel

from Oakland, CA
Age ~47
Get Report
Also known as:
Thom Fanghaenel, Thomas Fanghanel, Thomas L
Connected to:
Fred T Fangio, 84Victor S Fangio, 103Allen B Fangman, 73Audrey A Fangman, 78Barbara A Fangman, 79Edward J Fangman, 54Irene A Fangman, 86Mark A Fangman, 61Nancy M Fangman, 62Sally A Fangman, 73

Thomas Fanghaenel Phones & Addresses

  • Oakland, CA
  • Somerville, MA
  • 4501 Snell Ave, San Jose, CA 95136 (408) 972-0470
  • 5220 Terner Way, San Jose, CA 95136 (408) 269-2388
  • San Francisco, CA

Work

Company: Salesforce Dec 2012 Position: Software architect

Education

Degree: Master of Science, Masters School / High School: Friedrich Schiller University Jena 1996 to 2002 Specialities: Computer Science

Skills

Xml • Db2 • Sql • Linux • Software Engineering • Java • C++ • Unix • Aix • Databases • C • Xquery • Eclipse • Xml Schema • Agile Methodologies • Software Development • Compression • Windows • Relational Databases • Qnx • Embedded Linux • Distributed Systems • Java Enterprise Edition • Perl • Shell Scripting • Embedded Software • Windows Mobile • Hadoop • Integration • Software Design • Microsoft Sql Server • Soa • Servlets • Palm Os

Languages

English • German

Interests

Poverty Alleviation

Industries

Computer Software

Resumes

Resumes

Thomas Fanghaenel Photo 1

Software Architect

View page
Location:
638 62Nd St, Oakland, CA 94609
Industry:
Computer Software
Work:
Salesforce
Software Architect
Ibm May 2007 - Nov 2012
Senior Software Engineer
Ibm Aug 2006 - Apr 2007
Advisory Software Engineer
Ibm Feb 2003 - Jul 2006
Staff Software Engineer
Friedrich-Schiller-Universit????T Jena Oct 2002 - Jan 2003
Research Assistent
Education:
Friedrich Schiller University Jena 1996 - 2002
Master of Science, Masters, Computer Science
Skills:
Xml
Db2
Sql
Linux
Software Engineering
Java
C++
Unix
Aix
Databases
C
Xquery
Eclipse
Xml Schema
Agile Methodologies
Software Development
Compression
Windows
Relational Databases
Qnx
Embedded Linux
Distributed Systems
Java Enterprise Edition
Perl
Shell Scripting
Embedded Software
Windows Mobile
Hadoop
Integration
Software Design
Microsoft Sql Server
Soa
Servlets
Palm Os
Interests:
Poverty Alleviation
Languages:
English
German

Publications

Us Patents

Multi-Level Database Compression

View page
US Patent:
20130103655, Apr 25, 2013
Filed:
Oct 21, 2011
Appl. No.:
13/278330
Inventors:
Thomas Fanghaenel - San Jose CA, US
Uttam Jain - San Jose CA, US
Quanzhong LI - San Jose CA, US
Guy M. Lohman - San Jose CA, US
Richard S. Sidle - Mountain View CA, US
Ioana R. Stanoi - San Jose CA, US
Robbert Van der Linden - Scotts Valley CA, US
Assignee:
INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY
International Classification:
G06F 7/00
US Classification:
707693, 707E17045, 707E1701
Abstract:
Embodiments of the invention relate to a multi-level database compression technique to compress table data objects stored in pages. A compact dictionary structure is encoded that represents frequent values of data at any level of granularity. More than one level of compression is provided, wherein input to a finer level of granularity is an output of a coarser level of granularity. Based upon the encoded dictionary structure, a compression technique is applied to a stored page to compress each row on the page. Similarly, a de-compression technique may be applied to decompress the compressed data, utilizing the same dictionary structures at each level of granularity.

Index For Multi-Level Data Structures

View page
US Patent:
20220245113, Aug 4, 2022
Filed:
Jan 29, 2021
Appl. No.:
17/162882
Inventors:
- San Francisco CA, US
Aditya Shetty - San Francisco CA, US
Kaushal Mittal - Dublin CA, US
Terry Chong - Pleasanton CA, US
Thomas Fanghaenel - Oakland CA, US
Vaibhav Arora - San Francisco CA, US
International Classification:
G06F 16/22
Abstract:
Techniques are disclosed relating to index metadata that is usable for accessing multi-level data structures. A computer system may operate a database, including maintaining a set of records having a set of corresponding keys. The computer system may create multi-level data structures that facilitate key range lookups against those records. A given multi-level data structure may store key information indicative of a subset of the corresponding keys. The computer system may create separate index metadata that is usable for accessing the multi-level data structures. The index metadata may specify indications of key information that is stored in the multi-level data structures and locations of the multi-level data structures. The computer system may perform a key range lookup that includes using the index metadata to determine a particular set of the multi-level data structures whose key information corresponds to a key range of the key range lookup.

Mechanisms For Truncating Tenant Data

View page
US Patent:
20230060733, Mar 2, 2023
Filed:
Aug 27, 2021
Appl. No.:
17/458591
Inventors:
- San Francisco CA, US
Terry Chong - Pleasanton CA, US
Thomas Fanghaenel - Oakland CA, US
International Classification:
G06F 16/23
G06F 16/2455
G06F 16/22
G06F 12/0815
G06F 12/02
Abstract:
Techniques are disclosed relating to truncating a tenant's data from a table. A database node may maintain a multi-tenant table having records for tenants. Maintaining the table may include writing a record for a tenant into an in-memory cache and performing a flush operation to flush the record to a shared storage. The database node may write a truncate record into the in-memory cache that truncates a tenant from the table such that records of the tenant having a timestamp indicating a time before the truncate record cannot be accessed as part of a record query. While the truncate record remains in the in-memory cache, the database node may receive a request to perform a record query for a key of the tenant, make a determination on whether a record was committed for the key after the truncate record was committed, and return a response based on the determination.

Three-Dimensional Probabilistic Data Structure

View page
US Patent:
20210319052, Oct 14, 2021
Filed:
Apr 10, 2020
Appl. No.:
16/845921
Inventors:
- San Francisco CA, US
Rohit Agrawal - San Francisco CA, US
Thomas Fanghaenel - Oakland CA, US
International Classification:
G06F 16/33
G06F 16/338
G06F 16/17
G06F 16/182
G06F 21/62
Abstract:
Techniques are disclosed relating to probabilistic data structures. A database node may maintaining a probabilistic data structure capable of encoding database keys. The probabilistic data structure may include a plurality of levels that are each capable of storing an indication of a transition between successive characters in a database key. The database node may insert a particular database key into the probabilistic data structure and the particular database key may comprise a series of characters. The inserting may include setting, for each transition between successive characters of the series of characters, an indication in a corresponding level of the plurality of levels that is indicative of that transition. The database node may further maintain lineage information specifying one or more lineages that correspond to the transition.

Systems And Methods Of Database Tenant Migration

View page
US Patent:
20210073189, Mar 11, 2021
Filed:
Nov 17, 2020
Appl. No.:
16/950086
Inventors:
- San Francisco CA, US
Nathaniel Wyatt - San Francisco CA, US
Gary J. Baker - Glenbrook NV, US
Thomas Fanghaenel - Oakland CA, US
Terry Chong - Pleasanton CA, US
International Classification:
G06F 16/21
G06F 16/22
Abstract:
Systems and methods are provided for migrating a tenant of a database system from a source database instance to a destination database instance. The systems and methods include quiescing the tenant data of the tenant to be migrated from the source database instance to the destination database instance so that no new data is written to the storage of the database system associated with the tenant identifier at the source database instance, transmitting metadata of the tenant to be migrated from the source database instance to the destination database instance, and modifying, at the destination database instance, the metadata of the tenant so that the destination database instance has information to point to groupings of data in the storage for the destination database to access the tenant data.

Database Index Repair

View page
US Patent:
20210073195, Mar 11, 2021
Filed:
Sep 9, 2019
Appl. No.:
16/565401
Inventors:
- San Francisco CA, US
Thomas Fanghaenel - San Francisco CA, US
International Classification:
G06F 16/22
G06F 16/23
G06F 16/21
G06F 16/2453
Abstract:
A computing system may repair a database index for a database table by placing a first structural lock on the database table to prevent modifications to the structure of the table. The computing system may scan the database table to determine a plurality of database records. The system may probe the database index for the database records to identify records with missing entries in the index. Based on the probing, the system may place a first data lock on a record of the database table corresponding to a missing index entry to prevent modification of data in the record. In response to placing the first record lock, the system adds an index entry for the locked database record to the database index. During repair of the index, one or more processes may use the database index to locate one of the plurality of database records included in the database table.

Database Key Compression

View page
US Patent:
20200409915, Dec 31, 2020
Filed:
Jun 28, 2019
Appl. No.:
16/457842
Inventors:
- San Francisco CA, US
Aditya Dharmanand Shetty - San Francisco CA, US
Thomas Fanghaenel - Oakland CA, US
International Classification:
G06F 16/215
G06F 16/22
H03M 7/30
Abstract:
Techniques are disclosed relating to compressing database keys. A computer system may receive a request to write a database record to a storage medium. The database record may include a database key and a corresponding data value. The computer system may compress the database key by replacing a portion of the database key with particular data that identifies a location of a reference database key and an amount of similarity determined between the database key and the reference database key. The computer system may write the database record to the storage medium. The database record may include the compressed database key and the corresponding data value.

Key-Value Storage Using A Skip List

View page
US Patent:
20200320083, Oct 8, 2020
Filed:
Jun 22, 2020
Appl. No.:
16/908097
Inventors:
- San Francisco CA, US
James E. Mace - San Francisco CA, US
Thomas Fanghaenel - Oakland CA, US
International Classification:
G06F 16/2455
Abstract:
This disclosure provides various techniques that may allow for accessing values stored in a data structure that stores multiple values corresponding to database transactions using a skip list. A key may be used to traverse the skip list to access data associated with the key. The skip list maintains on ordering of multiple keys, each associated with a particular record in the data structure, using indirect links between data records in the data structure that reference buckets included in hash table. Each bucket includes pointers to one or more records in the skip list.
Control profile
Thomas Fanghaenel from Oakland, CA, age ~47 Get Report