Abstract: Various embodiments for deduplication of APIs using similarity measures and artificial intelligence are described herein. An embodiment operates by receiving a request to compare a first computing program to a second computing program, wherein each computing program includes an address, one or more tables accessed by a respective computing program, one or more input parameters, and one or more output parameters. Similarity measures are calculated between the addresses, tables, input parameters, and output parameters of the two computing programs. The similarity measures are provided to a trained artificial intelligence (AI) model, which generates a similarity determination. Performed an action based on the similarity determination.

Abstract: Methods, systems, and computer-readable storage media for receiving a key and a value of a data object, determining a first identifier and a second identifier based on the key, defining an entry object including the first identifier, the second identifier, and the value, and storing the entry object in a hashmap by: determining a first value of a first index based on the first identifier, determining a second value of a second index to provide a first value and second value pair that defines a first location within the hashmap storing the first identifier, determining a third value of a third index for the first value and second value pair, where the first value, the second value, and the third value define a second location within the hashmap storing the second identifier, and storing the value at a third location within the hashmap.

Abstract: Methods, systems, and computer-readable storage media for receiving a key and a value of a data object, determining a first identifier and a second identifier based on the key, defining an entry object including the first identifier, the second identifier, and the value, and storing the entry object in a hashmap by: determining a first value of a first index based on the first identifier, determining a second value of a second index to provide a first value and second value pair that defines a first location within the hashmap storing the first identifier, determining a third value of a third index for the first value and second value pair, where the first value, the second value, and the third value define a second location within the hashmap storing the second identifier, and storing the value at a third location within the hashmap.

Abstract: Refresh requests are received by a data source that each request a snapshot of current members of one of a plurality of dynamically changing groups and dynamically changing rules corresponding to such group. Thereafter, the data source queues the received plurality of refresh requests for selective execution or deletion into a new request queue. In addition, real-time execution of refresh jobs are initiated for all of queued refresh requests if a number of refresh requests in both of the new request queue and a waiting requests queue is below a pre-defined threshold. Alternatively, a job framework schedules execution of task jobs for a subset of the queued requests in the new request queue and the waiting requests queue if certain conditions are met.

Abstract: A system having a common cache pool (CCP) includes a computing device having a plurality of applications executable on the computing device, each of the applications being in a particular application category, at least a first portion of the plurality of applications configured to utilize a cache. The CCP including a plurality of sub-caches associated with a respective particular application category, a sub-portion of applications associated with a sub-cache based on the particular application category, a first application of the sub-portion of applications accessing a first sub-cache when operated by a first user, and a second application of the sub-portion of applications, when operated by the first user, accessing the first sub-cache if the first application and the second application are of the same particular application category. A method to implement the system and a non-transitory computer-readable medium are also disclosed.

Abstract: Refresh requests are received by a data source that each request a snapshot of current members of one of a plurality of dynamically changing groups and dynamically changing rules corresponding to such group. Thereafter, the data source queues the received plurality of refresh requests for selective execution or deletion into a new request queue. In addition, real-time execution of refresh jobs are initiated for all of queued refresh requests if a number of refresh requests in both of the new request queue and a waiting requests queue is below a pre-defined threshold. Alternatively, a job framework schedules execution of task jobs for a subset of the queued requests in the new request queue and the waiting requests queue if certain conditions are met.

Abstract: A system having a common cache pool (CCP) includes a computing device having a plurality of applications executable on the computing device, each of the applications being in a particular application category, at least a first portion of the plurality of applications configured to utilize a cache. The CCP including a plurality of sub-caches associated with a respective particular application category, a sub-portion of applications associated with a sub-cache based on the particular application category, a first application of the sub-portion of applications accessing a first sub-cache when operated by a first user, and a second application of the sub-portion of applications, when operated by the first user, accessing the first sub-cache if the first application and the second application are of the same particular application category. A method to implement the system and a non-transitory computer-readable medium are also disclosed.