Transaction Support Using Intrusive Hash Tables

1. A computer implemented method for transaction support through an intrusive hash table, comprising: receiving a transaction comprising a plurality of operations that need to be verified before being committed, wherein each of the plurality of operations is associated with a key, an operation type, and a next pointer; verifying a validity of the transaction by searching the intrusive hash table and previous operations of the transaction to verify a validity of each operation from the plurality of operations, wherein the intrusive hash table stores a plurality of nodes representing operations of previously-verified transactions, wherein the operation is verified based on looking up the key in the intrusive hash table and searching the plurality of operations for another operation associated with the key and identifying the operation type of the operation; applying, responsive to verifying the transaction, the transaction to the intrusive hash table; and wherein at least one of the receiving, verifying, and applying are preformed by one or more computers.

2. The method of claim 1 , wherein the applying further comprises: routing next pointers associated with the plurality of operations; and routing next pointers associated with nodes of the plurality of nodes affected by applying the transaction.

3. The method of claim 1 , further comprising: failing to verify an operation of the plurality of operations in the transaction; halting, responsive to the failing, verification a unverified operations of the plurality of operations; and proceeding to receive and process another transaction without undoing verification of previously verified operations.

4. The method of claim 1 , wherein the operation type is a selected one of an insert operation, a delete operation, an update operation, and a no-op operation.

5. The method of claim 1 , wherein the next pointer is used to cache a result of the looking up.

6. The method of claim 1 , wherein verifying the validity of an operation from the plurality of operations further comprises: identifying the operation is associated with a previously verified operation of the plurality of operations by comparing the key with a previous key of the previously verified operation; assigning the next pointer to point to the previously verified operation in the intrusive hash table; and converting the operation and the previously verified operation into two equivalent operations.

7. The method of claim 6 , wherein the converting comprises: assigning an operation type of the at least one of the equivalent operations to a no-op operation type, wherein the at least one of the equivalent operations is not processed.

8. A system, comprising: a memory storing transactions; and at least one processor coupled to the memory and configured to: receive a transaction comprising a plurality of operations that need to be verified before being committed, wherein each of the plurality of operations is associated with a key, an operation type, and a next pointer; verifying a validity of the transaction by searching the intrusive hash table and previous operations of the transaction to verify a validity of each operation from the plurality of operations, wherein the intrusive hash table stores a plurality of nodes representing operations of previously-verified transactions, wherein the operation is verified based on looking up the key in the intrusive hash table and searching the plurality of operations for another operation associated with the key and identifying the operation type of the operation; and apply, responsive to verifying the transaction, the transaction to the intrusive hash table.

9. The system of claim 8 , wherein to apply the transaction the at least one processor is configured to: routing next pointers associated with the plurality of operations; and routing next pointers associated with nodes of the plurality of nodes affected by applying the transaction.

10. The system of claim 8 , wherein the at least one processor is further configured to: halt, responsive to the failing to verify an operation of the plurality of operations, the verification of unverified operations of the plurality of operations; and process another transaction without undoing verification of previously verified operations.

11. The system of claim 8 , wherein the operation type is a selected one of an insert operation, a delete operation, an update operation, and a no-op operation.

12. The system of claim 8 , wherein the next pointer is used to cache a result of the looking up.

13. The system of claim 8 , wherein to verify the validity of an operation from the plurality of operations the at least one processor is further configured to: identifying the operation is associated with a previously verified operation of the plurality of operations by comparing the key with a previous key of the previously verified operation; assign the next pointer to point to the previously verified operation in the intrusive hash table; and convert the operation and the previously verified operation into two equivalent operations.

14. The system of claim 13 , wherein to convert the operation and the previously verified operation, the at least one processor is further configured to: assign an operation type of the at least one of the equivalent operations to a no-op operation type, wherein the at least one of the equivalent operations is not processed.

15. A non-transitory computer-readable device having instructions stored thereon that, when executed by at least one computing device, causes the at least one computing device to perform operations comprising: receiving a transaction comprising plurality of operations that need to be verified before being committed, wherein each of the plurality of operations is associated with a key, an operation type, and a next pointer; verifying a validity the transaction by searching the intrusive hash table and previous operations of the transaction to verify a validity of each operation from the plurality of operations, wherein the intrusive hash table stores a plurality of nodes representing operations of previously-verified transactions, wherein the operation is verified based on looking up the key in the intrusive hash table and searching the plurality of operations for another operation associated with the key and identifying the operation type of the operation; applying, responsive to verifying the transaction, the transaction to the intrusive hash table; and wherein at least one of the receiving, verifying, and applying are preformed by one or more computers.

16. The computer-readable device of claim 15 , the verifying of an operation from the plurality of operations comprises: identifying the operation is associated with a previously verified operation of the plurality of operations by comparing the key with a previous key of the previously verified operation; assigning the next pointer to point to the previously verified operation in the intrusive hash table; and converting the operation and the previously verified operation into two equivalent operations, wherein at least one of the equivalent operations is associated with a no-op operation type, and wherein the at least one of the equivalent operations is not processed.