Search

Weiwei W Gong

from Belmont, CA
Age ~41
Get Report
Connected to:
Alan Gong, 65Albert Y Gong, 74Aleta B Gong, 58Ayumi Gong, 51Baoqing Gong, 38Bencai Gong, 58Bong S Gong, 70Chunling Gong, 88Darrin H Gong, 55Evan G Gong, 30

Weiwei Gong Phones & Addresses

  • 905 Chevy St, Belmont, CA 94002
  • Seattle, WA
  • Malden, MA
  • Arlington, MA
  • Medford, MA
  • Cambridge, MA
  • San Mateo, CA
  • 3620 Mystic Valley Pkwy, Medford, MA 02155

Work

Company: Umass/boston, dept. of c.s. 2008 Position: Research assistant

Education

School / High School: University of Massachusetts Boston 2008 to 2012

Skills

C++ • Java • Matlab • Algorithms • Data Analysis • Python • Distributed Systems • C • Sql • Linux • Computer Science • Databases • Perl • Programming • Javascript • Latex • Machine Learning • Data Mining • Statistics • R • Parallel Programming • Threads

Industries

Information Technology And Services

Resumes

Resumes

Weiwei Gong Photo 1

Senior Development Manager

View page
Location:
905 Chevy St, Belmont, CA 94002
Industry:
Information Technology And Services
Work:
UMass/Boston, Dept. of C.S. since 2008
Research Assistant
Education:
University of Massachusetts Boston 2008 - 2012
Middle School
Renmin University of China
Skills:
C++
Java
Matlab
Algorithms
Data Analysis
Python
Distributed Systems
C
Sql
Linux
Computer Science
Databases
Perl
Programming
Javascript
Latex
Machine Learning
Data Mining
Statistics
R
Parallel Programming
Threads

Publications

Us Patents

Accelerated Building And Probing Of Hash Tables Using Symmetric Vector Processing

View page
US Patent:
20210081410, Mar 18, 2021
Filed:
Sep 11, 2020
Appl. No.:
17/018018
Inventors:
- Redwood Shores CA, US
JAMES KEARNEY - Cambridge MA, US
WEIWEI GONG - Belmont CA, US
International Classification:
G06F 16/2455
G06F 16/22
G06F 16/25
G06F 9/38
G06F 9/30
Abstract:
The present invention relates to hash join acceleration. In an embodiment, a computer receives a request to join build data rows with probe data rows. Each data row is associated with a respective join key value. From multiple buckets of a hash table, a bucket is selected that contains entries of multiple respective join key values in respective locations within the bucket. Whether or not the bucket contains an entry of the join key value of a build data row is detected. While building, multiple locations within the bucket are concurrently inspected to find an empty location in which to store the entry of the join key value of the build data row. The bucket is concurrently probed to detect whether or not the entries in the bucket include an entry of a join key value of a probe data row. For the join request, a response is sent that is based on the concurrent probing of the bucket.

Hardware Friendly Key Value Table Design To Support Relational Hash Join

View page
US Patent:
20210081417, Mar 18, 2021
Filed:
Sep 11, 2020
Appl. No.:
17/018694
Inventors:
- Redwood Shores CA, US
JAMES KEARNEY - Cambridge MA, US
WEIWEI GONG - Belmont CA, US
International Classification:
G06F 16/2453
G06F 16/22
Abstract:
The present invention relates to join acceleration. In an embodiment, a computer receives a request for a relational join of build data rows with probe data rows. Based on the request for the relational join, a particular kind of data map from many kinds of data map that can implement the relational join is dynamically selected. Based on the build data rows, an instance of the particular kind of data map is populated. A response is sent for the request for the relational join that is based on the probe data rows and the instance of the particular kind of data map.

Technique For Fast Join Processing Of Dictionary Encoded Key Columns In Relational Database Systems

View page
US Patent:
20210073221, Mar 11, 2021
Filed:
Sep 9, 2020
Appl. No.:
17/015421
Inventors:
- Redwood Shores CA, US
CHINMAYI KRISHNAPPA - San Mateo CA, US
WEIWEI GONG - Belmont CA, US
JIM KEARNEY - Cambridge MA, US
International Classification:
G06F 16/2455
G06F 16/2453
G06F 16/28
G06F 40/157
G06F 9/38
Abstract:
For join acceleration, a computer stores local encoding dictionaries (ED), including a build ED that contains a plurality of distinct build dictionary codes (DC) and a probe ED that contains a plurality of distinct probe DCs that is not identical to the plurality of distinct build DCs (BDC). Build data rows (DR) that contain a build key that contains BDCs from the plurality of distinct BDCs is stored. Probe DRs that contain a probe key that contains probe DCs from the plurality of distinct probe DCs is stored. A request for a relational join of the build DRs with the probe DRs is received. The BDCs from the build key and the probe DCs from the probe key are transcoded to global DCs (GDC) of a global ED. Based on GDCs for the build key, a build array whose offsets are respective GDCs of the global ED is populated. Based on GDCs for the probe key, offsets of the build array are accessed. A response to the request for the relational join that is based on accessing offsets of the build array is sent.

Techniques Of Heterogeneous Hardware Execution For Sql Analytic Queries For High Volume Data Processing

View page
US Patent:
20210073226, Mar 11, 2021
Filed:
Sep 9, 2020
Appl. No.:
17/015580
Inventors:
- Redwood CA, US
GARRET F. SWART - Palo Alto CA, US
WEIWEI GONG - Belmont CA, US
International Classification:
G06F 16/2453
G06F 16/901
G06N 20/00
Abstract:
The present invention relates to optimized access of a database. Herein are techniques to accelerate execution of any combination of ad hoc query, heterogenous hardware, and fluctuating workload. In an embodiment, a computer receives a data access request for data tuples and compiles the data access request into relational operators. A particular implementation of a particular relational operator is dynamically selected from multiple interchangeable implementations. Each interchangeable implementation contains respective physical operators. A particular hardware operator for a particular physical operator is selected from multiple interchangeable hardware operators that include: a first hardware operator that executes on first processing hardware, and a second hardware operator that executes on second processing hardware that is functionally different from the first processing hardware. A response to the data access request is generated based on: the data tuples, the particular implementation of the particular relational operator, and the particular hardware operator.

Cache Conscious Techniques For Generation Of Quasi-Dense Grouping Codes Of Compressed Columnar Data In Relational Database Systems

View page
US Patent:
20210073233, Mar 11, 2021
Filed:
Jul 8, 2020
Appl. No.:
16/923352
Inventors:
- Redwood Shores CA, US
William Martinez Cortes - Zapopan, MX
Weiwei Gong - Belmont CA, US
International Classification:
G06F 16/2455
G06F 16/22
G06F 16/28
Abstract:
Herein are techniques for dynamic aggregation of results of a database request, including concurrent grouping of result items in memory based on quasi-dense keys. Each of many computational threads concurrently performs as follows. A hash code is calculated that represents a particular natural grouping key (NGK) for an aggregate result of a database request. Based on the hash code, the thread detects that a set of distinct NGKs that are already stored in the aggregate result does not contain the particular NGK. A distinct dense grouping key for the particular NGK is statefully generated. The dense grouping key is bound to the particular NGK. Based on said binding, the particular NGK is added to the set of distinct NGKs in the aggregate result.

In-Memory Key-Value Store For A Multi-Model Database

View page
US Patent:
20190340183, Nov 7, 2019
Filed:
Jul 22, 2019
Appl. No.:
16/518114
Inventors:
- Redwood Shores CA, US
DIETER GAWLICK - Palo Alto CA, US
WEIWEI GONG - Belmont CA, US
International Classification:
G06F 16/25
G06F 16/22
Abstract:
Techniques related to an in-memory key-value store for a multi-model database are disclosed. In an embodiment, a relational database may be maintained on persistent storage. The relational database may be managed by a database server and may include a database table. The database table may be stored in a persistent format. Key-value records may be generated within volatile memory accessible to the database server by converting data in the database table to a key-value format. The key-value format may be different from and independent of the persistent format. A database statement referencing the database table may be executed based on determining whether to access one or more key-value records in the volatile memory or to access the data in the database table. In response to determining to access the one or more key-value records, the database server may access the one or more key-value records in the volatile memory.

In-Memory Key-Value Store For A Multi-Model Database

View page
US Patent:
20170147664, May 25, 2017
Filed:
Nov 19, 2015
Appl. No.:
14/946489
Inventors:
- Redwood Shores CA, US
DIETER GAWLICK - Palo Alto CA, US
WEIWEI GONG - Belmont CA, US
International Classification:
G06F 17/30
Abstract:
Techniques related to an in-memory key-value store for a multi-model database are disclosed. In an embodiment, a relational database may be maintained on persistent storage. The relational database may be managed by a database server and may include a database table. The database table may be stored in a persistent format. Key-value records may be generated within volatile memory accessible to the database server by converting data in the database table to a key-value format. The key-value format may be different from and independent of the persistent format. A database statement referencing the database table may be executed based on determining whether to access one or more key-value records in the volatile memory or to access the data in the database table. In response to determining to access the one or more key-value records, the database server may access the one or more key-value records in the volatile memory.
Control profile
Weiwei W Gong from Belmont, CA, age ~41 Get Report