Panagiotis Antonopoulos

US Patent:

20220253546, Aug 11, 2022

Filed:

Feb 10, 2021

Appl. No.:

17/173039

Inventors:

- Redmond WA, US
Panagiotis ANTONOPOULOS - Redmond WA, US

International Classification:

G06F 21/62
G06F 16/22
G06F 11/14

Abstract:

Embodiments described herein are directed to generating a tree-based data structure representative of a data set and the verification thereof. As each data item of a data set is updated, a leaf node is generated that stores a hash value therefor. For every even leaf node generated, a parent node storing a hash value based on the hash values of its child nodes is generated. For each level of the tree, the hash value of the last odd node generated therefor is maintained. The foregoing process is performed recursively at each level of the tree. During verification, a new root hash value is determined for a new tree-based data structure generated for the data set to be verified. The old and new root hash values are compared. If the hash values do not match, a remediation is performed to restore the data set.

US Patent:

20220197873, Jun 23, 2022

Filed:

Feb 19, 2021

Appl. No.:

17/180508

Inventors:

- Redmond WA, US
Daniel G. SCHALL - Woodinville WA, US
Hanumantha R. KODAVALLA - Sammamish WA, US
Panagiotis ANTONOPOULOS - Redmond WA, US
Raghavendra Thallam KODANDARAMAIH - Redmond WA, US
Alejandro Hernandez SAENZ - Kirkland WA, US
Naveen PRAKASH - Sammamish WA, US

International Classification:

G06F 16/21
G06F 16/245

Abstract:

Methods for page split detection and affinity in query processing pushdowns are performed by systems and devices. Page servers perform pushdown operations based on specific, and specifically formatted or generated, information, instructions, and data provided thereto from a compute node. Page servers also determine that page splits have occurred during reading of data pages maintained by page servers during pushdown operations, and also during fulfillment of compute node data requests. To detect a data page has split, page servers utilize information from a compute node of an expected next data page which is compared to a next data page in the page server page index. A mismatch in the comparison by page servers indicates data page was split. Compute nodes and page servers store and maintain off-row data generated during data operations via page affinity considerations where the off-row data is stored at the same page server as the data.

US Patent:

20220197892, Jun 23, 2022

Filed:

Feb 19, 2021

Appl. No.:

17/180519

Inventors:

- Redmond WA, US
Daniel G. SCHALL - Woodinville WA, US
Hanumantha R. KODAVALLA - Sammamish WA, US
Panagiotis ANTONOPOULOS - Redmond WA, US
Raghavendra Thallam KODANDARAMAIH - Redmond WA, US
Alejandro Hernandez SAENZ - Kirkland WA, US
Naveen PRAKASH - Sammamish WA, US

International Classification:

G06F 16/23
G06F 16/27
G06F 16/2455
G06F 16/21

Abstract:

Distributed database systems including compute nodes and page servers are described herein that enable compute nodes to pushdown certain query processing compute tasks to the page servers to take advantage of otherwise idle compute resources at the page servers, and to reduce the quantity of data that moves between compute nodes and page servers. A distributed database system includes a page server and a compute node, wherein the page server is configured to maintain multiple versions of stored data objects. The compute node is configured to receive a query and generate a transaction context (TC) and modified table schemas (MTS) scoped to the query, and pushdown the query, TC and MTS to the page server that is configured to determine which data objects at the page server satisfy the query, and for each such object, which version of the object should be returned based on the TC.

US Patent:

20220197911, Jun 23, 2022

Filed:

Feb 19, 2021

Appl. No.:

17/180516

Inventors:

- Redmond WA, US
Daniel G. SCHALL - Woodinville WA, US
Hanumantha R. KODAVALLA - Sammamish WA, US
Panagiotis ANTONOPOULOS - Redmond WA, US
Raghavendra Thallam KODANDARAMAIH - Redmond WA, US
Alejandro Hernandez SAENZ - Kirkland WA, US
Naveen PRAKASH - Sammamish WA, US

International Classification:

G06F 16/2457
G06F 16/2453
G06F 16/2455
G06F 16/248
G06F 16/28

Abstract:

Methods for operation fragmentation with metadata serialization in query processing pushdowns are performed by systems and devices. A compute node receives a query directed to database data, and generates query text fragments. Portions of metadata of the database are read from different page servers, and are serialized by the compute node. Page identities of data pages in a page server that stores the data are determined from a page index at the compute node, and the compute node provides the text fragments, the serialized metadata, and the page identities to the page server storing the data. The page server compiles the text fragments based on the serialized metadata to generate an executable query plan for the query. The page server initializes and performs execution of the executable query plan against the data as a pushdown query operation, and a result of pushdown query operation is provided to the compute node.

US Patent:

20230014697, Jan 19, 2023

Filed:

Sep 26, 2022

Appl. No.:

17/935156

Inventors:

- Redmond WA, US
Daniel G. SCHALL - Woodinville WA, US
Hanumantha R. KODAVALLA - Sammamish WA, US
Panagiotis ANTONOPOULOS - Redmond WA, US
Raghavendra Thallam KODANDARAMAIH - Redmond WA, US
Alejandro Hernandez SAENZ - Kirkland WA, US
Naveen PRAKASH - Sammamish WA, US

International Classification:

G06F 16/2457
G06F 16/2453
G06F 16/28
G06F 16/248
G06F 16/2455

Abstract:

Methods for operation fragmentation with metadata serialization in query processing pushdowns are performed by systems and devices. A compute node receives a query directed to database data, and generates query text fragments. Portions of metadata of the database are read from different page servers, and are serialized by the compute node. Page identities of data pages in a page server that stores the data are determined from a page index at the compute node, and the compute node provides the text fragments, the serialized metadata, and the page identities to the page server storing the data. The page server compiles the text fragments based on the serialized metadata to generate an executable query plan for the query. The page server initializes and performs execution of the executable query plan against the data as a pushdown query operation, and a result of pushdown query operation is provided to the compute node.

US Patent:

20190361997, Nov 28, 2019

Filed:

Aug 24, 2018

Appl. No.:

16/112523

Inventors:

- Redmond WA, US
Peter BYRNE - Charlotte Hall MD, US
Hanumantha Rao KODAVALLA - Sammamish WA, US
Wei CHEN - Sammamish WA, US
Girish MITTUR VENKATARAMANAPPA - Redmond WA, US
Panagiotis ANTONOPOULOS - Redmond WA, US
Varun Kunjbihari TIBREWAL - Newark CA, US

International Classification:

G06F 17/30

Abstract:

A relational database system that implements persistent version storage may include an in-row module that is executable by one or more processors to implement an in-row scheme by storing in-row previous version information within a payload of a row within a database page. The relational database system may additionally include an off-row module that is executable by the one or more processors to implement an off-row scheme by storing off-row previous version information in an off-row page that is separate from the database page. The relational database system may additionally include a storage policy that defines when previous version information is stored in accordance with the in-row scheme and when the previous version information is stored in accordance with the off-row scheme. The relational database system may additionally include a cleanup module that cleans up older versions when they are deemed unnecessary by the system.

US Patent:

20180365290, Dec 20, 2018

Filed:

Jun 14, 2017

Appl. No.:

15/623068

Inventors:

- Redmond WA, US
Aditya Nigam - Kirkland WA, US
Arvind Arasu - Redmond WA, US
Donald Alan Kossmann - Kirkland WA, US
Kenneth Eguro - Seattle WA, US
Nikhil Vithlani - Seattle WA, US
Panagiotis Antonopoulos - Redmond WA, US
Ravi Ramamurthy - Redmond WA, US
Michael Zwilling - Seattle WA, US
Cesar Galindo-Legaria - Redmond WA, US

International Classification:

G06F 17/30
G06F 21/60

Abstract:

Computer systems, devices, and associated methods of optimizing the execution of instructions of a database statement by a database server are disclosed herein. In one embodiment, a method includes identifying a potential execution plan for executing instructions of the database statement and estimating a cost for executing the execution plan. The cost can comprise an encrypted data processing cost associated with a operation in the execution plan of executing an operation on encrypted data in a protected computing environment. The method can include estimating the encrypted data processing cost in the protected computing environment based on statistics generated in the protected computing environment about a database table. In response to estimating the cost for executing the execution plan, comparing the cost to estimated costs of alternative execution plans, selecting the lowest-cost plan for execution, and executing the lowest-cost execution plan.

US Patent:

20180349627, Dec 6, 2018

Filed:

Jun 2, 2017

Appl. No.:

15/612865

Inventors:

- Redmond WA, US
Aditya Nigam - Kirkland WA, US
Arvind Arasu - Redmond WA, US
Donald Alan Kossmann - Kirkland WA, US
Kenneth Eguro - Seattle WA, US
Nikhil Vithlani - Seattle WA, US
Panagiotis Antonopoulos - Redmond WA, US
Ravi Ramamurthy - Redmond WA, US

International Classification:

G06F 21/62
H04L 9/06

Abstract:

Computer systems, devices, and associated methods of evaluating an expression comprising restricted data are disclosed herein. In one embodiment, a method includes receiving a database statement from a client application and verifying the authenticity of the database statement. If the database statement is authentic, an approved expression is identified in the database statement for creating an evaluation rule. The method further includes restricting evaluation of expressions in a protected computing environment according to the created evaluation rule.