Abstract: It is presented a method for enabling allocation of resources for a plurality of hosts. The method is performed by a server (1) and comprises identifying (S100) a service running on one or more of the plurality of hosts, determining (S140) a stretch factor for a recurring load pattern for the service running on the one or more of the plurality of hosts, and storing (S150) the identified service together with the determined stretch factor. It is also presented a server, a computer program and a computer program product.

Abstract: Methods are described herein for creating and installing software updates which may be rolled back, without requiring large processing capabilities and/or large storage capacity at a device. Delta software updates are determined comprising differences, on a bit-level, between a first version of the software and a second, updated, version of the software, and metadata defining how to apply the differences. Methods of performing a rollback-capable update at a device are also described herein.

Abstract: A system is provided that includes a document validation within a non-relational database system that is capable of reviewing documents according to one or more validation rules. The document validator may be incorporated within a non-relational database engine and may perform validation operations when one or more database functions are performed.

Abstract: An example operation may include one or more of creating, by a blockchain user of a blockchain network, a world state checkpoint transaction requesting world state validation, endorsing, by one or more endorser nodes or peers, the world state checkpoint transaction, transferring endorsements to the blockchain user, recording, by an orderer node or peer, the endorsed world state checkpoint transaction into a block, validating and committing all transactions in the block, calculating and signing a hash of a current world state, by all blockchain nodes or peers of the blockchain network, and verifying, by the blockchain user, world state integrity from the calculated and signed hashes of the current world state.

Abstract: Technology is disclosed for recovering the consistency of a RAID (Redundant Array of Independent Disks) metadata database when data corruption is detected in the RAID metadata database. The RAID metadata database includes super sectors, stage sectors, and a data region. Valid data within the data region is a contiguous set of sectors extending from a head sector to a tail sector. In response to data corruption in one of the two super sectors, a set of pointers contained in the other super sector is used to identify the head sector and tail sector. In response to data corruption in both super sectors, the head sector and tail sector are located based on the contents of the sectors in the data region. Techniques are also disclosed for recovering consistency when the data corruption occurs in the stage sectors and/or data region.

Abstract: Techniques and apparatus for dynamic data access mode processes are described. In one embodiment, for example, an apparatus may a processor, at least one memory coupled to the processor, the at least one memory comprising an indication of a database and instructions, the instructions, when executed by the processor, to cause the processor to determine a database utilization value for a database, perform a comparison of the database utilization value to at least one utilization threshold, and set an active data access mode to one of a low-utilization data access mode or a high-utilization data access mode based on the comparison. Other embodiments are described.

Abstract: Scanning and rescanning detect state inconsistencies between data entities in repositories or other components of a distributed computing environment. First, entities are scanned based on a cutoff time TO. Entities for which state comparison is undesired are placed in a skipped entity list. Any inconsistencies found in other entities is reported. Then subsequent rescanning fetches state and attempts to pare down the skipped entity list. Rescanning may be capped. Inconsistencies may be detected without requiring downtime from services that update data entity state, and false reports of inconsistency may be avoided.

Abstract: Described are techniques for code review using Quantitative Linguistics (QL). The techniques include comparing received code to one or more repositories of code and identifying one or more portions of rare code in the received code that satisfy a rarity threshold relative to the one or more repositories of code. The techniques further include generating annotated code by annotating the received code at the one or more portions of rare code and transmitting the annotated code to a testing platform.

Abstract: The invention comprises a decentralized consensus protocol for blockchains in which the computation can be used to search for good approximate solutions to any optimization problem. This protocol allows the wasted energy to be used for finding approximate solutions to problems submitted by any nodes (called clients). This protocol works in a similar way to proof-of-work, and it makes nodes evaluate a large number of solution candidates to add a new block to the chain. A client provides a search program that implements any search algorithm that finds a good solution by evaluating a large number of solution candidates. The node that finds the best approximate solution is rewarded by the client.

Abstract: Various embodiments of the present application set forth a computer-implemented method that includes transmitting, by a wearable device, a first request that includes a first set of parameters, receiving, by the wearable device, a first set of values based on the first set of parameters, wherein the first set of values are provided by a first data source, displaying, by the wearable device, a first dashboard that includes a first visualization associated with the first set of values, determining that a first physical interaction with a first physical input device associated with the wearable device occurred, and in response to the first physical interaction, causing the first visualization to display a first data value included in the first set of values.

Abstract: The subject technology inserts, by a first transaction, a new version of an object, the inserting corresponding to a first statement from the first transaction, the first statement including information indicating a first key, a first transaction identifier, a first statement number, and a first restart count. The subject technology performs, by a second transaction, a range read, the range read including information indicating the first key. The subject technology receives, after performing the range read, a set of conflicting transactions. The subject technology determines that a conflict occurred between the first transaction and a third transaction from the set of conflicting transactions.

Abstract: A central server receives API calls requesting services. The central server identifies whether the API calls are associated with a merchant. A distribution is constructed based on the API calls. The central server further executes a pre-defined rule to identify a set of the API calls belonging to a maximum percentile in the distribution and a set of the API calls belonging to a minimum percentile in the distribution before estimating a set of the anomalous data points with one or more goodness of fit functions against the maximum percentile and the minimum percentile. A GUI receives a critical value from a user. In response to receiving the critical value, the central server generates probabilities of the set of the anomalous data points before displaying a set of the anomalous data points in response to the probabilities being less than the critical value.

Abstract: Storage devices can be configured to desirably reduce the number of times a zone reset or erasure occur via the use of one or more paired overwrite memory blocks. These storage devices can include a plurality of memory devices with some of these memory devices designated as overwrite memory devices. A controller within the storage device can be configured to direct the storage device to generate one or more subsets within the memory devices such as zones, pair each of subsets with at least one or more overwrite memory devices, store data sequentially within the subset of memory devices, and store any received overwrite data in the overwrite memory devices in chronological order. Data stored within the subsets of memory devices are not erased and instead of being overwritten directly, are instead pointed via a control table to a location in the overwrite memory devices storing the corresponding overwrite data.

Abstract: Exemplary methods, apparatuses, and systems include a destination node receiving, from a source node, a hash of data stored by the source node and designated for transfer from the source node to the destination node. In response to determining the hash received from the source node maps to data stored by the destination node, the destination node reads the data into a write buffer and transmits an indication to the source node that the data is present at the source node. The destination node reads the data from write buffer and, in response to determining the data read from the write buffer remains unchanged as stored by the destination node, increases a reference count for the data as stored by the destination node.

Abstract: Techniques for storage management involve: if it is determined that a source storage slice of a file system is to be recycled, identifying, from the source storage slice including a plurality of storage blocks, an orphan storage block that is inaccessible by a client of the file system; replicating data of the orphan storage block to a target storage block, the target storage block being located in a target storage slice within a predetermined isolation area of the file system; and generating second metadata of the target storage block based at least on first metadata of the orphan storage block, the second metadata including at least an identification of the orphan storage block. Therefore, the management performance can be improved, and the storage costs can be reduced.

Abstract: A cloud-based data protection service is disclosed. In an embodiment, the data protection service may support backup of data sets from one or more sites associated with one or more organizations. In an embodiment, deduplication of backup data across multiple sites of an organization and/or multiple sites associated with different organizations may be supported. In an embodiment, backup data may be post-processed in the cloud to insert fingerprints corresponding to data blocks that did not change since a previous backup was performed, to scan the backup for security threats such as viruses, other malware, personally identifiable information, etc. In an embodiment, restore may be supported from the cloud, where restore blocks may be larger than backup data blocks. In another embodiment, restore may be based on blocks that have changed since the most recent backup (or a user-selected backup).

Abstract: A database command replacer intercepts database commands to one or more database servers, extracts the database command and defined parameters within the command, and determines if the database command is defined in the list of commands subject to replacement; if not, the command is passed through to the destination database server. If the database command is in the list of commands subject to replacement, the replacement command is retrieved, the mapped parameter values are incorporated into the replacement command, the replacement command is transmitted to the destination database server, and the resultant information is relayed back to the origination program. No changes are required to either the client or server software in existing client/server database arrangements.

Abstract: An apparatus includes a processing device comprising a processor coupled to a memory, with the processing device being configured, in conjunction with synchronous replication of at least one logical storage volume between first and second storage systems, to acquire an address lock for a set of pages of the logical storage volume starting from a particular page of the logical storage volume, to determine content-based signatures for respective pages of the set of pages, to compute an additional signature as a function of the content-based signatures, and to send the additional signature and a pointer to the particular page from the first storage system to the second storage system, so as to permit the second storage system to verify consistency of the set of pages in the second storage system relative to the set of pages in the first storage system. Such operations are repeated for other sets of pages.

Abstract: Embodiments of the present disclosure provide a method, device, and computer program product for managing cache. There is provided a method of managing a cache, comprising: receiving a current operation request from a user, data requested by the current operation request being to be duplicated to the cache; obtaining a plurality of historical operation requests of the user, the plurality of historical operation requests being received prior to the current operation request; determining a predicted operation request for the user based on the plurality of historical operation requests and the current operation request; and in accordance with determining that a type of an operation associated with the predicted operation request belongs to predetermined types, adjusting data in the cache based on the predicted operation request.

Abstract: A method for improving consensus in a blockchain network through decentralized grouping includes: identifying, by each node of a plurality of nodes in a blockchain network that manages a blockchain, a plurality of groups, where each is comprised of a subset of nodes; generating, by each node in each subset of nodes, a new block for the blockchain; performing, by each subset of nodes, a first consensus operation among all nodes in the subset of nodes for the new block generated by in the subset of nodes to identify a group consensus block, where each node in the subset of nodes receives the group's group consensus block; and performing, by the blockchain network, a second consensus operation among all groups for the identified group consensus block to identify an overall consensus block, where a majority of groups of the plurality of groups receives the overall consensus block.

Abstract: Systems and methods are described for processing records associated with a query that identifies an association between two data fields. The system can obtain a chunk of data that includes multiple records based on a query received by a data intake and query system. At least one record can include multiple sub-records that share a field value for at least one field. The system can generate a record from each sub-record and assign the generated records to one or more groups of partitions. The system can combine record data of generated records assigned to one partition of a group of partitions and then combine record data across the group of partitions. The system can process the results of the combination of records across the group of partitions based on the query.

Abstract: A microservice or serverless process consistency check process comprising locating all the necessary metadata and data objects in the cloud by storing the data objects in the cloud and synchronously mirroring the metadata, which is separately stored in local storage, to the cloud. The process generates a list of data objects in the cloud as “Set A” and the list of metadata objects in the same prefix range as the data objects as “Set B.” The consistency check then verifies whether all objects in Set A are referred to by objects in set B. In the case where there are gaps between the sets, non-existent objects are marked as missing, and unreferenced objects are marked as orphan objects. The list of missing and orphan objects is then sent back to the backup server for analysis and further processing.

Abstract: Advanced resource selection is disclosed. A request from a client to resolve an augmented domain is received at a Domain Name System (DNS) server. Information is extracted from the augmented domain name. The extracted information is used to select a particular resource from a set of resources to provide content to the client.

Abstract: A storage array uses paged metadata. Each storage director has access to a plurality of object storage systems which describe locations of paged metadata in backing storage. Each object storage system includes different types of inodes which describe objects in backing storage. The object storage systems are used to locate and relocate metadata for loading into global memory, and creation and deletion of objects. An object storage system may be selected based on factors including ratio of different inode types, locality of object usage and anticipated object activity level.

Abstract: Systems and methods are provided for generating reports reflecting a visualization of, e.g., a dataset on which data analysis has been performed. The data analysis performed on the dataset may be an aggregation of data analysis functionality provided by applications or tools. Dataset visualization is realized in a workspace implemented by a separate application or tool. Potential conflicts regarding updating one or more elements of the dataset are reconciled by implementing a dual operational transform system and method. A global state of the dataset may be determined by a first operational transform system and method, while a local state of the dataset may be determined by a second operational transform system and method. The local state of the dataset may be updated through operational transforms exchanged between the first and second operational transform systems that align the local state of the dataset with the global state of the dataset.

Abstract: The disclosed embodiments also include monitoring and metering services of the data fabric service (DFS) system. Specifically, these services can include techniques for monitoring and metering metrics of the DFS system. The metrics are standards for measuring use or misuse of the DFS system. Examples of the metrics include data or components of the DFS system. For example, a metric can include data stored or communicated by the DFS system or components of the DFS system that are used or reserved for exclusive use by customers. The metrics can be measured with respect to time or computing resources (e.g., CPU utilization, memory usage) of the DFS system. For example, a DFS service can include metering the usage of particular worker nodes by a customer over a threshold period of time.

Abstract: Systems and methods are disclosed for processing queries against multiple dataset sources. One dataset source can include indexers that index and store data. The system can receive a query that identifies a set of data to be processed and a manner of processing the set of data. The set of data can include a first dataset that is accessible by one or more indexers and a second dataset that is accessible by one or more other dataset sources. A query coordinator can define a query processing scheme for obtaining and processing the set of data that includes a dynamic allocation of multiple layers of partitions. The partitions can operate on multiple worker nodes. The query can then be executed based on the query processing scheme.

Abstract: The disclosure relates to a system, computer readable medium, and method for automated data verification. The disclosure provides highly automated, customizable ways of verifying the integrity of large sets of data to ensure that data migration has occurred correctly. Namely, source data is converted into spreadsheet files using a customizable set of field definitions and then filtered to identify corresponding sets of data to be verified. Once filtered, the data in the spreadsheets are converted in hashmaps, which can easily and efficiently be compared to each other to find any inconsistencies in the data. Accordingly, as a result of this process, large sets of source data can be error checked in an efficient manner that saves computing processing power and time. This disclosure therefore addresses the problem of how to perform comparisons of various data across multiple source systems in large volumes.

Abstract: A data processing system configured to perform: obtaining a first data lineage representing relationships among physical data elements, the first data lineage being generated at least in part by performing at least one of: (a) analyzing source code of at least one computer program configured to access the physical data elements; and (b) analyzing information obtained during runtime of the at least one computer program; obtaining, based on user input, a second data lineage representing relationships among business data elements; obtaining an association between at least some of the physical data elements of the first data lineage and at least some of the business data elements of the second data lineage; and generating, based on the association between the physical data elements and the business data elements, an indication of agreement or discrepancy between the first data lineage and the second data lineage.

Abstract: Methods, systems, and computer-readable storage media for receiving, by an adaptive job server, a first document, determining, by the adaptive job server, a validation status of the first document based on one or more document-level pre-requisites associated with the first document, transmitting, by the adaptive job server, the first document to a first proxy server in response to determining that the validation status of the first document is true, determining, by the first proxy server, a validation status of the first proxy server based on one or more server-side pre-requisites for scheduling the first document, and scheduling, by the first proxy server, the first document for publishing to one or more users in response to determining that the validation status of the first proxy server is true.

Abstract: A method of transmitting data, composing: transmitting a plurality of first Real-time Transport Protocol (RTP) data packets to a receiving end over an RTP data link established with the receiving end; receiving a retransmission indication message sent by the receiving end, the retransmission indication message being intended to indicate an RTP data packet to be retransmitted among the plurality of first RTP data packets; encapsulating the RTP data packet to be retransmitted according to the retransmission indication message to obtain a second RTP data packet, wherein the second RTP data packet composes an RTP padding field intended to indicate that the second RTP data packet is a retransmitted RTP data packet, and a type flag of the second RTP data packet is same as a type flag of the first RTP data packet and transmitting the second RTP data packet to the receiving end over the RTP data link.

Abstract: A metadata validation tool includes a retrieval engine, an extraction engine, a preparation engine a validation engine, and an export engine. The retrieval engine receives a sequential data file comprising a data table, the data table comprising a plurality of rows and a plurality of columns and the data table further comprising a plurality of data entries, wherein each data entry is placed in the data table at the intersection of one of the plurality of rows and one of the plurality of columns. The extraction engine extracts metadata from the sequential data file for at least one of the plurality of columns of data, wherein the metadata identifies the data table and a plurality of metadata identifiers. The extraction engine determines a metadata identifier for the extracted metadata, wherein the metadata identifier identifies a data field indicating a data type.

Abstract: A data collection system that provides the means to collect, store and make data available for a location analytics inference pipeline. The system incorporates a feedback mechanism enabling algorithms produced from the inference pipeline to drive the collection strategy to yield higher data quality and to produce reference data for model validation.

Abstract: A computer-implemented method for proactive change verification is provided. Aspects include analyzing runtime execution characteristics from a plurality of base activity metrics and a plurality of experimental activity metrics and creating a plurality of activity pairs wherein each activity pair comprises a base activity metric and its corresponding experimental activity metric. Aspects also include identifying significant activity pairs from the plurality of activity pairs wherein the experimental activity significantly deviates from its corresponding base activity and classifying significant activity pairs by deviation type. Aspects further include sorting activity pairs by their impact and removing activity pairs that have an impact of less than a threshold amount, wherein the threshold amount is based on the deviation type.

Abstract: Disclosed are methods and systems for of determining snapshot storage space consumption in a data storage system, a snapshot being a representation of a given state of a data object comprising of direct references to data blocks for data that has been changed from a prior state and indirect references to existing direct references in the prior state for unchanged data, the method comprising the steps: for each write of data to a given snapshot of the data object, storing unique address information relating to the unique direct references for said writes, said unique address information comprising at least a count of unique direct references; upon generating a further snapshot of a prior snapshot, retaining said prior snapshot and unique address information in storage as read-only access; and determining a count of unique direct references for all snapshots relating to the data object based on the stored unique address information.

Abstract: A system for providing a multi-tenant data protection application includes a server shared by all tenants for access to the provided multi-tenant data protection application. The system further includes business logic for managing tenants of the multi-tenant data protection application, tenant resource allocation and isolation of tenant operating environments. The system additionally includes a database server for creating, managing and maintaining databases, including a master database used to store configuration and monitoring data which is used for tenant management and monitoring, and a plurality of private tenant databases, each used to store tenant-specific configuration, tenant-specific data and associated tenant resources. The system includes one or more data protection engines configured to store a copy of protected data at tenant redundant data stores.

Abstract: The systems and methods disclosed herein relate to using the clusters of a file to store versioning of a dataset. When the dataset is initially stored, a file is created that is twice the size of the dataset. The file may include one cluster (or a first set of clusters) that is marked as active and a second cluster (or a second set of clusters) that are marked inactive. The dataset is initially saved to the active cluster(s), and a version number is stored with the dataset. When the dataset is next saved, an application scans the file to determine whether there is (or are) an inactive cluster(s). If there is an inactive cluster(s) the second version of the dataset is saved to the inactive clusters. Both clusters are then marked active.

Abstract: A method and system for comparing at least two structured data files. A computer polls at least one network device for data files. The computer determines a structural difference between a first data file and a second data file and creates at least one patch file based on the structural difference. The computer extracts at least one span from the at least one patch file, wherein the at least one span is defined by a starting point byte and a length measured in bytes and creates an ordered listing. The computer performs a lexer operation using the at least one span as a limiting criterion to limit an output of the lexer to statements that include the at least one span. The computer outputs the statements indicating changes in a configuration between said first and second data files.

Abstract: Techniques are provided for more efficient multi-row atomic, consistent, isolated and durable (ACID)-compliant transactions with snapshot isolation semantics (or just “multi-row transactions” for short). In some embodiments, the techniques are implemented in a computing system that includes a client application, a lightweight in-memory lease-based lock service, a multi-row transaction orchestrator, and an underlying database system. The transaction orchestrator implements a read protocol and a write protocol that provides support to the client application for carrying out multi-row transactions against the underlying database system irrespective of whether the database system itself supports multi-row transactions. The transaction orchestrator explicitly maintains transaction-level locks obtained from the lease-based lock service as part of the transaction protocol.

Abstract: A distributed file system (DFS) is provided that is configured to store data in a General Parallel File system (GPFS) and interface with a client configured to interface with a HADOOP Distributed File System (HDFS). The DFS includes a first Node; and a plurality of second Nodes including the GPFS. The first Node is configured to convert an HDFS command from the client into a GPFS command, apply the GPFS command to the GPFS to access a GPFS file, format an HDFS data structure to include identifiers of a set of the second nodes storing the GPFS file, a filename of the GPFS file, and an offset into the GFPS file, and send the HDFS data structure to the client. Each of the second Nodes is configured to access the GPFS using a part of the HDFS data structure received from the client.

Abstract: Systems and methods for developing user interfaces. User interfaces are previewed by including plugins in a preview user interface. A preview user interface includes a preview of a plugin in the context of a live user interface. The preview user interface is generated from preview web assets that are a copy of the web assets used for the live user interface except for the plugin. The plugin is written to the preview web assets and the preview user interface can then be previewed as if the plugin were part of the live user interface. Once the plugin is approved, the plugin can be incorporated into the live user interface.

Abstract: Methods, systems, and techniques for validating road intersections are presented. The method includes receiving annotated intersection data that, for each lane of a particular candidate intersection, indicates one or more attributes of the lane; processing the annotated intersection data to generate an intersection fingerprint for the particular candidate intersection that is sensitive to a topological structure of the lanes of the particular candidate intersection and is invariant to a geometry of the lanes of the particular candidate intersection; designating the particular candidate intersection as validated without performing the one or more quality control processes based at least on the intersection fingerprint; and storing a representation of the particular candidate intersection in the roadgraph.

Abstract: Disclosed is a system, method, and computer program product for analyzing sets of data in an efficient manner, such that analytics can be effectively performed over that data. Classification operations can be performed to generate groups of similar log records. This permits classification of the log records in a cohesive and informative manner.

Abstract: A distributed system is provided that includes member nodes and a leader node. Each member node stores a database and updates the database by performing common ones of a plurality of transactions. The leader node generates a batch, to be executed by each member node, which includes two or more transactions lacking an access conflict from among the plurality of transactions. The leader node includes: a section that generates an access set as a set of database entries to be accessed by each transaction to be executed; a section that generates the batch, based on the access set of each transaction to be executed; and a leader-side section that performs a consensus process for the batch among the leader and member nodes. Each member node includes the database; a member-side section that performs a consensus process for the batch; and a section that performs parallel execution of batch transactions.

Abstract: A personality-type training gamification system that includes a communications link configured to receive one or more communications, an analysis processor in bi-directional communication with the communications link with a plurality of non-transitory computer readable instructions stored in association therewith that are accessible to, and executable by, the processor, wherein the plurality of instructions, when executed receive the one or more communications from the communications link, analyze the one or more communications to identify personality types associated with the one or more communications, provide an overview of each identified personality type to a user; and provide one or more games or quizzes to the user and instructions to take the one or more games or quizzes to test the user's knowledge of the plurality of personality types provided; and a display device configured to display to the user at least a performance analysis for the user.

Abstract: Disclosed herein are system, method, and computer program product embodiments for performing a database migration with reduced downtime. Embodiments provide for migrating a source database table at a source database system to a target database table at a target database system. The embodiments provide for configuring the source database system to log changes to the source database table to a log, wherein the log is configured to replay the changes to the target database table and creating a replacement view table at the target database system, wherein the replacement view table provides access to current data from the source database table and the target database table. This approach allows access to the current data as replication continues without the need to take down access to the database.

Abstract: Techniques and solutions are described for detecting malicious database activity, such as SQL injection attempts. A first machine learning classifier can be trained by comparing processed and unprocessed user input, where a difference between the two can indicate suspicious or malicious activity. The trained classifier can be used to analyze user input before query execution. A second machine learning classifier is trained with a data set that includes call stack information for an application requesting execution of a dynamic query and query statistics associated with processing of the query at the database. The query of the application can be correlated with a corresponding database query by hashing the application query and the database query and comparing the hash values, where matching hash value indicate a common query. The trained classifier can monitor execution of future queries to identify queries having anomalous patterns, which may indicate malicious or suspicious activity.

Abstract: Disclosed is a technique that can be performed in a distributed computer network. The technique can include a data index and query system that receives a search query and defines a search scheme for applying the search query on distributed data storage systems including an internal data storage system of the data intake and query system and an external data storage system communicatively coupled to the data intake and query system over a network. The data index and query system communicates at least a portion of the search scheme to a search service for application on behalf of the data intake and query system, receives from the search service a search result of the search query obtained by application of the search scheme to the distributed data storage systems, and causes the search result or data indicative thereof to be displayed on a display device.

Abstract: Disclosed is a technique that can be performed in a distributed network. The technique can include a search service system that receives an indication of at least a portion of a search scheme to cause worker nodes to obtain search results from distributed data storage systems. The search scheme is defined by a data intake and query system. The search service system defines a search process based on the at least a portion of the search scheme and executes the search process to cause the worker nodes to obtain search results from the distributed data storage systems. The search service system receives a combination of search results based on the search results obtained by the worker nodes from the distributed data storage systems, and causes an output based on the combination of search results obtained by the data intake and query system in accordance with the search scheme.

Abstract: Techniques involve managing a storage system. Along these lines, for each of a plurality of snapshots, a plurality of blocks referenced by the snapshot is determined. An evaluation score indicating an impact that deletion of the snapshot has on space release and data retention is determined based on at least one of: a reference count for the plurality of blocks, a size of a storage resource associated with the snapshot, and the number of blocks of the plurality of blocks that are referenced only once. At least one snapshot to be deleted is selected from the plurality of snapshots based on respective evaluation scores of the plurality of snapshots.