Abstract: Disclosed are systems, devices, methods, and computer-readable media for performing various actions for bringing data stores into compliance with a policy. The actions include generating a global scan index (“scan index”) for SAS® software and using the scan index to handle data management operations. Unlike traditional B-tree indices that consume a larger quantity of resources to parse through data, the scan indices may include a table of three columns. A first column may include an indication of a search value, a second column may include an indication of what table(s) in the data store(s) include the requested value, and a third column may include an indication of the row number for the tables in column two in which the value resides. The actions further include batching requests to perform a data management operation on data of a certain category by employing the scan index.

Abstract: Methods, systems, and devices for techniques to group media blocks are described. In some cases, a computing system may generate a memory map for a preconfigured size or chunk of data. For example, the computing system may divide files of media blocks into a set of fixed sized chunks of consecutive media blocks. Upon an application requesting a memory map for a set of media blocks, a storage layer of the computing system may generate a sub-map of the memory map for each chunk of data containing a media block of the set of requested media blocks. In some cases, the computing system may assign the chunks of data a continuous range of addresses in the virtual address space of the application. Upon generating the memory map, the storage layer may return an indication of the virtual address ranges of the requested media blocks to the application.

Abstract: Methods, systems, and devices for techniques to balance log structured merge trees are described. A computing system may rebalance a tree structure having an ordered set of leaf nodes by splitting or joining leaf nodes of the tree structure. To split a leaf node, the computing system may select a key to evenly partition key and value data stored in the leaf. The computing system may place each key block of the leaf node having keys less than or equal to the selected key in a first new leaf node, and may place each key block of the leaf node having keys greater than the selected key in a second new leaf node. To join leaf nodes of the tree structure, the computing system may place each key block and each value block of the leaf node and the adjacent leaf node in a new leaf node.

Abstract: An event trigger to flush key-value data from a volatile memory device is detected. In response to detection of the event trigger, a determination is made whether the key-value data comprises uncommitted data for one or more active database transactions. If the key-value data comprises uncommitted data for one or more active database transactions, the uncommitted data is moved to a hold aside buffer in the volatile memory device, and committed data in the key-value data is stored on a non-volatile memory device.

Abstract: A global lock is used to access a first set of data structures. An active transaction having a transaction start identifier is identified as a globally oldest active transaction associated with the first set of data structures. A first marker value of a first data structure of a second set of data structures is compared to the transaction start identifier to determine satisfaction of a first condition. In response to satisfying the first condition, the first data structure is accessed to identify a first set of data locks associated with one or more transactions each having a transaction completion identifier that satisfies a second condition when compared to the transaction start identifier. In response to satisfying the second condition, the first set of data locks is released.

Abstract: A first data structure lock to access a first data structure of a first set of data structures to perform an operation associated with a transaction is acquired. The operation associated with the transaction is executed, wherein the operation is one of inserting the transaction into the first data structure or removing the transaction from the first data structure. An oldest active transaction of the first data structure is identified. A globally oldest active transaction of the set of the data structures in view of the oldest active transaction is determined. A second set of data structures is accessed, the second set of data structures including information associated with completed transactions to identify a set of data locks associated with completed transactions each having a transaction completion identifier that satisfies a condition when compared to a transaction start identifier associated with the globally oldest active transaction. The set of data locks are released.

Abstract: Systems and methods for compression and/or unification of statistical analysis system (SAS) data is provided. In one embodiment, a request to open a unified and compressed statistical analysis system (SAS) view file is received. The unified and compressed SAS data step view file including: an SAS data step view; compressed payload data to be used in the SAS data step view when decompressed; and a set of metadata describing characteristics of variables of the SAS data step view. Upon receiving the request, the compressed payload data is automatically decompressed, such that compressed payload data is decompressed and usable with the SAS data step view to render the SAS data step view and decompressed payload data on an electronic display of a client or host providing the request.

Abstract: A first data structure lock to access a first data structure of a first set of data structures to perform an operation associated with a transaction is acquired. The operation associated with the transaction is executed, wherein the operation is one of inserting the transaction into the first data structure or removing the transaction from the first data structure. An oldest active transaction of the first data structure is identified. A globally oldest active transaction of the set of the data structures in view of the oldest active transaction is determined. A second set of data structures is accessed, the second set of data structures including information associated with completed transactions to identify a set of data locks associated with completed transactions each having a transaction completion identifier that satisfies a condition when compared to a transaction start identifier associated with the globally oldest active transaction. The set of data locks are released.

Abstract: Systems and methods for compression and/or unification of statistical analysis system (SAS) data is provided. In one embodiment, a request to open a unified and compressed statistical analysis system (SAS) view file is received. The unified and compressed SAS data step view file including: an SAS data step view; compressed payload data to be used in the SAS data step view when decompressed; and a set of metadata describing characteristics of variables of the SAS data step view. Upon receiving the request, the compressed payload data is automatically decompressed, such that compressed payload data is decompressed and usable with the SAS data step view to render the SAS data step view and decompressed payload data on an electronic display of a client or host providing the request.

Abstract: A performance management system and method for generating a plurality of forecasts for one or more electronic devices is presented. The forecasts are generated from stored performance data and analyzed to determine which devices are likely to experience performance degradation within a predetermined period of time. A single forecast is extracted for further analysis such that computer modeling may be performed upon the performance data to enable the user to predict when device performance will begin to degrade. In one embodiment, graphical displays are created for those devices forecasted to perform at an undesirable level such that suspect devices may be subjected to further analysis.

Abstract: A performance management system and method for generating a plurality of forecasts for one or more electronic devices is presented. The forecasts are generated from stored performance data and analyzed to determine which devices are likely to experience performance degradation within a predetermined period of time. A single forecast is extracted for further analysis such that computer modeling may be performed upon the performance data to enable the user to predict when device performance will begin to degrade. In one embodiment, graphical displays are created for those devices forecasted to perform at an undesirable level such that suspect devices may be subjected to further analysis.

Abstract: Methods and systems are disclosed for determining a processor usage adjustment factor and for automatically applying the processor usage adjustment factor to provide an accurate processor usage estimate for an SMT processor. In one implementation, the methods and systems obtain samples of processor usage reported by the operating system at a predefined sampling rate over a predefined sampling interval. Thread states for the threads substantially corresponding to the reported processor usage are so obtained at the predefined sampling rate and over the predefined sampling interval. This sampling may be performed for servers running different applications and having diverse processing loads. An estimate of the distribution of the number of threads running for the processor usage reported may then be determined from the sampled data. A processor usage adjustment factor may then be derived, based on the distribution, and used to provide a more accurate processor usage estimate.

Abstract: Methods and systems are disclosed for determining a processor usage adjustment factor and for automatically applying the processor usage adjustment factor to provide an accurate processor usage estimate for an SMT processor. In one implementation, the methods and systems obtain samples of processor usage reported by the operating system at a predefined sampling rate over a predefined sampling interval. Thread states for the threads substantially corresponding to the reported processor usage are so obtained at the predefined sampling rate and over the predefined sampling interval. This sampling may be performed for servers running different applications and having diverse processing loads. An estimate of the distribution of the number of threads running for the processor usage reported may then be determined from the sampled data. A processor usage adjustment factor may then be derived, based on the distribution, and used to provide a more accurate processor usage estimate.

Abstract: A performance management system and method for generating a plurality of forecasts for one or more electronic devices is presented. The forecasts are generated from stored performance data and analyzed to determine which devices are likely to experience performance degradation within a predetermined period of time. A single forecast is extracted for further analysis such that computer modeling may be performed upon the performance data to enable the user to predict when device performance will begin to degrade. In one embodiment, graphical displays are created for those devices forecasted to perform at an undesirable level such that suspect devices may be subjected to further analysis.

Abstract: Methods and systems are disclosed for determining a processor usage adjustment factor and for automatically applying the processor usage adjustment factor to provide a processor usage estimate for an SMT processor. In one implementation, the methods and systems obtain samples of processor usage reported by the operating system at a predefined sampling rate over a predefined sampling interval. Thread states for the threads substantially corresponding to the reported processor usage are so obtained at the predefined sampling rate and over the predefined sampling interval. This sampling may be performed for servers running different applications and having diverse processing loads. An estimate of the distribution of the number of threads running for the processor usage reported may then be determined from the sampled data. A processor usage adjustment factor may then be derived, based on the distribution, and used to provide a processor usage estimate.

Abstract: A data management system for storing data in a multiple-level cache arrangement of a database comprises a multi-tier cache memory for initially storing all data in summary form in a secondary cache which may be the database; a processor for receiving requests for data and for moving requested data from the secondary cache to a primary cache, wherein, when subsequent requests for data are received, the primary cache is searched before the secondary cache; and for periodically synchronizing and merging all data in the primary cache back into said secondary cache to refresh said primary cache and remove stale information. The system is particularly useful for managing a telecommunications system call detail summary database in which telephone call details are collected as AMA records after the calls terminate and the AMA records are forwarded to a call detail database for storage in summary form and analysis by an external system, for example, for fraud analysis or billing purposes.

Abstract: A data management system for storing data in a multiple-level cache arrangement of a database comprises a multi-tier cache memory for initially storing all data in summary form in a secondary cache which may be the database; a processor for receiving requests for data and for moving requested data from the secondary cache to a primary cache, wherein, when subsequent requests for data are received, the primary cache is searched before the secondary cache; and for periodically synchronizing and merging all data in the primary cache back into said secondary cache to refresh said primary cache and remove stale information. The system is particularly useful for managing a telecommunications system call detail summary database in which telephone call details are collected as AMA records after the calls terminate and the AMA records are forwarded to a call detail database for storage in summary form and analysis by an external system, for example, for fraud analysis or billing purposes.

Abstract: The present invention relates to chromotropic nitrone spin trapping agents, methods of making these agents, compositions comprising same, and methods of their use. In particular, azulenyl nitrones of the present invention are effective agents for trapping free radical species and find use as efficient antioxidants in physicochemical and biological systems. Accordingly, the invention also relates to spin adducts formed from the combination of azulenyl nitrones with free radicals. The compounds of the present invention are readily prepared from available starting materials and find further use in assays and in a number of diagnostic, prophylactic and therapeutic applications, including but not limited to the alleviation, modulation and inhibition of the negative effects of carbon-centered or oxygen-centered radical species and other products of oxidation. Moreover, the combination adducts may be colorimetrically detected and, optionally, isolated and characterized to obtain valuable information (e.g.

Abstract: The present invention relates to chromotropic nitrone spin trapping agents, methods of making these agents, compositions comprising same, and methods of their use. In particular, azulenyl nitrones of the present invention are effective agents for trapping free radical species and find use as efficient antioxidants in physicochemical and biological systems. Accordingly, the invention also relates to spin adducts formed from the combination of azulenyl nitrones with free radicals. The compounds of the present invention are readily prepared from available starting materials and find further use in assays and in a number of diagnostic, prophylactic and therapeutic applications, including but not limited to the alleviation, modulation and inhibition of the negative effects of carbon-centered or oxygen-centered radical species and other products of oxidation. Moreover, the combination adducts may be calorimetrically detected and, optionally, isolated and characterized to obtain valuable information (e.g.