TIME WARP CONCURRENCY CONTROL FOR DATABASE SYSTEMS

MULTIPROCESSORS ARE ABLE TO USE OPTIMISTIC-EXECUTION PROTOCOLS SUCH AS TIME WARP FOR LARGE-SCALE, ASYNCHRONOUS APPLICATIONS. LACK OF A WORKING OPTIMISTIC DATABASE CONCURRENCY SCHEME BASED ON THE TIME-WARP CONCURRENCY SCHEMEPREVENTS OPTIMISTIC APPLICATION SYSTEMS FROM ACHIEVING A HIGH DEGREE OF CONCURRENCY. THIS PROJECT PROVIDES FOR A UNIFIED DATABASE CACHING AND CONCURRENCY CONTROL ALGORITHM BASED ON THE TIME-WARP ALGORITHM. FIRST, A UNIFIED FRAMEWORK FOR BOTH CACHING AND CONCURRENCY CONTROL FOR A DATABASE ENVIRONMENT WILL BE DEVELOPED BASED ON A TIME WARP. THE BASIC TIME-WARP PARADIGM WILL BE MODIFIED, AS REQUIRED, TO ACHIEVE THE GREATEST POSSIBLE CONCURRENCY. ADDITIONALLY, THE PARADIGM WILL PROVIDE FOR NESTED TRANSACTIONS TO ALLOW THE GREATEST DEGREE OF CONCURRENCY POSSIBLE WITHIN DATABASE TRANSACTIONS. TO EVALUATE THE PROPOSED ALGORITHMS, A DISCRETE-EVENT SIMULATION OF THE DATABASE CONCURRENCY SCHEME WILL BE MODELED ON A MULTI-PROCESSOR USING THE OBJECT-ORIENTED LANGUAGE C++. MULTIPROCESSORS ARE ABLE TO USE OPTIMISTIC-EXECUTION PROTOCOLS SUCH AS TIME WARP FOR LARGE-SCALE, ASYNCHRONOUS APPLICATIONS. LACK OF A WORKING OPTIMISTIC DATABASE CONCURRENCY SCHEME BASED ON THE TIME-WARP CONCURRENCY SCHEMEPREVENTS OPTIMISTIC APPLICATION SYSTEMS FROM ACHIEVING A HIGH DEGREE OF CONCURRENCY. THIS PROJECT PROVIDES FOR A UNIFIED DATABASE CACHING AND CONCURRENCY CONTROL ALGORITHM BASED ON THE TIME-WARP ALGORITHM. FIRST, A UNIFIED FRAMEWORK FOR BOTH CACHING AND CONCURRENCY CONTROL FOR A DATABASE ENVIRONMENT WILL BE DEVELOPED BASED ON A TIME WARP. THE BASIC TIME-WARP PARADIGM WILL BE MODIFIED, AS REQUIRED, TO ACHIEVE THE GREATEST POSSIBLE CONCURRENCY. ADDITIONALLY, THE PARADIGM WILL PROVIDE FOR NESTED TRANSACTIONS TO ALLOW THE GREATEST DEGREE OF CONCURRENCY POSSIBLE WITHIN DATABASE TRANSACTIONS. TO EVALUATE THE PROPOSED ALGORITHMS, A DISCRETE-EVENT SIMULATION OF THE DATABASE CONCURRENCY SCHEME WILL BE MODELED ON A MULTI-PROCESSOR USING THE OBJECT-ORIENTED LANGUAGE C++.