CLIENT-SIDE CACHING OF DATABASE TRANSACTION TOKEN

Abstract

A system includes reception of a first query of a first transaction from a client device at a first database node of a database instance comprising two or more database nodes, request of a first transaction token associated with the first transaction from a second database node of the two or more database nodes, reception of the first transaction token from the second database node at the first database node, execution of the first query at the first database node to generate first results, and transmission of the first results and the first transaction token from the first database node to the client device.

Description

BACKGROUND

According to conventional database systems, transactions are used to retrieve data from a database or to insert, update or delete records of the database. In a distributed database system, each of two or more database nodes may execute respective transactions in parallel, and/or a single transaction may affect data located on more than one database node. Distributed database systems therefore employ transaction management techniques.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a system according to some embodiments.

FIG. 2 illustrates multi-version concurrency control according to some embodiments.

FIG. 3 is a sequence diagram according to some embodiments.

FIG. 4 is a block diagram illustrating operation of a system according to some embodiments.

FIG. 5 is a block diagram illustrating operation of a system according to some embodiments.

FIG. 6 is a block diagram illustrating operation of a system according to some embodiments.

FIG. 7 is a block diagram illustrating operation of a system according to some embodiments.

FIG. 8 is a block diagram illustrating operation of a system according to some embodiments.

FIG. 9 is a block diagram illustrating operation of a system according to some embodiments.

FIG. 10 is a block diagram illustrating operation of a system according to some embodiments.

FIG. 11 is a block diagram of a hardware system according to some embodiments.

DETAILED DESCRIPTION

The following description is provided to enable any person in the art to make and use the described embodiments. Various modifications, however, will remain readily apparent to those in the art.

FIG. 1 is a block diagram of system 100. System 100 represents a logical architecture for describing some embodiments, and actual implementations may include more, fewer and/or different components arranged in any manner. The elements of system 100 may represent software elements, hardware elements, or any combination thereof. For example, system 100 may be implemented using any number of computing devices, and one or more processors within system 100 may execute program code to cause corresponding computing devices to perform processes described herein.

Generally, each logical element described herein may be implemented by any number of devices coupled via any number of public and/or private networks. Two or more of such devices may be located remote from one another and may communicate with one another via any known manner of network(s) and/or via a dedicated connection.

System 100 includes database instance 110, which is a distributed database including database nodes 112, 114 and 116. Each of database nodes 112, 114 and 116 includes at least one processor and a memory device. The memory devices of database nodes 112, 114 and 116 need not be physically segregated as illustrated in FIG. 1, rather, FIG. 1 is intended to illustrate that each of database nodes 112, 114 and 116 is responsible for managing a dedicated portion of physical memory, regardless of where that physical memory is located. The data stored within the memories of database nodes 112, 114 and 116, taken together, represent the full database of database instance 110.

In some embodiments, the memory of database nodes 112, 114 and 116 is implemented in Random Access Memory (e.g., cache memory for storing recently-used data) and one or more fixed disks (e.g., persistent memory for storing their respective portions of the full database). Alternatively, one or more of nodes 112, 114 and 116 may implement an “in-memory” database, in which volatile (e.g., non-disk-based) memory (e.g., Random Access Memory) is used both for cache memory and for storing its entire respective portion of the full database. In some embodiments, the data of the full database may comprise one or more of conventional tabular data, row-based data, column-based data, and object-based data. Database instance 100 may also or alternatively support multi-tenancy by providing multiple logical database systems which are programmatically isolated from one another.

According to some embodiments, database nodes 112, 114 and 116 each execute a database server process to provide the full data of database instance to database applications. More specifically, database instance 110 may communicate with one or more database applications executed by client 120 over one or more interfaces (e.g., a Structured Query Language (SQL)-based interface) in order to provide data thereto. Client 120 may comprise one or more processors and memory storing program code which is executable by the one or more processors to cause client 120 to perform the actions attributed thereto herein.

Client 120 may thereby comprise an application server executing database applications to provide, for example, business reporting, inventory control, online shopping, and/or any other suitable functions. The database applications may, in turn, support presentation applications executed by end-user devices (e.g., desktop computers, laptop computers, tablet computers, smartphones, etc.). Such a presentation application may simply comprise a Web browser to access and display reports generated by a database application.

The data of database instance 110 may be received from disparate hardware and software systems, some of which are not interoperational with one another. The systems may comprise a back-end data environment employed in a business or industrial context. The data may be pushed to database instance 110 and/or provided in response to queries received therefrom.

Database instance 110 and each element thereof may also include other unshown elements that may be used during operation thereof, such as any suitable program code, scripts, or other functional data that is executable to interface with other elements, other applications, other data files, operating system files, and device drivers. These elements are known to those in the art, and are therefore not described in detail herein.

FIG. 2 illustrates multi-version concurrency control according to some embodiments. Each of connections 210, 220 and 230 represents a database connection initiated by a client device. For example, each of connections 210, 220 and 230 may represent a connection initiated by a respective client device.

Each transaction T# of each of connections 210, 220 and 230 is terminated in response to an instruction to commit the transaction. Accordingly, a transaction may include one or more write or query statements before an instruction to commit the transaction is issued. Each query statement “sees” a particular snapshot of the database instance at a point in time, which may be determined based on the read mode of the statement's associated connection.

For purposes of the FIG. 2 example, connection 210 only includes write statements and therefore its read mode is irrelevant. Connection 220 is assumed to run in “RepeatableRead” mode or “Serializable” mode and connection 230 is assumed to run in “ReadCommitted” mode. Generally, each statement in a ReadCommitted-mode transaction sees a snapshot of the database based on the statement's timestamp, while each statement in a RepeatableRead-mode or Serializable-mode transaction sees a same snapshot of the database.

As a result of the foregoing assumptions, statements Q1, Q2 and Q3 of transaction T1 each see the result of statement W1, and statements Q4 and Q5 of transaction T3 also see the result of statement W1. Statement Q6 of transaction T3, on the other hand, sees the result of statements W1, W2 and W3.

As described in commonly-assigned U.S. application Ser. No. (Atty Docket no. 2010P00461US), the particular snapshot seen by a statement/transaction may be governed by a “transaction token” in some embodiments. A transaction token, or snapshot timestamp, is assigned on each statement or transaction by a transaction coordinator (e.g., a master database node). A write transaction creates update versions and updates a transaction token when committed. A garbage collector also operates to merge or delete update versions according to a collection protocol. Under such an implementation, each statement in a ReadCommitted-mode transaction may be associated with its own transaction token, while each statement in a RepeatableRead-mode or Serializable-mode transaction may be associated with a same transaction token.

FIG. 3 is a sequence diagram according to some embodiments. Each illustrated step may be embodied in processor-executable program code read from one or more non-transitory computer-readable media, such as a floppy disk, a CD-ROM, a DVD-ROM, a Flash drive, a fixed disk and a magnetic tape, and then stored in a compressed, uncompiled and/or encrypted format. Accordingly, a processor of any suitable device or devices may execute the program code to cause the device or devices to operate as described. In some embodiments, hard-wired circuitry may be used in place of, or in combination with, program code for implementation of processes according to some embodiments. Embodiments are therefore not limited to any specific combination of hardware and software.

Initially, a query Q1 is received by database node 314 from client device 320. As is known in the art, the query may be pre-compiled for execution by database node 314, or may conform to any suitable compilable query language that is or becomes known, such as, for example, SQL. Database node 314 may comprise a database node of a distributed database as described with respect to FIG. 1.

FIG. 4 illustrates system 400 including client 320 and database node 314 according to some embodiments. System 400 also includes coordinator database node 312 and database node 316. Each illustrated database node manages a respective database table, A, B or C. As shown, database node 314 receives query Q1 from client 320.

Query Q1 is associated with a particular transaction (i.e., transaction T1). The transaction may be initiated by database node 314 in response to reception of query Q1 or may have been previously-initiated. Similarly, client 320 may open a connection with database node 314 prior to transmission of query Q1.

Returning to FIG. 3, database node 314 requests a transaction token associated with the transaction from coordinator database node 312. This request is illustrated in FIG. 5. Coordinator database node 312 is simply a database node which is responsible for providing transaction tokens as described above, and may be implemented by a master database node of a distributed database. The requested token is returned to database node 314 as also illustrated in FIG. 3.

Having received the transaction token, database node 314 may execute query Q1 based on the snapshot timestamp indicated by the transaction token. Execution of query Q1 generates query results which are transmitted to client 320. As noted in FIG. 3 and illustrated in FIG. 6, the transaction token is also transmitted to client 320 along with the query results. The transaction token is stored at client 320. In some embodiments, the token is stored in library 425 (e.g., an SQLDBC client library) of client device 320 as shown in FIG. 7.

Client device 320 then transmits query Q2 and the stored transaction token to database node 314. In this regard, query Q2 is also associated with transaction T1 and is intended to view a same snapshot as viewed by query Ql. In some embodiments, queries Q1 and Q2 are executed in RepeatableRead mode or Serializable mode as described above.

Since database node 314 now possesses a suitable transaction token for query Q2, node 314 may, in some embodiments, execute query Q2 without having to request a token from coordinator database node 312. Accordingly, query Q2 is executed in view of the received token and the results are returned to client 320 as illustrated in FIG. 8. FIGS. 3 and 9 further illustrate the execution of query Q3, which occurs as described with respect to query Q2.

Client device 320 then transmits an instruction to commit transaction T1 as illustrated in FIG. 10. As also illustrated, and according to some embodiments, transmission of this instruction also includes deletion of the associated transaction token from local storage 425 of client device 320. Embodiments are not limited to deletion of the associated transaction token; the token may be otherwise invalidated (e.g., via an invalidation flag, etc.).

FIG. 3 further illustrates the reception of query Q4 of transaction T2. As described above, database node 314 requests a token corresponding to transaction T2 from coordinator node 312, which is returned to client device 320 along with query results. Unlike transaction T1 described above, transaction T2 includes only one query, therefore the token corresponding to transaction T2 is not transmitted back to database node 314 prior to committing transaction T2.

According to some embodiments, client device 320 may store tokens associated with more than one ongoing transaction. For example, client device 320 may store a token associated with a transaction instantiated on database node 314 and a token associated with a transaction instantiated on database node 316 of system 400. If a database node supports more than one contemporaneous transaction, then client device 320 may store a token associated with each contemporaneous transaction instantiated on the database node.

FIG. 11 is a block diagram of system 1100 according to some embodiments. System 1100 illustrates one hardware architecture implementing system 100 and/or 400 as described above, but implementations of either system 100 or 400 are not limited thereto. Elements of system 1100 may therefore operate to execute methods as described above.

Database master 1110 and each of database slaves 1112, 1114 and 1116 may comprise a multi-processor “blade” server. Each of database master 1110 and database slaves 1112, 1114 and 1116 may operate as described herein with respect to database nodes, and database master 1110 may perform additional transaction coordination functions and other master server functions which are not performed by database slaves 1112, 1114 and 1116 as is known in the art.

Database master 1110 and database slaves 1112, 1114 and 1116 are connected via network switch 1120, and are thereby also connected to shared storage 1130. Shared storage 1130 and all other memory mentioned herein may comprise any appropriate non-transitory storage device, including combinations of magnetic storage devices (e.g., magnetic tape, hard disk drives and flash memory), optical storage devices, and Read Only Memory (ROM) devices, etc.

Shared storage 1130 may comprise the persistent storage of a database instance distributed among database master 1110 and database slaves 1112, 1114 and 1116. As such, various portions of the data within shared storage 1130 may be allotted (i.e., managed by) one of database master 1110 and database slaves 1112, 1114 and 1116.

Application server 1140 may also comprise a multi-processor blade server. Application server 1140, as described above, may execute database applications to provide functionality to end users operating user devices.

Embodiments described herein are solely for the purpose of illustration. Those in the art will recognize other embodiments may be practiced with modifications and alterations to that described above.

Claims

1. A method implemented by a computing system in response to execution of program code by a processor of the computing system, the method comprising: receiving a first query of a first transaction from a client device at a first database node of a database instance comprising two or more database nodes;requesting a first transaction token associated with the first transaction from a second database node of the two or more database nodes;receiving the first transaction token from the second database node at the first database node;executing the first query at the first database node to generate first results; andtransmitting the first results and the first transaction token from the first database node to the client device.

2. A method according to claim 1, further comprising: storing the first transaction token in the client device;transmitting the first transaction token and a second query of the first transaction from the client device to the first database node;receiving the first transaction token and the second query at the first database node;executing the second query at the first database node based on the first transaction token to generate second results; andtransmitting the second results from the first database node to the client device.

3. A method according to claim 2, further comprising: transmitting an instruction to commit the first transaction from the client device to the first database node;committing the first transaction at the first database node;receiving a first query of a second transaction from the client device at the first database node;requesting a second transaction token associated with the second transaction from the second database node;receiving the second transaction token from the second database node at the first database node;executing the second query at the first database node to generate second results; andtransmitting the second results and the second transaction token from the first database node to the client device.

4. A method according to claim 3, further comprising: in response to transmitting the instruction, invalidating the first transaction token at the client device.

5. A method according to claim 1, wherein the first database node is a slave database node of the database instance and the second database node is a master database node of the database instance.

6. A method according to claim 1, further comprising: transmitting an instruction to commit the first transaction from the client device to the first database node; andin response to transmitting the instruction, invalidating the first transaction token at the client device.

7. A non-transitory medium storing computer-executable program code, the program code executable by a computing device to: receive a first query of a first transaction from a client device at a first database node of a database instance comprising two or more database nodes;request a first transaction token associated with the first transaction from a second database node of the two or more database nodes;receive the first transaction token from the second database node at the first database node;execute the first query at the first database node to generate first results; andtransmit the first results and the first transaction token from the first database node to the client device.

8. A medium according to claim 7, the program code further executable by a computing device to: store the first transaction token in the client device;transmit the first transaction token and a second query of the first transaction from the client device to the first database node;receive the first transaction token and the second query at the first database node;execute the second query at the first database node based on the first transaction token to generate second results; andtransmit the second results from the first database node to the client device.

9. A medium according to claim 8, the program code further executable by a computing device to: transmit an instruction to commit the first transaction from the client device to the first database node;commit the first transaction at the first database node;receive a first query of a second transaction from the client device at the first database node;request a second transaction token associated with the second transaction from the second database node;receive the second transaction token from the second database node at the first database node;execute the second query at the first database node to generate second results; andtransmit the second results and the second transaction token from the first database node to the client device.

10. A medium according to claim 9, the program code further executable by a computing device to: in response to transmission of the instruction, invalidate the first transaction token at the client device.

11. A medium according to claim 7, wherein the first database node is a slave database node of the database instance and the second database node is a master database node of the database instance.

12. A medium according to claim 7, the program code further executable by a computing device to: transmit an instruction to commit the first transaction from the client device to the first database node; andin response to transmission of the instruction, invalidate the first transaction token at the client device.

13. A system comprising: a client device comprising a processor and a memory;a first database node comprising a first processor and a first memory;a second database node comprising a second processor and a second memory, the second database node to:receive a first query of a first transaction from the client device;request a first transaction token associated with the first transaction from the first database node;receive the first transaction token from the first database node;execute the first query to generate first results; andtransmit the first results and the first transaction token to the client device.

14. A system according to claim 13, the client device to: store the first transaction token; andtransmit the first transaction token and a second query of the first transaction to the second database node; andthe second database node to:receive the first transaction token and the second query;execute the second query based on the first transaction token to generate second results; andtransmit the second results to the client device.

15. A system according to claim 14, the client device further to: transmit an instruction to commit the first transaction to the second database node; andthe second database node further to:commit the first transaction;receive a first query of a second transaction from the client device;request a second transaction token associated with the second transaction from the first database node;receive the second transaction token from the first database node;execute the second query to generate second results; andtransmit the second results and the second transaction token to the client device.

16. A system according to claim 15, the client device further to: in response to transmission of the instruction, invalidate the first transaction token.

17. A system according to claim 13, wherein the second database node is a slave database node of a database instance and the first database node is a master database node of the database instance.

18. A system according to claim 13, the client device further to: transmit an instruction to commit the first transaction to the second database node; andin response to transmission of the instruction, invalidate the first transaction token.