Abstract: Techniques are described herein for routing queries to particular nodes of a multi-node database system based on the query. A database table is partitioned into a plurality of affinity groups. Each affinity group is assigned a particular node as the master node of the affinity group. A mapping is sent to a query router indicating the master node for each affinity group of the plurality of affinity groups. The query router determines, for a particular query, a target node to which to send the particular query based on the mapping and the particular query.

Abstract: The present invention refers to the field of transactional data management. The invention provides a transactional semantic concurrency control system for managing a database, wherein the system comprises a data store engine which is adapted to manage the database comprising value rows, and each value row comprising a primary key uniquely identifying each row, at least one semantic column and a commit timestamp; wherein the data store engine is further adapted to manage operation rows, which are rows comprising a primary key, at least one operation to be applied over at least one semantic column of a value row identified by the primary key, and a commit timestamp; store the value rows and the operation rows; generate an operation row when it receives an operation that inserts, updates, upserts, and/or deletes a row of the database with the commit timestamp of the operation; and apply the operations of at least one operation row when a trigger condition is satisfied.

Abstract: A network adapter within an industrial input/output (I/O) system includes one or more processers. The one or more processors are configured to: receive a first combination; determine whether the first combination matches a predefined lock combination; upon determining that the first combination matches the predefined lock combination, start a lock process; receive a second combination; determine whether the second combination matches a predefined lock key; and upon determining that the second combination matches the predefined lock key, lock the adapter.

Abstract: Systems and methods for object-based data storage are provided. There may be a read/write cache configured to cache objects to be written to an object-based data storage. A document in the read/write cache may have a lock state set to unlocked, thereby allowing the document to be deleted. Or, the document in the read/write cache may have a lock state set to locked, thereby preventing deletion of the document.

Abstract: A containerized environment and application that are configured for component specific continuous replication and granular application level application. A key value store, which stores key values related to configuration data of the containerized application, is replicated continuously to a replicated key value store at a replica site. Persistent volumes may also be replicated to a replica site. The replication can be performed to multiple replica sites in an application specific manner.

Abstract: A database is stored as a plurality of database shards in a distributed database grid comprising a plurality of grid elements, each including a mid-tier database system. A first grid element receives, from an application executing in the same memory as a mid-tier database system of the first grid element, a first database transaction including at least one database operation on specific data stored in a first database shard that belongs to the first grid element. The first grid element performs and commits the first database transaction without participation of another grid element of the plurality of grid elements. The first grid element receives a second database transaction that requires access to another database shard that does not belong to the first grid element. Multiple grid elements of the plurality of grid elements perform the second database transaction and commit the second database transaction using a two-phase commit protocol.

Abstract: In a data read method a plurality of tuples meeting a read condition are determined in a case that the data read request is received and according to a read condition carried in the data read request. Global transaction statuses of a plurality of global transactions corresponding to the plurality of tuples are obtained. Global commit times of the plurality of global transactions according to the global transaction statuses of the plurality of global transactions are obtained. Then a target tuple from the plurality of tuples is determined based on the global commit times of the plurality of global transactions, the target tuple being visible relative to the data read request.

Abstract: A method provides computer-generated contextual data to an end-point during a digital transaction. The method includes receiving a trigger message relating to a digital transaction between a consumer and a second entity. The trigger message includes a consumer identifier uniquely associated with the consumer and transaction details at least including a characteristic associated with the digital transaction. A data message including information based on an evaluation of the transaction details against a consumer-linked transaction matrix is obtained. The consumer-linked transaction matrix is linked to the consumer and includes information relating to the digital transaction. The data message is transmitted to a remote device with which the consumer interacts during pendency of the transaction and is configured to cause the device to output a prompt to the consumer displaying the data message.

Abstract: A method is disclosed, comprising receiving, at a build service, an external dataset and an adaptor associated with the external dataset, the external dataset being in a format which is not managed by the build server. The method may also comprise querying the adaptor, by the build service, for information related to the external dataset. The method may also comprise receiving, at the build service, the information related to the external dataset; and causing, by the build service, the external dataset to be input into a build pipeline using the information related to the external dataset.

Abstract: A computing device is provided, including non-volatile memory storing a database including a table having a plurality of rows. The computing device may further include a processor configured to receive a request to perform a first transaction on a row. The processor may assign a first transaction identifier (TID) of the first transaction to the row. The processor may impose a first exclusive TID lock on the first TID of the row and may impose a first exclusive data lock associated with the first transaction on the row. The processor may perform the first transaction on the row. Performing the first transaction may include modifying the table as stored in the memory. In response to completing the first transaction, the processor may release the first exclusive data lock on the row and release the first exclusive TID lock on the first TID of the row.

Abstract: A computing device includes an interface configured to communicate with a second computing device, a memory configured to store a first copy of a file that is synchronized with a second copy of the file stored at the second computing device, and a processor. The processor is configured, in response to receiving an update to the file while the interface is unable to communicate with the second computing device, to access versioning management data indicating synchronization settings associated with each of a plurality of files that includes the file. The processor is configured to, conditioned on determining that the versioning management data indicates a first synchronization setting associated with the file, write the update to the first copy, and conditioned on determining that the versioning management data indicates a second synchronization setting associated with the file, refrain from writing the update to the first copy.

Abstract: A system, method, and computer-readable medium are disclosed for performing a human experience operation. The human experience operation includes receiving standardized human experience concepts and categorized human experience concepts; performing an analysis operation, the analysis engine receiving the categorized corresponding concepts and mapping the categorized human experience concepts to human experience enhancement objectives to provide a mapped human experience insight; and, providing the mapped human experience insight to a results engine, the results engine using the mapped human experience insight generate a human experience recommendation.

Abstract: Optimizing file system resource reservation is presented herein. The method comprises dividing a virtual file system address space into subspaces, initializing the subspaces with volume slices of a group of volume slices comprising a first volume slice, a second volume slice, and a collection of reserved volume slices allocated based on an allocation pattern that allocates volume slices as a function of a quantitative relationship between a first value associated with a first volume slice and a second value associated with a second volume slice, determining that a data block count is insufficient to service a write operation of user data to the second volume slice; and provisioning a second subspace with a free volume slice obtained from the collection of reserved volume slices, and wherein the provisioning of the second subspace with the free volume slice is performed without invoking a memory exclusion mechanism.

Abstract: A control module transferring data between a shard and destination shards within a database comprising a plurality of shards, the control module: generating a first hash wheel distribution of shard allocations by applying a defined hashing function to a first integer value per shard allocation; generating a further hash wheel distribution of shard allocations by applying the defined hashing function to a further integer value per shard allocation; determining a range of hash values associated with data to be transferred between the shard and a destination shard, wherein the range of hash values, the shard and the destination shard are defined based on determining a difference between the first hash wheel distribution of shard allocations and the further hash wheel distribution of shard allocations; selecting and controlling the transfer of data associated with the determined range of hash values between the shard and the destination shard.

Abstract: The present disclosure provides a method of reading data maintained in a tree data structure, such as B+ tree, using near data processing (NDP) in a cloud native database. According to embodiments, a desired LSN will be used in NDP page reads on the master computing node (e.g. master SQL node). When the master computing node (e.g. master SQL node) reads the regular page, the maximum desired LSN (e.g. the latest page version number) for that regular page will be used. Embodiments use features of the desired LSN and page locking, wherein correct versions of pages can be obtained by using the desired LSN associated with a page, in combination with page locking, and can enable the reading of a consistent tree structure and achieve good read/write concurrency.

Abstract: The subject technology performs a search for a key in a regular space to locate a first visible version of the key. The subject technology determines that the first visible version of the key is not one of a N number of newest versions of the key. The subject technology performs a search of an undo space to locate a second visible version of the key. The subject technology determines whether the first visible version or the second visible version of the key is newer. The subject technology provides a newer version of the key between the first visible version and the second visible version of the key.

Abstract: The technologies described herein are generally directed toward maintaining data coherence after an updating node fails during an update. According to an embodiment, a system can comprise a processor and a memory that can enable performance of operations including, based on first updating activity by first updating equipment, locking a portion of a data structure for updates with a lock, where the first updating equipment has been determined to have abnormally ceased the first updating activity, resulting in an update activity failure. The operations can further include receiving, by the computing equipment, from second updating equipment, an indication of the update activity failure, during second updating activity of the portion. Further, the operations can include, based on the indication, reconciling, by the computing equipment, the second updating activity and the update activity failure.

Abstract: A tool for replacing a first database node of a database management system by a second database node. The tool receives an indication that the first database node received a data access request for accessing a database shared between the first database node and the second database node. The tool duplicates the data access request at the first database node. Responsive to a determination that the duplicated data access request includes a data changing statement and a previously executed statement, the tool modifies the duplicated data access request to prevent execution of the data changing statement and the previously executed statement at the second database node. The tool executes the modified duplicated data access request at the second database node. The tool replaces, based on a replacement condition being met, the first database node with the second database node in the database management system.

Abstract: Systems and methods for data replication. A data processing service can present a user interface configured to receive a data fusion algorithm from a user, and a request to execute a job, each job including instructions to copy data from one of a plurality of source databases to one of a plurality of target databases, and can present a plurality of virtual machines, each virtual machine comprising: a processing unit configured to attempt to start the job requested by the user, when the job can be started, lock the job from the rest of the plurality of virtual machines, and execute the job according to the data fusion algorithm using a random access memory (RAM) memory bucket.

Abstract: Methods and systems are described for managing a shared database. One or more processing nodes may access a shared database. A common log node may manage the shared database. The common log node may validate database operations requested by the one or more processing nodes. During validation, the common log node may detect conflicts that occur between database operations requested by the one or more processing nodes.

Abstract: Herein are high throughput techniques for incorporating cryptographic blockchains into relational data. In an embodiment, a computer indicates, in a database dictionary in a database, that a relational table is for blockchain storage. The relational table contains application column(s). In response to that indication, the relational table is associated with system column(s) that are unmodifiable by administrators and clients of the database. The system column(s) include a cryptographic hash column. A request to store a particular value in a particular application column is received from a client. In response to receiving the request, a cryptographic hash value is calculated for a new row for the relational table. In the relational table, the computer stores the new row that contains: the particular value in the particular application column, and the cryptographic hash value in the cryptographic hash column.

Abstract: A computer comprising one or more processors and memory may implement multiple threads performing mutually exclusive lock acquisition operations on disjoint ranges of a shared resource each using atomic compare and swap (CAS) operations. A linked list of currently locked ranges is maintained and, upon entry to a lock acquisition operation, a thread waits for all locked ranges overlapping the desired range to be released then inserts a descriptor for the desired range into the linked list using a single CAS operation. To release a locked range, a thread executes a single fetch and add (FAA) operation. The operation may be extended to support simultaneous exclusive and non-exclusive access by allowing overlapping ranges to be locked for non-exclusive access and by performing an additional validation after locking to provide conflict resolution should a conflict be detected.

Abstract: A method comprises receiving from a distributed app (dApp), a shard creation transaction in a blockchain block of a blockchain. he block may comprise multiple shards. Next, the method comprises collecting, with a join block in the blockchain, transactions. The join block is adjacent to the blockchain block. Next, the method includes encapsulating the shard creation transaction; applying the block including the shard creation transaction to yield a new shard in the block; and broadcasting the block. The join block executes cross shard transactions without impacting the parallel execution of intra-shard transactions with computer threads by separating inter-shard and intra-shard transactions into different blocks. Without join block, parallel executing intra shard threads in computer threads may need to lock the database states since inter-shard transactions may also write to it from different computer thread. Not sure if we need to make this clear in our claims regarding join block.

Abstract: A data intake and query system can manage the search of large amounts of data using one or more processing nodes. When a new processing node is added or becomes available, the node coordinator can reassign duties from one or more processing nodes to the new processing node. The node coordinator can initially assign the new processing node one or more groups of data for backup purposes. At a later time, the node coordinator can reassign the new processing node to the one or more groups of data for searching purposes.

Abstract: Change notify responses can be utilized to inform a remote computer that a file or directory that is being monitored has changed. A change notify response can include a path name to the file or directory being referenced. In some examples, a cache of path names can be maintained in a user space of a server implementing change notify responses. When a module that generates a change notify response does generate such a response, the module can first access the cache to determine if the relevant path name is located in the cache. Where the relevant path name is not located in the cache, the module can obtain the path name from kernel space and store it in the cache.

Abstract: A system and method for providing computer-generated contextual data to an end-point during a digital transaction is provided. A method includes receiving a trigger message relating to a digital transaction between a consumer and a second entity. The trigger message includes a consumer identifier uniquely associated with the consumer and transaction details at least including a characteristic associated with the digital transaction. A data message including information based on an evaluation of the transaction details against a consumer-linked transaction matrix is obtained. The consumer-linked transaction matrix is linked to the consumer and includes information relating to the digital transaction. The data message is transmitted to a remote device with which the consumer interacts during pendency of the transaction and is configured to cause the device to output a prompt to the consumer displaying the data message.

Abstract: An endpoint of a distributed federation with proxy synchronization including a data center infrastructure, a storage, and an endpoint. The storage stores a state of the data infrastructure and further stores a mirrored state for each of at least one other endpoint. The endpoint includes a communication interface for communicating via a communication network, where the endpoint, in response to receiving a command via the communication interface for changing the mirrored state, forwards the command towards an endpoint that owns the mirrored state via the communication interface. Commands may be forwarded directly or indirectly via one or more intermediary endpoints. An owner endpoint receives a command, updates its local state, and sends one or more events to one or more proxy endpoints to update corresponding mirrored states. A restricted proxy endpoint may store a partial mirrored state. The federation may support bidirectional sharing, synchronization, and resource data sharing.

Abstract: Embodiments of the present disclosure relate to a method, system, and computer program product for block level lock on a data table. According to the method, in response to first transactional processing to be applied on a data table, one or more processors determine that first target data to be accessed during execution of the first transactional processing is comprised in a continuous range of data in the data table. One or more processors determine whether a block lock is available for locking the continuous range of data for the first transactional processing. In accordance with a determination that the block lock is available, one or more processors grant the first transactional processing with the block lock, the block lock being associated with lock information indicating the continuous range of data.

Abstract: Examples include a multi-node cluster having a node with a clustering layer. The clustering layer may be located between an application programming interface (API) layer and a service layer and the multi-node cluster may be associated with a database. In some examples, the clustering layer may discover whether a number of nodes associated with the multi-node cluster has changed. Based, at least in part, on the determination that the number of nodes associated with the multi-node cluster has changed, at the clustering layer, the database may be sharded and a new API call may be issued to the API layer.

Abstract: A method for accessing a computer-numerically-controlled machine can include receiving a command to be executed by the computer-numerically-controlled machine. A hardware state of a component in the computer-numerically-controlled machine can be determined by receiving, from the component, data indicative of the hardware state. An origin of the command including a user identification of a user who sent the command and/or a machine identification of a device that sent the command can be determined. Whether the computer-numerically-controlled machine is allowed to execute the command can be determined by applying a set of rules and based on the hardware state and/or the origin of the command. In response to determining that the computer-numerically-controlled machine is allowed to execute the command, the command can be executed at the computer-numerically-controlled machine.

Abstract: In general, the invention relates to a method for performing operations. The method includes protecting a database includes detecting a first trigger event for a first backup operation targeting an user asset of a client device of client devices, wherein the first trigger event specifies first metadata associated with the first backup operation, acquiring a first byte-range lock associated with a backup type specified in the first metadata in an asset lock file associated with the user asset, acquiring a second byte-range lock of the asset lock file that is associated with a storage mounting operation, after acquiring the first byte-range lock and the second byte-range lock, mounting a backup storage to the client device using the first metadata, unlocking the second byte-range lock, and performing, after unlocking the second byte-range lock, the first backup operation on the user asset.

Abstract: A method for execution by a dispersed storage and task (DST) processing unit includes initializing a composite operation from a plurality of independent operations. An empty transaction context is created by performing an evaluation of the composite operation. A multi-source compare and swap (CASN) transaction is created from resulting expected values determined by evaluating the composite operation in the empty transaction context. The CASN transaction is executed against a dispersed storage network (DSN) memory. When the execution of the CASN transaction is successful, the transaction is committed to the DSN memory. When the execution failed due to at least one conflicting value stored in the DSN memory, a new transaction context pre-populated with the at least one conflicting value is created, and an updated CASN for the composite operation that utilizes the new transaction context is executed.

Abstract: One embodiment provides a method for storage management in a hierarchical file system that includes creating a structure for the hierarchical file system including a top-file system and sub-file systems that each include files and directories. Directories for the sub-file systems of the hierarchical file system are tracked. A request for creation of a unique directory in the hierarchical file system is received. Upon a request by a particular sub-file system for more inodes without any inodes available, inode numbers are revoked from at least one other sub-file system having unused inodes.

Abstract: Enforcing different policy rules that are applicable to different types of data stored at a decentralized storage service that uses a distributed ledger to authenticate and/or authorize users. Receive a request from an entity for operating on data stored or to be stored in a storage that is associated with a DID. A type of data that is requested to be operated on is then determined. One or more policy rules that are applicable to the determined type of data are accessed. Based on the one or more policy rules, determine if the operation to be performed on the data will result in the data complying with the one or more policy rules. Based on the determination, allow the request when the operation will result in the data complying with the one or more policy rules.

Abstract: A system and method for scalable storage. The method includes placing a lock on a portion of a storage node, wherein placing the lock further comprises replacing a first value stored in the storage node with a second value using an atomic operation, wherein the atomic operation replaces the first value with the second value when the first value indicates an empty lock status, wherein the second value indicates an active lock status; allocating a storage location in the storage node by updating metadata stored in the locked portion of the storage node when the lock has been placed; and releasing the lock, wherein releasing the lock further comprises replacing the second value with a third value, wherein the third value indicates the empty lock status.

Abstract: A system is provided to provide near real-time updates to data tables for a data warehouse using a micro-batch manager. The system includes a processor and a computer readable medium operably coupled thereto, to perform table updating operations which include accessing a first staging data table comprising a plurality of records that was generated by the micro-batch manager for a first destination table of the data tables for the data warehouse, reading a merge instruction column of the first staging data table for the plurality of records, determining a merge operation for each of the plurality of records from reading the merge instruction column, merging the plurality of records from the first staging data table to the first destination table using the merge operation for each of the plurality of records, and deleting the plurality of records from the first staging data table after merging.

Abstract: A computing system may repair a database index for a database table by placing a first structural lock on the database table to prevent modifications to the structure of the table. The computing system may scan the database table to determine a plurality of database records. The system may probe the database index for the database records to identify records with missing entries in the index. Based on the probing, the system may place a first data lock on a record of the database table corresponding to a missing index entry to prevent modification of data in the record. In response to placing the first record lock, the system adds an index entry for the locked database record to the database index. During repair of the index, one or more processes may use the database index to locate one of the plurality of database records included in the database table.

Abstract: Systems and methods for an elastic cost-to-serve system including a first module to orchestrate an elastic server set; a second module to orchestrate a load test and to apply one or more use-case scenarios for each orchestrated server set; a third module to generate a cost metrics model of the orchestrated server set for predictive cost modeling; a fourth module coupled to the third module to collect a plurality of performance metrics across the server resources and associated client devices; a fifth module to post-process the collected performance metrics across a load testing duration and to provide analytics of the server set performance; and a sixth module coupled to analyze the performance metrics adapting available resources and to apply a heuristic of the cost metrics model to predict a model of cost optimization of the server set.

Abstract: A system includes a memory and a processor. The memory is in communication with the processor. The processor is configured to execute receiving a source code of an application that is compilable into an interpreted configuration. A database is then accessed, where the database includes a first plurality of patterns that are compilable into an interpreted configuration and fail to compile into a native compiled configuration. Within the database, a first plurality of patterns is associated with a first alternative pattern that is compilable into the interpreted configuration and compilable into the native compiled configuration. The source code is parsed to create a second plurality of patterns and analyzed with the first plurality of patterns to determine whether a corresponding pattern exists. Upon determining that the corresponding pattern exists, the corresponding pattern is added to a change list and then outputted.

Abstract: A technology for controlling an access of a trie by managing node access permissions of processes that access a trie data structure and perform an operation is disclosed. Example embodiments include accessing a window initiating node in a trie, determining whether a next node is an anchor node while visiting lower nodes of the window initiating node in a predetermined traversal order, locking the next node when the next node is an anchor node, releasing a lock of the window initiating node when the window initiating node is an anchor node, and setting the next node as the window initiating node.

Abstract: A distributed storage system includes table controllers collectively storing partitions of a logical table having multiple rows. For each of the partitions, a corresponding table controller stores a subset of the rows of the logical table across individual pages. A management controller updates a schema of the logical table from a first to a second schema definition by, for each of the partitions, sending an update command indicating the second schema definition to the corresponding table controller. The first table controller corresponds to a first partition that includes a first subset of the rows. The first table controller, prior to receiving the update command, includes an identifier of the first schema definition within each page of data for the first subset. Subsequent to receiving the update command, the first table controller, when writing each new page of data for the first subset, includes an identifier of the second schema definition.

Abstract: Systems and method for improved creation and management of distributed file systems are provided. In one embodiment, a method is provided that includes creating a plurality of containers within a cloud computing environment and executing, within the plurality of containers, a plurality of gateways for a distributed file system. Exports of the distributed file system may be assigned to a subset of the plurality of gateways. The exports may correspond to an exclusive subset of the distributed file system. The method may also include responding to requests to access exports of the distributed file system using containers executing gateways assigned to corresponding exports of the distributed file system.

Abstract: A journaled database system may comprise data nodes that collectively maintain a collection of data and provide clients with read and write access to the collection. Correlated classification functions may be associated with read and write operations, such that items affected by a write operation are classified similarly to items accessed during a read operation. Read and write signatures may be formed based on the classification. Conflicts may be detected by comparing the read and write signatures for equivalent or overlapping classifications.

Abstract: Techniques are described for materializing computations in memory. In an embodiment, responsive to a database server instance receiving a query, the database server instance identifies a set of computations for evaluation during execution of the query. Responsive to identifying the set of computations, the database server instance evaluates at least one computation in the set of computations to obtain a first set of computation results for a first computation in the set of computations. After evaluating the at least one computation, the database server instance stores, within an in-memory unit, the first set of computation results. The database server also stores mapping data that maps a set of metadata values associated with the first computation to the first set of computation results.

Abstract: A method for execution by a dispersed storage and task (DST) processing unit includes initializing a composite operation from a plurality of independent operations. An empty transaction context is created by performing an evaluation of the composite operation. A multi-source compare and swap (CASN) transaction is created from resulting expected values determined by evaluating the composite operation in the empty transaction context. The CASN transaction is executed against a dispersed storage network (DSN) memory. When the execution of the CASN transaction is successful, the transaction is committed to the DSN memory. When the execution failed due to at least one conflicting value stored in the DSN memory, a new transaction context pre-populated with the at least one conflicting value is created, and an updated CASN for the composite operation that utilizes the new transaction context is executed.

Abstract: Customers of shared resources in a multi-tenant environment can modify operational parameters of electronic resources. A customer can be provisioned a data volume of a specified size, storage type (e.g., hard disk drive or solid state device), committed rate of input/output operations per second, and/or geographical location, for example. The customer can subsequently modify any such operational parameters by submitting an appropriate request, or the operational parameters can be adjusted automatically based on any of a number of criteria. Data volumes for the customer can be migrated, split, or combined in order to provide the shared resources in accordance with the modified operational parameters.

Abstract: Systems and methods are disclosed that perform dynamic database schema modification. A database system may receive a request to change a schema. In response to receiving the request to perform the dynamic schema modification, the database system may complete pending transactions and begin modifying the database schema. Any requests to access the database received prior to completion of the modification may be paused, thereby allowing the database to remain online and continue receiving requests while the modification is in progress. After completion of the modification, the paused requests may be resumed.

Abstract: A computer implemented method for manipulating data comprises receiving log transaction information from a primary database system at a secondary database system and parsing the log transaction information to identify data objects that have been modified on the primary database system. The secondary database system determines whether the data objects are present in main memory on the secondary database system and whether the log transaction corresponds to a data manipulation language (DML) query or a data definition language (DDL) query. If the data objects are not in the main memory and the query is a DML query, they are copied from persistence data volumes to the main memory. The data objects in main memory are modified by replaying the log transactions on the data objects in the main memory. Then, the data objects in the persistence data volumes are modified. Related apparatus, systems, techniques and articles are also described.

Abstract: A method and system for remote accessing resource structure is described that include deploying multiple layered item list (MLIL) in memory for mirroring a resource structure such as a mirroring files and folder structure on a file system. The use of the mirrored MLIL reduces data load on a network and avoids to hugging larger amount of computing power. Therefore, the method and system of this invention has greatly improved remote access technology in a World Wide Web (WWW) environment. In addition, the use of the mirrored MLIL has also made sharing of file or folder becoming much easier and efficient.

Abstract: Heterogeneous garbage types are collected by scanning all of the service items to identify all of the service types that are included within the service items, identifying garbage collection components that correspond with the service types, and then collecting garbage for the corresponding target service types by using the corresponding garbage collection components.