Search

Florian A Funke

from San Francisco, CA
Get Report
Also known as:
Florian K Funke
Related to:
Kerstin Hammen
Connected to:
Amy E Funke, 50Ashley A Funke, 33Birgit Funke, 56Carie M Funke, 52Ervalene F Funke, 62Holly S Funke, 58Jamie Funke, 32Juergen G Funke, 62Kathleen S Funke, 89Lukas J Funke, 29

Florian Funke Phones & Addresses

  • San Francisco, CA

Resumes

Resumes

Florian Funke Photo 1

Software Engineer At Snowflake Computing

View page
Location:
101 south Ellsworth Ave, San Mateo, CA 94401
Industry:
Computer Software
Work:
Snowflake Computing
Software Engineer at Snowflake Computing
Technische Universität München Jun 2010 - Feb 2015
Phd Student
Ibm Jan 2009 - May 2010
Software Engineer
Ibm Jul 2007 - Oct 2007
Extreme Blue Internship
Education:
Technical University of Munich 2010 - 2015
Doctorates, Doctor of Philosophy, Philosophy University of Tübingen 2002 - 2008
Tufts University 2005 - 2006
Skills:
Databases
Software Engineering
Algorithms
C++
Computer Science
Java
Sql
Research
Llvm
Software Development
Linux
Olap
Oltp
Linux Kernel
Agile Methodologies
Python
Database Development
Compilers
Eclipse
Programming
Data Warehousing
C
System Building
Agile
Data Mining
Distributed Systems
Languages:
German
English
French
Spanish
Florian Funke Photo 2

Florian Funke

View page

Publications

Us Patents

System And Method For Disjunctive Joins

View page
US Patent:
20210326340, Oct 21, 2021
Filed:
May 21, 2021
Appl. No.:
17/327521
Inventors:
- San Mateo CA, US
Florian Andreas Funke - San Francisco CA, US
Guangyan Hu - Piscataway NJ, US
Jiaqi Yan - San Carlos CA, US
International Classification:
G06F 16/2453
G06F 16/2455
Abstract:
Joining data using a disjunctive operator is described. An example computer-implemented method can include receiving a query that includes a first disjunctive predicate involving a first table and a second table. The method may also include determining a first set of rows from the first table and generating a filter from the first set of rows. The method may also further include applying the filter to the second table to generate a second set of rows. Additionally, the method may also include joining the first set of rows and the second set of rows using a first disjunctive operator of the first disjunctive predicate to generate a first results set.

System And Method For Disjunctive Joins

View page
US Patent:
20210286816, Sep 16, 2021
Filed:
Nov 25, 2020
Appl. No.:
17/105406
Inventors:
- San Mateo CA, US
Florian Andreas Funke - San Francisco CA, US
Guangyan Hu - Piscataway NJ, US
Jiaqi Yan - San Carlos CA, US
International Classification:
G06F 16/2453
G06F 16/2455
Abstract:
Joining data using a disjunctive operator is described. An example computer-implemented method can include receiving a query that includes a first disjunctive predicate involving a first table and a second table. The method may also include determining a first set of rows from the first table and generating a filter from the first set of rows. The method may also further include applying the filter to the second table to generate a second set of rows. Additionally, the method may also include joining the first set of rows and the second set of rows using a first disjunctive operator of the first disjunctive predicate to generate a first results set.

System And Method For Disjunctive Joins Using A Lookup Table

View page
US Patent:
20210286817, Sep 16, 2021
Filed:
Apr 20, 2021
Appl. No.:
17/235826
Inventors:
- San Mateo CA, US
Florian Andreas Funke - San Francisco CA, US
Guangyan Hu - Piscataway NJ, US
Jiaqi Yan - San Carlos CA, US
International Classification:
G06F 16/2453
G06F 16/22
G06F 16/2455
Abstract:
Joining data using a disjunctive operator using a lookup table is described. An example computer-implemented method can include receiving a query with a set of conjunctive predicates and a set of disjunctive predicates. The method may also include generating a lookup table for each predicate in the sets of conjunctive predicates and disjunctive predicates. The method, for each row in a probe-side table, may also further include looking up a value associated with that row in each of the lookup tables and adding the row to a results set when there is a match. Additionally, the method may also include returning the results set.

Framework For Providing Intermediate Aggregation Operators In A Query Plan

View page
US Patent:
20210263929, Aug 26, 2021
Filed:
Jul 27, 2020
Appl. No.:
16/939750
Inventors:
- San Mateo CA, US
Thierry Cruanes - San Mateo CA, US
Florian Andreas Funke - San Mateo CA, US
Allison Waingold Lee - San Carlos CA, US
Jiaqi Yan - San Mateo CA, US
International Classification:
G06F 16/2453
G06F 16/242
Abstract:
The subject technology receives a query plan, the query plan comprising a set of query operations, the set of query operations including at least one aggregation. The subject technology analyzes the at least one aggregation to generate a modified query plan, the modified query plan including at least a top aggregation operator, an intermediate aggregation operator, and a bottom aggregation operator. The subject technology performs, with respect to the intermediate aggregation operator, at least one operation comprising: the subject technology receives an input intermediate data type; the subject technology performs an internalize operation on the input intermediate data type to generate an internal state; the subject technology performs an accumulate operation on the internal state to generate intermediate data; and the subject technology performs an externalize operation on the intermediate data to generate an output data type.

Efficient Database Query Evaluation

View page
US Patent:
20210240670, Aug 5, 2021
Filed:
Jan 31, 2020
Appl. No.:
16/779366
Inventors:
- San Mateo CA, US
Bowei Chen - San Bruno CA, US
Florian Andreas Funke - San Mateo CA, US
International Classification:
G06F 16/174
G06F 16/22
G06F 16/27
Abstract:
Data in a micro-partition of a table is stored in a compressed form. In response to a database query on the table comprising a filter, the portion of the data on which the filter operates is decompressed, without decompressing other portions of the data. Using the filter on the decompressed portion of the data, the portions of the data that are responsive to the filter are determined and decompressed. The responsive data is returned in response to the database query. When a query is run on a table that is compressed using dictionary compression, the uncompressed data may be returned along with the dictionary look-up values. The recipient of the data may use the dictionary look-up values for memoization, reducing the amount of computation required to process the returned data.

Placement Of Adaptive Aggregation Operators And Properties In A Query Plan

View page
US Patent:
20210089533, Mar 25, 2021
Filed:
Apr 24, 2020
Appl. No.:
16/857790
Inventors:
- San Mateo CA, US
Thierry Cruanes - San Mateo CA, US
Florian Andreas Funke - San Mateo CA, US
Allison Waingold Lee - San Carlos CA, US
Jiaqi Yan - San Mateo CA, US
International Classification:
G06F 16/2453
Abstract:
The subject technology receives a query plan, the query plan comprising a set of query operations, the set of query operations including at least one aggregation and at least one join operation. The subject technology analyzes the query plan to identify an aggregation that is redundant. The subject technology removes the aggregation based at least in part on the analyzing. The subject technology determines at least one aggregation property corresponding to at least one query operation of the query plan. The subject technology inserts at least one adaptive aggregation operator in the query plan based at least in part on the at least one aggregation property. The subject technology provides a modified query plan based at least in part on the inserted at least one adaptive aggregation operator in the query plan.

Pipeline Level Optimization Of Aggregation Operators In A Query Plan During Runtime

View page
US Patent:
20210089535, Mar 25, 2021
Filed:
Apr 24, 2020
Appl. No.:
16/857817
Inventors:
- San Mateo CA, US
Thierry Cruanes - San Mateo CA, US
Florian Andreas Funke - San Mateo CA, US
Allison Waingold Lee - San Carlos CA, US
Jiaqi Yan - San Mateo CA, US
International Classification:
G06F 16/2453
G06F 16/2455
G06F 16/22
Abstract:
The subject technology receives a query plan, the query plan comprising a set of query operations, the set of query operations including at least one aggregation and a join operation, the join operation including a build side and a probe side. The subject technology inserts an aggregation operator below the probe side of the join operation. The subject technology causes the build side of the join operation to generate a hash table. The subject technology causes the build side of the join operation to generate a bloom filter based at least in part on the hash table and provide information, corresponding to properties of the build side, to a bloom filter. Based at least in part on the information, the subject technology determines at least one property of the join operation to determine whether to switch the aggregation operator to a pass through mode.

Multi-Cluster Warehouse

View page
US Patent:
20200257705, Aug 13, 2020
Filed:
Apr 29, 2020
Appl. No.:
16/862140
Inventors:
- San Mateo CA, US
Benoit DAGEVILLE - Foster City CA, US
Florian Andreas FUNKE - San Francisco CA, US
Peter POVINEC - Redwood City CA, US
International Classification:
G06F 16/28
H04L 12/24
H04L 29/08
G06F 16/2455
Abstract:
A method for a multi-cluster warehouse includes allocating processing units as part of a data warehouse. The processing units access data within one or more databases in cloud storage resources. The method also includes providing one or more queries to each processing unit within the data warehouse. In response to the queries, each processing unit performs database operations on a particular portion of a database table. The method also includes monitoring a workload of the processing units to determine that a processing capacity of the processing units has reached a threshold processing capacity. The method also includes dynamically adding additional processing units to and removing processing units from the data warehouse as needed based on a workload of the processing units.
Control profile
Florian A Funke from San Francisco, CA Get Report