Executing of lock management functions to updating lock state data of a database system

A database system comprising:

• at least one processor;
• and
• at least one memory storing executable instructions that, when executed by the at least one processor, cause the database system to:
• maintain lock state data that includes a mapping of a plurality of lock state structures to a plurality of lock scope identifiers wherein each of the plurality of lock state structures maintains a set of lock requests each corresponding to access to data corresponding to a corresponding one of the plurality of lock scope identifiers based on storing:
• a queue of pending lock requests that includes a first subset of the set of lock requests;
• and
• a set of granted lock requests that includes a second subset of the set of lock requests;
• wherein the lock state data includes a map data structure storing the mapping of the plurality of lock state structures to the plurality of lock scope identifiers, wherein the map data structure includes both a first map entry containing a first lock state structure of the plurality of lock state structures and a second map entry containing a second lock state structure of the plurality of lock state structures, wherein the first lock state structure of the map data structure includes a first set of lock requests corresponding to a first lock scope identifier of the plurality of lock scope identifiers, wherein the second lock state structure of the map data structure includes a second set of lock requests corresponding to a second lock scope identifier of the plurality of lock scope identifiers, wherein the first set of lock requests and the second set of lock requests have a null set intersection, wherein the first lock state structure of the map data structure stores both a first vector structure storing a first queue of pending lock requests and a second vector structure storing a first set of granted lock requests, wherein the first vector structure stores a first subset of the first set of lock requests as a first set of corresponding vector elements of the first vector structure based on the first subset of the first set of lock requests being included in the first queue of pending lock requests, wherein the second vector structure stores a second subset of the first set of lock requests as a second set of corresponding vector elements of the second vector structure based on the second subset of the first set of lock requests being included in the first set of granted lock requests, wherein the second lock state structure of the map data structure stores both a third vector structure storing a second queue of pending lock requests and a fourth vector structure storing a second set of granted lock requests, wherein the first vector structure stores a first subset of the second set of lock requests as a first set of corresponding vector elements of the first vector structure based on the first subset of the second set of lock requests being included in the second queue of pending lock requests, wherein the second vector structure stores a second subset of the second set of lock requests as a second set of corresponding vector elements of the second vector structure based on the second subset of the second set of lock requests being included in the second set of granted lock requests;
• execute a lock management function to update the lock state data for one of the plurality of lock state structures;
• and
• in response to executing the lock management function, executing an evaluation function to further update the one of the plurality of lock state structures based on:
• remove any expired lock requests of the set of lock requests from the one of the plurality of lock state structures;
• determine whether to move at least one lock request from a front of the queue of pending lock requests;
• and
• move the at least one lock request from the front of the queue of pending lock requests to the set of granted lock requests when determining to move the at least one lock request.

A non-transitory computer readable storage medium comprises:

• at least one memory section that stores operational instructions that, when executed by at least one processing module that includes a processor and a memory, causes the at least one processing module to:
• maintain lock state data that includes a mapping of a plurality of lock state structures to a plurality of lock scope identifiers wherein each of the plurality of lock state structures maintains a set of lock requests each corresponding to access to data corresponding to a corresponding one of the plurality of lock scope identifiers based on storing:
• a queue of pending lock requests that includes a first subset of the set of lock requests;
• and
• a set of granted lock requests that includes a second subset of the set of lock requests;
• wherein the lock state data includes a map data structure storing the mapping of the plurality of lock state structures to the plurality of lock scope identifiers, wherein the map data structure includes both a first map entry containing a first lock state structure of the plurality of lock state structures and a second map entry containing a second lock state structure of the plurality of lock state structures, wherein the first lock state structure of the map data structure includes a first set of lock requests corresponding to a first lock scope identifier of the plurality of lock scope identifiers, wherein the second lock state structure of the map data structure includes a second set of lock requests corresponding to a second lock scope identifier of the plurality of lock scope identifiers, wherein the first set of lock requests and the second set of lock requests have a null set intersection, wherein the first lock state structure of the map data structure stores both a first vector structure storing a first queue of pending lock requests and a second vector structure storing a first set of granted lock requests, wherein the first vector structure stores a first subset of the first set of lock requests as a first set of corresponding vector elements of the first vector structure based on the first subset of the first set of lock requests being included in the first queue of pending lock requests, wherein the second vector structure stores a second subset of the first set of lock requests as a second set of corresponding vector elements of the second vector structure based on the second subset of the first set of lock requests being included in the first set of granted lock requests, wherein the second lock state structure of the map data structure stores both a third vector structure storing a second queue of pending lock requests and a fourth vector structure storing a second set of granted lock requests, wherein the first vector structure stores a first subset of the second set of lock requests as a first set of corresponding vector elements of the first vector structure based on the first subset of the second set of lock requests being included in the second queue of pending lock requests, wherein the second vector structure stores a second subset of the second set of lock requests as a second set of corresponding vector elements of the second vector structure based on the second subset of the second set of lock requests being included in the second set of granted lock requests;
• execute a lock management function to update the lock state data for one of the plurality of lock state structures;
• and
• in response to executing the lock management function, executing an evaluation function to further update the one of the plurality of lock state structures based on:
• remove any expired lock requests of the set of lock requests from the one of the plurality of lock state structures;
• determine whether to move at least one lock request from a front of the queue of pending lock requests;
• and
• move the at least one lock request from the front of the queue of pending lock requests to the set of granted lock requests when determining to move the at least one lock request.