Database Management Using Sort Keys

Patent metadata

Field	Value
Publication number	US-2023120186-A1
Application number	US-202117532013-A
Country	US
Kind code	A1
Filing date	Nov 22, 2021
Priority date	Oct 20, 2021
Publication date	Apr 20, 2023
Grant date	—

Abstract

Techniques are disclosed for storing and retrieving large amounts of data in a non-relational database using sort keys. A server computer system may receive a request for raw data specifying a start timestamp and an end timestamp. The server determines a start key and an end key for performing a query on a distributed non-relational database storing key-value pairs, where the determining is based on the start timestamp and the end timestamp. The server may compare the start key and the end key to a sort key included in row keys of key-value pairs stored in the non-relational database. Based on the comparing, the server retrieves one or more rows of raw data from the non-relational database. The server generates a graphical representation of the one or more rows of raw data retrieved from the non-relational database. The disclosed techniques may advantageously improve the efficiency of a database management system.

First claim

What is claimed is:

1 . A method, comprising:
receiving, by a server computer system from a computing device, a request for raw data specifying a start timestamp and an end timestamp; determining, by the server computer system, a start key and an end key for performing a query on a distributed non-relational database storing key-value pairs, wherein the determining is based on the start timestamp and the end timestamp; comparing, by the server computer system, the start key and the end key to a sort key included in row keys of key-value pairs stored in the non-relational database; retrieving, by the server computer system based on the comparing, one or more rows of raw data from the non-relational database; and generating, by the server computer system, a graphical representation of the one or more rows of raw data retrieved from the non-relational database.

2 . The method of claim 1 , wherein sort keys included in row keys of key-value pairs include transaction initiation timestamps, and wherein row keys of key-value pairs storing raw data for transactions in the non-relational database include a source account identifier, a transaction direction, a target account identifier, and a transaction identifier.

3 . The method of claim 1 , wherein row keys of rows storing raw data for accounts in the non-relational database include an account identifier, and wherein row keys of rows storing raw linking data in the non-relational database include a source account identifier and a target account identifier.

4 . The method of claim 1 , further comprising:
periodically performing, by the server computer system without interrupting current requests for raw data stored in the non-relational database from one or more computing devices, a bulk update of raw data, wherein the bulk update includes changes to one or more types of the following types of raw data: transaction, account, and linking.

5 . The method of claim 4 , wherein the bulk update is performed on an hourly basis.

6 . The method of claim 4 , wherein periodically performing the bulk update of raw data in the non-relational database includes:
generating a duplicate set of transactions from a set of initiated transactions included in the raw data; and altering the duplicate set of transactions by switching a source account identifier and a target account identifier associated with respective transactions in the duplicate set of transactions.

7 . The method of claim 1 , wherein the request for raw data further specifies at least one account identifier, and wherein determining the start key and the end key for searching the non-relational database is further based on the at least one account identifier.

8 . The method of claim 1 , further comprising:
transmitting, by the server computer system to the computing device, the graphical representation, wherein the graphical representation is usable by the computing device to determine whether to alter account parameters for one or more accounts corresponding to the one or more rows of raw data used to generate the graphical representation.

9 . The method of claim 8 , wherein the transmitting further includes sending instructions specifying one or more changes to be made to one or more accounts corresponding to the one or more rows of raw data used to generate the graphical representation.

10 . A non-transitory computer-readable medium having instructions stored thereon that are executable by a server computer device to perform operations comprising:
receiving, from a computing device, a request for raw data specifying a start timestamp and an end timestamp; determining a start key and an end key for performing a query on a distributed non-relational database storing key-value pairs in a plurality of database regions managed by one or more region servers, wherein the determining is based on the start timestamp and the end timestamp; comparing the start key and the end key to a sort key included in row keys of key-value pairs stored in the non-relational database; retrieving, based on the comparing, one or more rows of raw data from the non-relational database; and generating a graphical representation of the one or more rows of raw data retrieved from the non-relational database.

11 . The non-transitory computer-readable medium of claim 10 , wherein sort keys included in row keys of key-value pairs include transaction initiation timestamps.

12 . The non-transitory computer-readable medium of claim 10 , wherein row keys of key-value pairs storing raw data for transactions in the non-relational database include a source account identifier, a transaction direction, a target account identifier, and a transaction identifier.

13 . The non-transitory computer-readable medium of claim 10 , wherein the raw data stored in the non-relational database includes one or more types of the following types of raw data: transaction, account, and linking.

14 . The non-transitory computer-readable medium of claim 10 , wherein the operations further comprise:
periodically performing, without interrupting current requests for raw data stored in the non-relational database from one or more computing devices, a bulk upsert of raw data, wherein the bulk upsert is performed on a daily basis.

15 . The non-transitory computer-readable medium of claim 10 , wherein row keys of rows storing raw data for accounts in the non-relational database include an account identifier, and wherein row keys of rows storing raw linking data in the non-relational database include a source account identifier and a target account identifier.

16 . A system, comprising
at least one processor; and a memory having instructions stored thereon that are executable by the at least one processor to cause the system to:
receive, from a computing device, a request for raw data specifying a start timestamp and an end timestamp;
determine a start key and an end key for performing a query on a distributed non-relational database storing key-value pairs, wherein determining the start key and the end key is based on the start timestamp and the end timestamp;
compare the start key and the end key to a sort key included in row keys of key-value pairs stored in the non-relational database;
retrieve, based on the comparing, one or more rows of raw data from the non-relational database; and
generate a graphical representation of the one or more rows of raw data retrieved from the non-relational database.

17 . The system of claim 16 , wherein sort keys included in row keys of key-value pairs include transaction initiation timestamps.

18 . The system of claim 16 , wherein row keys of key-value pairs storing raw data for transactions in the non-relational database include a source account identifier, a transaction direction, a target account identifier, and a transaction identifier.

19 . The system of claim 16 , wherein row keys of rows storing raw data for accounts in the non-relational database include an account identifier, and wherein row keys of rows storing raw linking data in the non-relational database include a source account identifier and a target account identifier.

20 . The system of claim 16 , wherein the instructions are further executable by the at least one processor to cause the system to:
periodically perform, without interrupting current requests for raw data stored in the non-relational database from one or more computing devices, a bulk update of raw data, wherein the bulk update is performed on an hourly basis.

Assignees

• Paypal Inc

Inventors

• Huang Zhe
• Jia Haoyang
• Liang Renhua
• Chen Xin
• Yue Ying
• Zhou Yuliang
• Tseng Yao-Tseng
• Zhang Pengshan

Classifications

• G06F16/2477

  Temporal data queries · CPC title

• G06F16/2386

  Bulk updating operations (data conversion details G06F16/258) · CPC title

• G06F16/27

  Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor · CPC title

• G06F21/55 Primary

  Detecting local intrusion or implementing counter-measures · CPC title

• G06F16/9024

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title