Abstract: A data processing method for an electronic device includes: obtaining data rebalance information representing a new partition plan for a partition table, the partition table being a table for data distribution based on a partition key; creating, for a set specified in the partition plan, a corresponding partition space, and recording, in the corresponding partition space, a current data range of a set corresponding to the partition space, the data range comprising one of a value range of the partition key and a value list of the partition key; updating the data range recorded in the corresponding partition space based on the partition plan, and updating correspondence between the corresponding partition space and sets of the partition table by using the updated data range in the corresponding partition space; and updating data distribution in the sets of the partition table based on the correspondence.

Abstract: Systems and methods are described for performing persistent inflight tracking of operations (Ops) within a cross-site storage solution. According to one embodiment, a method comprises maintaining state information regarding a data synchronous replication status for a first storage object of a primary storage cluster and a second storage object of a secondary storage cluster. The method includes performing persistent inflight tracking of I/O operations with a first Op log of the primary storage cluster and a second Op log of the secondary storage cluster, establishing and comparing Op ranges for the first and second Op logs, and determining a relation between the Op range of the first Op log and the Op range of the second Op log to prevent divergence of Ops in the first and second Op logs and to support parallel split of the Ops.

Abstract: The disclosed embodiments relate generally to efficient data transmission and receipt. Specifically, the disclosed embodiments provide systems and methods for selectively combining multiple, disparate message types and transmitting same via one data feed. A consolidation system determines whether data resulting from an event can be combined or merged based on pre-determined message characteristics and state or environment information or should be sent via two separate feeds. The merged message may be backwards-compatible so that data recipient computing systems can easily and selectively decide which portion of the merged data is relevant to the data recipient computing system, only read the relevant portions. Thus, multiple data receivers, which typically consume different message types, can receive and consume the same merged or consolidated message.

Abstract: A processing system manages an ordered set of hierarchical data structures representing snapshots that define the state of a filesystem at different points in time. The data structures include nodes that store strong references, which can be utilized to read or write data, or weak references that can be only utilized to read data. In order to create a new snapshot, a root node is created for a new data structure representing the new snapshot by copying the root node of the data structure representing an active view of the filesystem. Any strong references stored in the copy of the root node are then changed to weak references. Snapshotting operations can then be performed with respect to the new snapshot utilizing the weak references stored in the root node of the new data structure.

Abstract: A system for sub-table replication within a materialized view of a source data table. A materialized view of a source data table is generated based on a query, the source data table having a plurality of data table rows associated with a plurality of client identifiers and including an entitlements column and data content, the entitlements column including a plurality of provider account identifiers and a plurality of consumer account identifiers. An update to an entitlements table of the source data table is detected where the entitlements table includes a plurality of entitlements table rows and where the entitlements table rows are associated with the client identifiers, the consumer account identifiers, and the provider account identifiers. An update to the source data table based on the first update to the entitlements table is detected, and an incremental replication of the materialized view of the source data table is performed.

Abstract: A device implementing a multi-user content queue may include a memory and at least one processor configured to receive, on the device, a content query and retrieve, from the memory, user account credentials corresponding to user accounts associated with the device. The at least one processor may be further configured to provide, to a server, the user account credentials and the content query. The at least one processor may be further configured to receive, from the server and based on the content query, a user account identifier of one of the user accounts and a content identifier corresponding to content in a content library of the one of the user accounts. The at least one processor may be further configured to utilize the user account identifier and the content identifier for output, by the device, of the content from the content library of the one of the user accounts.

Abstract: The described embodiments set forth techniques for preserving clone relationships between files at a computing device. In particular, the techniques involve identifying clone relationships between files in conjunction with performing operations on the files where it can be beneficial to preserve the clone relationships. The operations can include, for example, preserving clone relationships between files that are being copied from a source storage device (that supports file cloning) to a destination storage device that supports file cloning. Additionally, the operations can include preserving clone relationships when backing up and restoring files between a source storage device (that supports file cloning) and a destination storage device that does not support file cloning. In this manner, the various benefits afforded by the clone relationships between files can be retained even as the files are propagated to destination storage devices that may or may not support file cloning.

Abstract: The resolving of a decentralized identifier to a corresponding data structure using multiple resolvers. This allows for the use of a consensus of resolvers to improve trust in the resolution process. In order to resolve, a decentralized identifier is sent to multiple resolvers. In response, each of at least some of those resolvers will return a data structure of a particular type (e.g., a decentralized identifier document) that is associated with the decentralized identifier. Then, it is determined whether the data structure for at least some number of resolvers matches each other. That is, it is determined whether at least some predetermined threshold of resolvers is returning the same data structure (e.g., the same decentralized identifier document). If so, then it is determined that the matching data structure is indeed associated with the decentralized identifier. Otherwise, the resolution process has failed.

Abstract: A file processing method includes obtaining a first operation from a user, displaying a first file on a first screen of a first application, obtaining a second operation from the user on the first screen, displaying, in response to the second operation, the first file on a recycle bin screen of the first application, deleting, by the mobile terminal, a first data table, where the first file is invisible to the user on the recycle bin screen of the first application due to deletion of the first data table, obtaining a third operation from the user, and generating, in response to the third operation, a second data table, where the first file is visible to the user on the recycle bin screen of the first application due to existence of the second data table.

Abstract: Methods, apparatus, and processor-readable storage media for generating data replication configurations using AI techniques are provided herein. An example computer-implemented method includes obtaining input data pertaining to at least one data replication operation; determining a set of configuration parameters for the at least one data replication operation by applying one or more AI techniques to at least a portion of the input data; and performing one or more automated actions based at least in part on the determined set of configuration parameters for the at least one data replication operation.

Abstract: An apparatus is described that includes an execution unit to execute a first instruction and a second instruction. The execution unit includes input register space to store a first data structure to be replicated when executing the first instruction and to store a second data structure to be replicated when executing the second instruction. The first and second data structures are both packed data structures. Data values of the first packed data structure are twice as large as data values of the second packed data structure. The execution unit also includes replication logic circuitry to replicate the first data structure when executing the first instruction to create a first replication data structure, and, to replicate the second data structure when executing the second data instruction to create a second replication data structure.

Abstract: A method includes transmitting initial page data from a service platform customer instance to a client device. The initial page data representing a first page of a portal, and the first page includes a widget associated with a second page. The method further includes receiving, from the client device, a selection of the widget. The method further includes obtaining mapping data indicating an association between the second page and a third page, the association specific to the portal. The method further includes, in response to the selection and the association, routing the client device to the third page rather than the second page.

Abstract: An inverter unit includes a switching element unit, a control board, a cooler, and an inverter case. The inverter case is integrally fixed to a rotating electrical machine case. The cooler is disposed so as to be in contact with the switching element unit on an opposite side to a rotating electrical machine side. The control board is disposed on the rotating electrical machine side of the switching element unit.

Abstract: There is provided a computer-implemented method for managing third-party access to data, to increase data security and/or privacy. The method comprises receiving, from a third-party computer, a request to access data, wherein the request is indicative of at least one requested operation. A validity of each of the requested operations is determined in dependence on permission data stored in a distributed public ledger. The permissions data defines, for said third-party computer, a set of permissible operations and one or more permissible data attributes associated with each of the set of permissible operations. The request and the validity are logged in the distributed public ledger.

Abstract: Systems and methods related to the seamless integration of Content Management Interoperability Services (CMIS) client systems with native data models of repositories that may be utilized with such client systems are disclosed. In particular, certain embodiment of systems and methods for the integration of CMIS compliant client systems with CMIS compliant ECM systems by conforming CMIS secondary types utilized by CMIS clients to the native ECM artifacts utilized by the ECM system are disclosed.

Abstract: A technology for assessing client experience in incident management can be implemented. The technology can fetch an event log entry from a first database comprising a plurality of event log entries generated by a client, wherein the event log entry is associated with a timestamp, an event descriptor, and a prescribed target time to close the event log entry. The technology can extract a communication message sent by the client from the event descriptor, determine a polarity score based on sentiment analysis of the communication message, determine a client experience index (CEI) based on the polarity score, save the CEI in an event record in a second database, determine an aggregated CEI based on an average of a plurality of CEIs determined for the corresponding plurality of event log entries, and output the aggregated CEI.

Abstract: A computer-implemented method for replicating data changes through distributed invalidation includes receiving, by a distributed database system, an instruction to change a data element in a table. The distributed database system includes at least a first server and a second server. A first copy of the table is stored on the first server, and a second copy of the table is stored on the second server. The method further includes in response to the instruction, determining that the data element is secured by a replication key that is stored on a shared key management system that is accessible by the first server and by the second server, wherein the replication key is unique to the data element. The method further includes invalidating the replication key and modifying the first copy of the table on the first server according to the instruction that is received.

Abstract: Methods, systems, and devices for data validation are described. A user may store a set of data records on a source database and backup the set of data records at a target database through a data migration. A migration and validation server may initiate the data migration. After the data migration is complete, the migration and validation server may perform a validation process that includes comparing a calculated hash value from the source database and the target database that is based on unique identifiers and timestamps for each data record in the set of data records migrated from the source database to the target database. The migration and validation server may determine if the data migration was successful (e.g., the data was transferred correctly) if the hash value calculated for the data records at the target database equals the hash value calculated for the data records at the source database.

Abstract: A method for online learning from a data stream with an ensemble of meta-trees includes: observing a data instance from the data stream; for each of the meta-trees, replicating the data instance to generate a number of replicated data instances; for each of the meta-trees, updating meta-tree components using the number or replicated data instances; and inducing each of the meta-trees based on the data instance and the updated meta-tree components. Inducing each of the meta-trees includes employing inequality concentration bound to determine whether a split criterion is satisfied.

Abstract: A file processing method includes obtaining, by a mobile terminal, a first operation from a user, displaying a first file on a first screen of a first application, obtaining, by the mobile terminal, a second operation from the user on the first screen, displaying, in response to the second operation, the first file on a recycle bin screen of the first application, deleting, by the mobile terminal, a first data table, where the first file is invisible to the user on the recycle bin screen of the first application due to deletion of the first data table, obtaining, by the mobile terminal, a third operation from the user, and generating, in response to the third operation, a second data table, where the first file is visible due to existence of the second data table.

Abstract: A method for replicating a set of parent resources from an administrator namespace to a set of tenant namespaces is described. The method includes receiving, by the administrator namespace, a global object that includes a set of object fields that reference (1) a set of parent resources and (2) the set of tenant namespaces; monitoring, by an operator controller of the administrator namespace, the global object to determine whether a change has been made to the global object; and replicating, by the operator controller, the set of parent resources to the set of tenant namespaces as child resources based on the global object in response to detecting a change to the global object.

Abstract: Data can be placed by an edge node in a computing environment using multiple criteria in a placement policy. For example, a processing device of an edge node can receive a write request for storing a data object. The processing device can select first and second criteria from a placement policy based on a tag for the data object. The first criterion may correspond to a required characteristic and the second criterion may correspond to a prioritized characteristic. The processing device can determine a set of remote components that fulfill the first criterion. The processing device can then identify, from the set, a destination component that fulfills the second criterion. The processing device can transmit the data object to the destination component.

Abstract: Disclosed are some implementations of systems, apparatus, methods and computer program products for performing data ingestion. A request received from a client device is processed, where the request has a payload including a plurality of data items pertaining to a data object. An identifier associated with the data object is generated. Information including the data items is obtained from the request. The information including the data items is stored in association with the identifier in a first data store, where the first data store is not a relational database. The data items and identifier are obtained from the first data store and stored in a second data store, where the second data store is a relational database. A query including the identifier is processed to obtain the identifier from the query. It is determined whether the identifier obtained from the query is in the first data store.

Abstract: Technologies for fast distributed storage recovery include a distributed storage system that includes multiple controller nodes and multiple target nodes. Each controller node is coupled to a corresponding target node via a storage fabric. Each target node stores replica data. The system identifies a failed node and a corresponding node that was coupled to the failed node. If the failed node is a controller node, the corresponding node is a target node. If the failed node is a target node, the corresponding node is a controller node. The system instantiates a replacement node, adds the replacement node to the system, and couples the replacement node to the corresponding node. The system may direct a backup target node to copy replica data to the replacement target node via the storage fabric. Other embodiments are described and claimed.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device and a computer program product for creating metadata index. The method disclosed herein comprises: generating a first-level index to index a metadata item; inserting a first indication into the first-level index to indicate a position of the metadata item in a set of metadata; generating a second-level index to index a set of first-level indexes; and inserting a second indication into the second-level index to indicate a set of positions of the set of metadata. In this way, embodiments of the present disclosure can create an index structure which can indicate the position of the metadata item, so as to rapidly determine the position of the metadata item.

Abstract: A distributed system responds to a request to enable a restoration capability for a database instance by beginning a process for replicating configuration and transaction data for the database instance. The system associates the replicated configuration and transaction data with a first account and a second account, and prevents termination of the replication process except where consent for the termination is provided by both accounts. In response to a request to restore the database instance, the distributed system accesses the configuration and transaction data using the second account.

Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in a federated database system or in a cache of a database management system of a central computing system. When data associated with the virtual table is requested, or prior to receiving the request, the data can be stored in a table in the cache. The logical pointer can be updated to reference the cache. If the cache is full, the table can be removed from the cache, and the logical pointer can be updated to reference a table at the federated database system.

Abstract: Persistent storage may include a configuration management database (CMDB), the CMDB representing devices and software applications disposed within a managed network and relationships therebetween. A proxy server may be configured to relay discovery information between a plurality of endpoint devices associated with the managed network and the CMDB, wherein respective discovery agents are disposed within each of the endpoint devices, and wherein the proxy server contains one or more processors configured to execute program instructions that perform operations including: (i) receiving, from a discovery agent disposed within an endpoint device, a discovery payload, wherein the discovery payload includes: a configuration of the endpoint device and information regarding one or more software applications installed on the endpoint device, and wherein the proxy server did not request the discovery payload; and (ii) transmitting, by the proxy server, the discovery payload to the CMDB.

Abstract: In general, techniques are described for dynamically programming a cloud-based service exchange to enable connections from an enterprise buyer in one metropolitan area to connect to a cloud exchange in another metropolitan area. For example, a network data center includes a programmable network platform to receive an indication of a network service provider (NSP) configured to transport traffic to a customer in a second metropolitan area; provision a virtual circuit from a customer-facing port of a cloud-based services exchange point of the second metropolitan area to the NSP; receive a service request that specifies one or more cloud services provided by one or more cloud service provider networks of the first metropolitan area operated by the respective cloud service providers; and configure access to the one or more cloud services provided by one or more cloud service provider networks via the virtual circuit.

Abstract: A system that maps files into multiple parts and initiates storage of each part within a respective storage provider. The mapping facilitates this by correlating each of the multiple parts to a corresponding storage provider which may be different than the storage provider that stores a different part of the same file. The system then initiates storage of the multiple parts of the file in each of their corresponding storage provider in accordance with the mapping, and using a storage-provider-facing API. Similarly, retrieval and/or editing of a partial file may be accomplished by referencing the mapping, and using the same API issued to the appropriate storage provider. Each storage provider is capable of interfacing with the system using this same API.

Abstract: Techniques are provided for neutralizing replication errors. An operation is executed upon a first storage object and is replicated as a replicated operation for execution upon a second storage object. A first error may be received for the replicated operation. Instead of transitioning to an out of sync state and aborting the operation, a wait is performed until a result of the attempted execution of the operation is received. If the first error is the same as a second error returned for the operation, then the operation and replicated operation are considered successful and a synchronous replication relationship is kept in sync. If the first error and the second error are different errors, then an error response is returned for the operation and the synchronous replication relationship is transitioned to out of sync.

Abstract: A method for a source storage device to send a source file and a clone file of the source file to a backup storage device. The source storage device sends a data block to the backup storage device to be stored as a target file. Then, the source storage device determines that the source file is associated with the clone file by searching a cloning recorder with a source file ID of the source file. Based upon the determining, the source storage device sends a clone creating request including the source file ID to the backup storage device to instruct the backup storage device to create a clone file of the target file. Thus, the method is capable of replicating the clone file of the file without sending a large number of mapping data.

Abstract: A data migration system and method operate within a database platform system, which includes first and second databases, to provide data migration between databases. The data migration includes automatically generating a globally unique identifier for each record of the first database, such as upon creation of each record. Records in the second database are updated or inserted according to whether or not records in the second database have globally unique identifiers that correspond to globally unique identifiers of records in the first database.

Abstract: Implementations of the present disclosure include receiving a merger request including a first identifier of a first node, a second identifier of a second node, and an identifier of a first smart asset, the first smart asset being associated with the first node, determining whether the first smart asset is capable of merger with a second smart asset associated with the second node at least partially based on the identifier of the first smart asset and an identifier of the second smart asset, and, in response to determining that the first smart asset is capable of being merged with the second smart asset, automatically: updating the second smart asset, the updated second smart asset being assigned a value, and including properties of the first smart asset, recording the updated second smart asset to the second node, and deleting the first smart asset.

Abstract: In a distributed storage of data objects in a cluster system, a data object is distributed across a group of node apparatuses in units of data blocks. For each child object, the metadata structure of the respective child object is stored to one of the node apparatuses of the group of node apparatuses for managing locations of data blocks of the data object and includes a root metadata node and one or more direct metadata nodes, optionally further including one or more indirect metadata nodes; and the metadata structure of the parent object is distributed across the plural node apparatuses of the group of node apparatuses for managing locations of child objects of the data object and includes, on each node apparatus of the group of node apparatuses, a root metadata node and one or more direct metadata nodes, optionally further including one or more indirect metadata nodes.

Abstract: A data de-duplication in a distributed storage of data objects in a cluster system, in which plural data objects are distributed across a group of node apparatuses and stored in units of data blocks. Each metadata structure including a root metadata node and one or more direct metadata nodes, and optionally including one or more indirect metadata nodes; and a metadata object is stored for managing de-duplicated data blocks based on a metadata structure of the metadata object wherein at least one direct metadata node of the metadata structure of the metadata object includes a block reference pointing to a de-duplicated data block being associated with two or more data objects. Preferably, each of the metadata structures of the two or more data objects being associated with the de-duplicated data block includes a respective direct metadata node including an object reference to the metadata structure of the metadata object.

Abstract: A method of managing data with high granularity, comprises identifying data objects and an associated data management policy. The policy uses features and a common semantic to define a feature-based sequence of data management actions of a data management operation that varies for different objects depending on respective features. Features of the data objects are obtained and then used to associate a data management action with the object using the policy so that the object is managed individually according to its own features, thus achieving high granularity of data management precision and also high flexibility.

Abstract: Methods and apparatus for lifecycle support for storage objects are disclosed. A storage medium stores program instructions that when executed on a processor implement a storage lifecycle manager of a multi-tenant storage service. The lifecycle manager determines a lifecycle policy to be implemented for a storage object. The policy indicates lifecycle transitions of the object, including a transition from a first service level to a second service level. The first service level and the second service level may each specify a maximum number of versions of the storage object. The lifecycle manager initiates modification operations corresponding to the storage object's data in accordance with the lifecycle policy, and verifies that the modification operations succeeded. The lifecycle manager provides, in response to a query, an indication of a current service level of the storage object.

Abstract: A system includes one or more processing modules and one or more non-transitory storage modules storing computing instructions configured to run on the one or more processing modules and perform acts of: receiving, from a user computer, a destructive read request including header information indicating that a record stored in a persistent database is to be deleted after the record is successfully read from the persistent database; in response to receiving the destructive read request, retrieving the record, which was identified by the destructive read request, from the persistent database; after retrieving the record, receiving a success signal that confirms that the record was successfully read from the persistent database; and in response to receiving the success signal, automatically deleting the record, which was identified by the destructive read request, from the persistent database without receiving another instruction to delete the record. Other embodiments are disclosed herein.

Abstract: A method for linking records from different datasets based on record similarities is described. The method includes ingesting a first dataset, including a first set of records with a first set of fields, wherein the first dataset is associated with a first vendor and a first type of data, and a second dataset, including a second set of records with a second set of fields, wherein the second dataset is associated with a second vendor and a second type of data; determining that a first record from the first set of records is similar to a second record from the second set of records based on similarities between fields in the first and second set of fields; and linking the first and second records in response to determining that the similarity, wherein the first and second vendors are different and/or the first and second types of data are different.

Abstract: A method or system of managing data with high granularity, comprises identifying data objects and an associated data management policy. The policy uses features and a common semantic to define a feature-based sequence of data management actions of a data management operation that varies for different objects depending on respective features. Features of the data objects are obtained and then used to associate a data management action with the object using the policy so that the object is managed individually according to its own features, thus achieving high granularity of data management precision and also high flexibility.

Abstract: A data structure used in memory-based file system, method and apparatus using thereof. The data structure comprising: a tree of the nodes comprising tree nodes and leaf nodes, each tree node points to at least one node, each leaf node is associated with a plurality of data unit elements each of which representing a data unit, wherein each data unit element is associated with two pointers, wherein at least one of the two pointers is capable of pointing to a data unit or to a data unit element; and a cyclic linked list of data unit elements representing identical clones of a data unit, wherein the cyclic linked list comprises a first element pointing directly to the data unit, wherein from each element in the cyclic linked list, the data unit can be reached in time complexity of O(1).

Abstract: A method and apparatus for inheritance-based propagation is provided. The method comprises receiving a request from a client computer to update an access permission associated with a specific namespace in a nested namespace structure for a user, the specific namespace being associated with a group of users, wherein the nested namespace structure includes one or more child namespaces of the specific namespace; causing updating of the access permission associated with the specific namespace for the user; identifying the specific namespace as the current namespace; and performing an iterative process having the following steps until a termination criterion is satisfied.

Abstract: Methods and apparatus for dedicated endpoint instances for network-accessible services are disclosed. The number of dedicated endpoint instances to be established to direct work requests of a given client to back-end nodes of a service may be determined. Configuration policies for the instances, including one or more policies related to caching, authentication, redundancy, durability, availability, and/or load balancing, may also be determined. Configuration of the instances may be initiated, and an indication that the endpoint or endpoints have been configured may be provided to the client.

Abstract: At the target side, a first instruction to replicate a first target snapshot-file of a target snapshot-file tree of the target file system is received, the first target snapshot-file of the target file system being associated with a first source snapshot-file of the source file system which has been modified in the source file system. One or more data blocks which are owned by a second target snapshot-file and which are shared between the first target snapshot-file and the second target snapshot-file are identified, the second target snapshot-file being an ancestor of the first target snapshot-file in the target snapshot-file tree. Then, at the target side, ownership of the one or more identified data blocks is transferred from the second target snapshot-file to the first target snapshot-file.

Abstract: The present disclosure generally relates to user interfaces for displaying and using avatars. In some embodiments, avatars are used to generate stickers for sending in a content-creation user interface. In some embodiments, avatars are used to generate a representation of a contactable user in a contactable user editing user interface. In some embodiments, a user interface can be used to create and edit an avatar. In some embodiments, a user interface can be used to display an avatar that is responsive to detected changes in pose of a face of a user. In some embodiments, contact information is transmitted or received.

Abstract: Techniques for making storage of data objects eventually durable using redundancy encoding are described herein. Data objects are stored in a first set of data storage devices with a first durability. After a predetermined length of time, the data objects are converted to data shards and distributed to a second set of data storage devices with a second durability that is distinct from the first durability.

Abstract: A code merging system is configured to manage the storage of source code on a local system in the software development cycle. A cloud environment hosts working source code, which is composed of metadata artifact components. Copies of some of the metadata artifact components are transferred to a source code control and merged with master source code in either a partial merge process or a full merge process.

Abstract: Systems, computer-implemented methods, and non-transitory computer readable media are provided for sharing medical data. The disclosed systems may be configured to create a first workgroup having a first knowledgebase. This first knowledgebase may be federated with a common knowledgebase, and with a second knowledgebase of a second workgroup. At least one of the first knowledgebase, common knowledgebase, and second knowledgebase may be configured to store data items comprising associations, signs, and evidence. The signs may comprise measurements and contexts, and the associations may describe the relationships between the measurements and contexts. The evidence may support these associations. The disclosed systems may be configured to receive a request from a user in the first workgroup, retrieve matching data items, and optionally then output to the user at least some of the retrieved matching data items. The request may comprise at least one of a first association and a first measurement.

Abstract: A method of operating a situationally aware speaker associated with a virtual personal assistant (VPA) service provider that comprises receiving an indication of at least one parameter of an environment proximate the situationally aware speaker, and delivering the response to the vocal query to the user formatted as speech through an audio output of the situationally aware speaker, at least one audio parameter of the response set based on the indication of the at least one parameter.