Providing multiple concurrent transactions on a single database schema using a single concurrent transaction database infrastructure

1. A method for efficient use of a relational database by a processor device in a computing environment, the method comprising:

executing a plurality of concurrent transactions on the single database schema using a single concurrent transaction database infrastructure, wherein the single database schema is a single concurrent transactional relational database;

calculating a plurality of parameters for controlling a tradeoff between at least each of concurrency, throughput, and latency;

initializing a semaphore for controlling the plurality of concurrent transactions; and

executing a plurality of concurrent transactions on the single database schema in parallel on the single database schema using the single concurrent transaction database infrastructure.

2. The method of claim 1 , further including combing a plurality of databases to expose the single database schema for providing a plurality of concurrent transactions on the single database schema using the single concurrent transactional relational database, wherein character traits and behaviors of a transactional relational database are maintained.

3. The method of claim 1 , further including storing a subset of a plurality of entries according to primary key values for occupying data in each of the plurality of databases, wherein each of the plurality of databases have an identical single database schema.

4. The method of claim 3 , further including performing one of:

performing workload for a plurality of single entry operations,

calculating a database index when a single entry operation is executed and acquiring a lock of the database index, wherein upon acquiring the lock of the database index:

executing the single entry operation on a designed one of a designated one of a plurality of databases.

5. The method of claim 2 , further including attaching an N number of the plurality of databases for executing a singular concurrent transaction across a plurality of entries, wherein alternative transactions and alternative queries are locked for the duration of the singular concurrent transaction.

6. The method of claim 5 , further including cloning a single database operation for the plurality of entries for performing identical operations on each one of the N number of the plurality of databases in a single unified transaction, wherein each lock of each of the N number of the plurality of databases are locked in an increasing order to prevent deadlocks with other operations.

7. A system for efficient use of a relational database in a computing environment, the system comprising:

a plurality of databases, wherein the plurality of databases are relational databases; and

at least one processor device in association with the plurality of databases and operable in the computing environment, wherein processor device:

executes a plurality of concurrent transactions on a single database schema using the single concurrent transaction database infrastructure, wherein the single database schema is a single concurrent transactional relational database,

calculates a plurality of parameters for controlling a tradeoff between at least each of concurrency, throughput, and latency,

initializes a semaphore for controlling the plurality of concurrent transactions, and

executes a plurality of concurrent transactions on the single database schema in parallel on the single database schema using the single concurrent transaction database infrastructure.

8. The system of claim 7 , wherein the at least one processor device combines a plurality of databases to expose the single database schema for providing a plurality of concurrent transactions on the single database schema using the single concurrent transactional relational database, wherein character traits and behaviors of a transactional relational database are maintained.

9. The system of claim 8 , wherein the at least one processor device stores a subset of a plurality of entries according to primary key values for occupying data in each of the plurality of databases, wherein each of the plurality of databases have an identical single database schema.

10. The system of claim 9 , wherein the at least one processor device performs one of:

performing workload for a plurality of single entry operations,

calculating a database index when a single entry operation is executed and acquiring a lock of the database index, wherein upon acquiring the lock of the database index:

executing the single entry operation on a designed one of a designated one of a plurality of databases.

11. The system of claim 8 , wherein the at least one processor device attaches an N number of the plurality of databases for executing a singular concurrent transaction across a plurality of entries, wherein alternative transactions and alternative queries are locked for the duration of the singular concurrent transaction.

12. The system of claim 11 , wherein the at least one processor device clones a single database operation for the plurality of entries for performing identical operations on each one of the N number of the plurality of databases in a single unified transaction, wherein each lock of each of the N number of the plurality of databases are locked in an increasing order to prevent deadlocks with other operations.

13. A computer program product for efficient use of relational databases in a computing environment by at least one processor device, the computer program product comprising a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:

an executable portion that executes a plurality of concurrent transactions on the single database schema using a single concurrent transaction database infrastructure, wherein the single database schema is a single concurrent transactional relational database;

an executable portion that calculates a plurality of parameters for controlling a tradeoff between at least each of concurrency, throughput, and latency;

an executable portion that initializes a semaphore for controlling the plurality of concurrent transactions; and

an executable portion that executes a plurality of concurrent transactions on the single database schema in parallel on the single database schema using the single concurrent transaction database infrastructure.

14. The computer program product of claim 13 , further including an executable portion that combines a plurality of databases to expose the single database schema for providing a plurality of concurrent transactions on the single database schema using the single concurrent transactional relational database, wherein character traits and behaviors of a transactional relational database are maintained.

15. The computer program product of claim 13 , further including an executable portion that stores a subset of a plurality of entries according to primary key values for occupying data in each of the plurality of databases, wherein each of the plurality of databases have an identical single database schema.

16. The computer program product of claim 15 , further including an executable portion that performs one of:

performing workload for a plurality of single entry operations,

calculating a database index when a single entry operation is executed and acquiring a lock of the database index, wherein upon acquiring the lock of the database index:

executing the single entry operation on a designed one of a designated one of a plurality of databases.

17. The computer program product of claim 14 , further including an executable portion that attaches an N number of the plurality of databases for executing a singular concurrent transaction across a plurality of entries, wherein alternative transactions and alternative queries are locked for the duration of the singular concurrent transaction.

18. The computer program product of claim 17 , further including an executable portion that clones a single database operation for the plurality of entries for performing identical operations on each one of the N number of the plurality of databases in a single unified transaction, wherein each lock of each of the N number of the plurality of databases are locked in an increasing order to prevent deadlocks with other operations.