Tolga Bozkaya

7177855, Feb 13, 2007

Nov 6, 2003

10/704192

Andrew Witkowski - Foster City CA, US
Srikanth Bellamkonda - Sunnyvale CA, US
Tolga Bozkaya - Belmont CA, US
Abhinav Gupta - Santa Clara CA, US
Nathan Folkert - Palo Alto CA, US
Sankar Subramanian - Cupertino CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30
G06F 7/00

707 2, 707 3, 707 4, 707 5

Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.

7761403, Jul 20, 2010

Nov 6, 2003

10/703412

Andrew Witkowski - Foster City CA, US
Srikanth Bellamkonda - Sunnyvale CA, US
Tolga Bozkaya - Belmont CA, US
Abhinav Gupta - Santa Clara CA, US
Nathan Folkert - Palo Alto CA, US
Sankar Subramanian - Cupertino CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30

707 4, 707 2, 707 7, 707 8, 707 9, 707 10

Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.

7809712, Oct 5, 2010

Nov 2, 2006

11/592470

Andrew Witkowski - Foster City CA, US
Srikanth Bellamkonda - Sunnyvale CA, US
Tolga Bozkaya - Belmont CA, US
Abhinav Gupta - Santa Clara CA, US
Nathan Folkert - San Francisco CA, US
Sankar Subramanian - Cupertino CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30

707713, 707765

Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.

7979384, Jul 12, 2011

May 1, 2008

12/113889

Tolga Bozkaya - Belmont CA, US
Andrew Witkowski - Foster City CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30

707602, 707769

A method for processing queries is provided. A database server receives and executes a query to generate a relation. The query comprises first one or more clauses and a model clause. The model clause comprises a rule that has a left-side expression and a right-side expression. In one embodiment, the right-side expression of the rule includes a window function, which specifies one or more partition columns. In an embodiment, the left-side expression comprises a for-loop predicate. The for-loop predicate is unfolded after the database server compiles the query. In one embodiment, the left-side expression of the rule comprises one or more existential predicates, where each existential predicate evaluates to a Boolean value.

8037024, Oct 11, 2011

Jun 4, 2008

12/133193

Tolga Bozkaya - Belmont CA, US
David L. Butcher - San Mateo CA, US
Andrew Chang Huang - Menlo Park CA, US
Wendy Tobagus - Mountain View CA, US
Dan Moisa - Mountain View CA, US

Google Inc. - Mountain View CA

G06F 17/30

707637

Methods, systems and apparatus, including computer program products, for propagating data across shards of a database system are described. According to one method, a first request that includes instructions to place a second request in a queue of a second shard is placed in a queue of a first database shard, and the change is committed to the records of the first shard. A queue processor polling the queue fetches and dispatches the first request, placing the second request in a queue of a second database shard. The second request includes instructions for making the change to the second shard. A queue processor of the second database shard polls the queue of the second database, fetches the second request, and dispatches it to make the change on the second database shard.

8156145, Apr 10, 2012

Mar 17, 2011

13/050881

Tolga Bozkaya - Belmont CA, US
Andrew Witkowski - Foster City CA, US

Oracle International Corporation - Redwood Shores CA

G06F 7/00
G06F 17/30

707774, 707775, 715220

A method for processing queries is provided. A database server receives and executes a query to generate a relation. The query comprises first one or more clauses and a model clause. The model clause comprises a rule that has a left-side expression and a right-side expression. In one embodiment, the right-side expression of the rule includes a window function, which specifies one or more partition columns. In an embodiment, the left-side expression comprises a for-loop predicate. The for-loop predicate is unfolded after the database server compiles the query. In one embodiment, the left-side expression of the rule comprises one or more existential predicates, where each existential predicate evaluates to a Boolean value.

8443006, May 14, 2013

Jun 18, 2012

13/525561

Tolga Bozkaya - Belmont CA, US
David L. Butcher - San Mateo CA, US
Andrew Chang Huang - Menlo Park CA, US
Wendy Tobagus - Mountian View CA, US
Dan Moisa - Mountain View CA, US

Google Inc. - Mountain View CA

G06F 17/30

707799

Methods, systems and apparatus, including computer program products, for propagating data across shards of a database system are described. According to one method, a first request that includes instructions to place a second request in a queue of a second shard is placed in a queue of a first database shard, and the change is committed to the records of the first shard. A queue processor polling the queue fetches and dispatches the first request, placing the second request in a queue of a second database shard. The second request includes instructions for making the change to the second shard. A queue processor of the second database shard polls the queue of the second database, fetches the second request, and dispatches it to make the change on the second database shard.

8468166, Jun 18, 2013

Mar 17, 2011

13/050883

Tolga Bozkaya - Belmont CA, US
Andrew Witkowski - Foster City CA, US

Oracle International Corporation - Redwood Shores CA

G06F 7/00
G06F 17/30
G06F 17/00

707774, 707775, 715219, 715220

A method for processing queries is provided. A database server receives and executes a query to generate a relation. The query comprises first one or more clauses and a model clause. The model clause comprises a rule that has a left-side expression and a right-side expression. In one embodiment, the right-side expression of the rule includes a window function, which specifies one or more partition columns. In an embodiment, the left-side expression comprises a for-loop predicate. The for-loop predicate is unfolded after the database server compiles the query. In one embodiment, the left-side expression of the rule comprises one or more existential predicates, where each existential predicate evaluates to a Boolean value.