Abstract: In certain embodiments, multi-modal-based generation of settlement instructions may be facilitated. In some embodiments, a portfolio of a live environment may be emulated in a projected environment. A target portfolio may be generated in the projected environment based on the emulated portfolio. Partial synchronization between the target portfolio of the projected environment and the portfolio of the live environment may be performed such that a first subset of changes to the portfolio of the live environment are reflected in the target portfolio of the projected environment. Subsequent to the partial synchronization, the target portfolio of the projected environment may be updated such that the update of the target portfolio accounts for the first subset of changes. Subsequent to the update of the target portfolio, settlement instructions may be generated based on differences between the target portfolio of the projected environment and the portfolio of the live environment.

Abstract: An electronic device, a trusted application calling method and apparatus, a device, and a medium are disclosed. Because a trusted application development platform is linked with native trusted applications respectively corresponding to multiple trusted execution environment operating systems (TEE OS), based on the trusted application development platform, a bytecode trusted application can be applicable to any TEE OS, and for different TEE OS hardware platforms, only one corresponding bytecode trusted application needs to be developed for one application. Moreover, the trusted application development platform and the byte code trusted application can be applied to electronic devices (terminals) of different TEE OSs.

Abstract: Systems and methods of network telemetry caching and distribution are provided. The system can receive network telemetry data and store it as a plurality of data nodes. The system can maintain a node pointer map and a node pointer queue. If the system receives an update to a data node having a corresponding node pointer not already present in the node pointer map, the system can add the node pointer to the node pointer queue and to the node pointer map with a count of zero. If the node pointer is already present in the node pointer map, the system can increment the node count for the node pointer in the node pointer map and not add the node pointer to the node pointer queue. The system can transmit data values and node counts to the client device for each node pointer in the node pointer queue.

Abstract: Described herein are methods, systems, and computer-readable storage media for automatic and efficient updating of databases and database schemas. Techniques include generating an identification of a task of an application associated with a database through a machine learning process for monitoring database activity. Further, patterns of the application's access to data stored in the database may be observed and provided along with the identified task to a feedback loop to identify changes in the application's access to data in a database. Techniques further include automatically updating a schema of the database based on the identified changes in the application's access to data stored in the database.

Abstract: A method and system for detecting ransomware and repairing data following an attack. The method includes, collecting file statistics for files in a file system, identifying an affected file based on collected file statistics, locking down of access to the file system in response to identifying the affected file, undoing of reconcile processing, repairing the affected files, and unlocking access to the file system. The system includes a computer node, a file system, a plurality of disc storage components, a backup client, a backup client, and a hierarchical storage client. The hierarchical storage client is configured to collect file statistics for files in file system, identify affected files based on collected file statistics for the file, lock down of access to the file system in response to an identified affected file, undo reconcile processing, repair the affected file; and unlock access to the file system.

Abstract: Systems and methods for enhancing virality for a content item are disclosed herein. A content item is uploaded to a content sharing platform over a communication network. Feedback on the content item is received from the content sharing platform over the communication network. Based on the feedback, a virality score for the content item is determined and a determination is made as to whether the virality score meets a virality criterion. In response to a determination that the virality score does not meet the virality criterion, a virality enhancement technique is selected from a virality enhancement database, the content item is modified by applying the virality enhancement technique to the content item, and the modified content item is uploaded to the content sharing platform over the communication network.

Abstract: A convolutional accelerator framework (CAF) has a plurality of processing circuits including one or more convolution accelerators, a reconfigurable hardware buffer configurable to store data of a variable number of input data channels, and a stream switch coupled to the plurality of processing circuits. The reconfigurable hardware buffer has a memory and control circuitry. A number of the variable number of input data channels is associated with an execution epoch. The stream switch streams data of the variable number of input data channels between processing circuits of the plurality of processing circuits and the reconfigurable hardware buffer during processing of the execution epoch. The control circuitry of the reconfigurable hardware buffer configures the memory to store data of the variable number of input data channels, the configuring including allocating a portion of the memory to each of the variable number of input data channels.

Abstract: Data being identified includes a first portion of data and a second portion of data. Based on identifying the data, a data structure is generated. The data structure can include a first section having a first symbol associated with the first portion of data and a second symbol associated with the second portion of data. Further, the first section can include a first offset value corresponding to the first portion of data and a second offset value corresponding to the second portion of data. The data structure can include a second section with a plurality of pointers that reference at least a plurality of symbols including at least the first and second symbol. The data structure can be referenced to process one or more queries against the data.

Abstract: Paxos transactions are pipelined in a distributed database formed by a plurality of replica servers. A leader server is selected by consensus of the replicas, and receives a lock on leadership for an epoch. The leader gets Paxos log numbers for the current epoch, which are greater than the numbers allocated in previous epochs. The leader receives database write requests, and assigns a Paxos number to each request. The leader constructs a proposed transaction for each request, which includes the assigned Paxos number and incorporates the request. The leader transmits the proposed transactions to the replicas. Two or more write requests that access distinct objects in the database can proceed simultaneously. The leader commits a proposed transaction to the database after receiving a plurality of confirmations for the proposed transaction from the replicas. After all the Paxos numbers have been assigned, inter-epoch tasks are performed before beginning a subsequent epoch.

Abstract: A method and system for providing consistency in read-after-write operations in a multi-replica relational database system (RDS) are provided. The method includes receiving a read transaction to read data from a database (DB) replica of the multi-replica RDS; obtaining counter values of DB replicas in the multi-replica RDS, a counter value of determines a current version of recent data stored in the respective DB replica; determining a write replica out of the DB replicas in the multi-replica RDS; determining if there is an available read replica, a read replica is a replica other than the determined write replica having counter value at least equals to a counter value of the write replica; and waiting, when there is no available read replica, a preconfigured time window to allow all replicas to synchronize with the write replica; and reading the data from a read replica when the preconfigured time window has elapsed.

Abstract: Apparatus, system and method for promoting media apps to an end user of a smart device. The smart device gathers information of apps that have been installed into the smart device and provides this information to a remote server. The remote server compares the information sent by the smart device to an identification of promoted apps received from a remote source to identify apps that are not installed in the smart device that are included in the identification of promoted apps. The remote server then notifies the smart device of which apps in the identification of promoted apps are not installed into the smart device, so that a user of the smart device may choose to have the missing app installed.

Abstract: Cloning storage systems in a cloud computing environment, including: receiving a request to create a cloud-based storage system; retrieving, from cloud-based object storage, one or more objects to include in the cloud-based storage system; and creating the cloud-based storage system, including storing, in block storage of the cloud-based storage system, data contained in the one or more objects retrieved from the cloud-based object storage.

Abstract: The computer-implemented method for processing sets of data for storing and keeping track of the same in a specific network implements a Sparsed Merkle tree. The method includes dividing at least one of the hash values into multiple sections of rim-keys of a given bit-width; and determining leave rim-keys being archive leaves of the Sparsed Merkle tree, and parent rim keys supporting the creation of a subtree.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. The computing devices may push a point in time to a backend for a distributed storage system.

Abstract: A protocol for implementing ACID transactions that provides snapshot isolation in a distributed setting that does not require synchronized clocks is described. The protocol ensures at commit time that transactions touching common objects do not commit out of order. The protocol can be used in the context of a distributed data lake built on an object store in which clients can transactionally add or remove objects from logical tables.

Abstract: A document management system manages documents. The documents are managed such that the documents may be shared with multiple users during an online sharing session. During the online sharing session of a document, the document may be annotated. The appearance and location of the annotation is consistent across the difference devices of the users even though the devices are of different device types.

Abstract: Embodiments include systems and methods for performing data migration using database consolidation. Information and parameters about a plurality of source databases from a source system can be stored, the parameters including a location, a security zone, and processor information for the source databases. Each of the plurality of source databases can be classified to one of a plurality of predetermined database sizes based on the stored information and parameters, wherein the classifying is at least based on the processor information. The classified source databases can be mapped to target database hardware based on the classified sizes and the stored parameters, wherein the target database hardware is segmented into containers that are defined by one or more of the parameters. Data from the source databases can be migrated to the target database hardware based on the mappings.

Abstract: The present disclosure relates to a digital asset synchronization system that provides improved local and remote synchronization of digital assets. In particular, the digital asset synchronization system manages digital assets by separating each digital asset into multiple components stored as a set of distributed individual files. Employing individual components for a digital asset rather than single monolithic file enables the digital asset synchronization system to provide safe concurrent access to the digital asset from multiple applications on the same device and across different devices. In addition, using components for a digital asset provides the digital asset synchronization system with the ability to efficiently store and synchronize multiple versions of the digital asset, both locally and remotely.

Abstract: In some embodiments, a method may be performed by a computing device that involves displaying an identifier indicative of a file, the display of the identifier being readable by a second device, receiving first data from the second device in response to the identifier being read by the second device, and enabling performance of at least one action with respect to the file with use of the first data. In some embodiments, the method may further involve receiving a first encryption fragment associated with the file, receiving, from the second device, a second encryption fragment associated with the file, reconstructing, using at least the first encryption fragment and the second encryption fragment, an encryption key enabling viewing of the file, and viewing the file using the encryption key.

Abstract: The disclosed technology relates to a system configured to receive operations data from a content management system, wherein the operations data comprises a log of operations, execute the log of operations, and update, based on execution of the log of operations, a remote tree representing a server state for content items stored on the content management system.

Abstract: Apparatus, system and method for promoting media apps to an end user of a smart device. The smart device gathers information of apps that have been installed into the smart device and provides this information to a remote server. The remote server compares the information sent by the smart device to an identification of promoted apps received from a remote source to identify apps that are not installed in the smart device that are included in the identification of promoted apps. The remote server then notifies the smart device of which apps in the identification of promoted apps are not installed into the smart device, so that a user of the smart device may choose to have the missing app installed.

Abstract: A distributed storage system may store data object instances in persistent storage and may store keymap information for those data object instances in a distributed hash table on multiple computing nodes. Each data object instance may include a composite key containing a user key. The keymap information for each data object instance may map the user key to a locator and the locator to the data object instance. A request to store or retrieve keymap information for a data object instance may be routed to a particular computing node based on a consistent hashing scheme in which a hash function is applied to a portion of the composite key of the data object instance. Thus, related entries may be clustered on the same computing nodes. The portion of the key to which the hash function is applied may include a pre-determined number of bits or be identified using a delimiter.

Abstract: Systems, apparatus, methods and computer program products for deleting data of an object within a multi-tenant database via an efficient delete operation are described herein. The new delete operation (or method) may be configured to identify one or more records to be deleted within a data structure such as an object. In order to ensure that the operation is efficient, the mechanism may determine characteristics of a data store and determine whether the information provided within the data structure provides an efficient identification of the data to be deleted. Upon a successful validation, an initial delete request may be translated to an appropriate delete operation for the underlying database.

Abstract: Disclosed embodiments include a method (system and non-transitory computer-readable medium) for backing up updated portions of a plurality files having hierarchical relationships through object storage. In one or more embodiments, a file is segregated into chunks, and objects corresponding to the chunks are generated for storage at an object storage. For a chunk, an object for storing the chunk and additional objects for storing mapping information are generated. The mapping information may include path information identifying a path of the file in a hierarchical structure, a file version list identifying a version of the file, a chunk list describing an association between the file and the chunks, a chunk version list identifying a version of the chunk, etc. When a portion of the file is updated, objects corresponding to the updated portion of the file can be generated, and stored at the object storage.

Abstract: Systems and methods of network telemetry caching and distribution are provided. The system can receive network telemetry data and store it as a plurality of data nodes. The system can maintain a node pointer map and a node pointer queue. If the system receives an update to a data node having a corresponding node pointer not already present in the node pointer map, the system can add the node pointer to the node pointer queue and to the node pointer map with a count of zero. If the node pointer is already present in the node pointer map, the system can increment the node count for the node pointer in the node pointer map and not add the node pointer to the node pointer queue. The system can transmit data values and node counts to the client device for each node pointer in the node pointer queue.

Abstract: According to some aspects, a database system comprising a processor configured to execute a plurality of system components is provided. The plurality of system components may include an interface component configured to receive a write commit command and provide a write commit confirmation, a snapshot component configured to generate a plurality of snapshots of data stored in a data storage node of a plurality of data storage nodes and identify a committed snapshot representative of data that has been replicated on a majority of the plurality of data storage nodes, and a command processing component configured to modify a data element based on the write commit command, determine whether the majority of the plurality of storage nodes have replicated the modification using the committed snapshot, and generate the write commit confirmation responsive to a determination that the majority of the plurality of data storage nodes have replicated the modification.

Abstract: System and methods are provided for rapid provisioning of data management services. A user creates a data management service through a user interface. The creation of the data management services is initiated by the user without any programming by the user in a scalable, rapidly provisioned environment. The data management service natively supports the CRUD model (create, read, update, and delete) for data entities, metadata, references, as well as other features, such as search capabilities and/or data lineage. Once the data management service has been provisioned, the service scales as usage of the service increases. The data management service is an abstraction layer and the organization that created the service can remain unaware of the underlying implementation details of the service.

Abstract: Techniques of transaction support for a database are disclosed herein. One example technique includes generating a new version value for key-value pairs in the database and creating, in the database, a new key-value pair corresponding to a parameter to be updated with a new value using both the generated new version value and a name of the parameter as a key and the new value as the corresponding value for the created new key-value pair. The example technique can then include determining whether creating the new key-value pair is completed successfully in the database, and in response to determining that creating the new key-value pair corresponding to the parameter is not completed successfully, the existing value of the parameter is returned as a current value of the parameter instead of the new value in response to a query for the current value of the parameter.

Abstract: Cloning storage systems in a cloud computing environment, including: receiving a request to create a cloud-based storage system; retrieving, from cloud-based object storage, one or more objects to include in the cloud-based storage system; and creating the cloud-based storage system, including storing, in block storage of the cloud-based storage system, data contained in the one or more objects retrieved from the cloud-based object storage.

Abstract: A computer-implemented method, a computer program product, and a computer system for detecting an inappropriate data type of a column in a database and building a physical access path over a correct data type. The computer system detects in a table a candidate column with a first data type that has a mismatching type definition, using database usage statistics. The computer system determines whether it is possible to build an additional index as an access path over values with a second data type. The computer system, in response to determining that it is possible to build the additional index, converts values in the candidate column to the values with the second data type. The computer system builds the additional index over the values with the second data type in the table. The computer system generates a query plan operator for the additional index.

Abstract: Bugs in container images can be rapidly identified. For example, a computing device can receive first metadata about a first container image that includes a first version of a piece of software and second metadata about a second container image that includes a second version of the piece of software. The computing device can obtain first source code from a first location indicated in the first metadata and second source code from a second location indicated in the second metadata. The computing device can determine a difference between the first container image and the second container image by comparing the first source code to the second source code. The computing device can generate an output for display indicating the difference between the first container image and the second container image.

Abstract: According to a computer-implemented method, an update package that includes update operational files is received at a computing device. At least one update operational file is to replace a corresponding original operational file for the computing device. It is determined which of the original operational files are to be replaced with corresponding update operational files. A delta file is stored at the computing device, which delta file indicates the original operational files that are replaced with corresponding update operational files and the update package is installed at the computing device.

Abstract: Described is a system that provides deduplication management at a virtualization layer allowing virtual machines to store deduplicated data amongst various back-end data storage architectures. For example, the system may be storage-agnostic by operating at a hypervisor layer to fully leverage the benefits provided by virtualization. Accordingly, implementing deduplication by a hypervisor results in “pluggable” software-defined storage management. In addition, such a system may be implemented on any on-demand infrastructure (e.g. Infrastructure as a Service (IaaS)) environment that includes varying types of back-end storage solutions including solutions from various vendors. In addition, by operating within the virtualized layer of an on-demand computing resource environment (e.g. cloud environment), the system may provide deduplication across different resource clusters (e.g. hypervisor clusters) and environments.

Abstract: A system that implements a data storage service may store data for database tables in multiple replicated partitions on respective storage nodes. In response to a request to back up a table, the service may export individual partitions of the table from the database and package them to be independently uploaded (e.g., in parallel) to a remote storage system (e.g., a key-value durable storage system). Prior to uploading the exported and packaged partitions to the remote storage system, the service may verify that the exported and packaged partitions can be subsequently restored, which may include unpackaging and/or re-inflating the exported and packaged partitions to create additional unpackaged copies of the partitions, re-importing the additional unpackaged copies of the partitions into the database (e.g., as additional replicas), and/or comparing checksums generated for the exported partitions with checksums generated for the additional unpackaged copies of the partitions.

Abstract: Techniques are described that are performed by one or more database management system (DBMS) of the plurality of DBMS nodes comprising one or more database servers performing database operations on one or more databases of the DBMS nodes. The techniques describe receiving, at a QC node, a distributed query that specifying a database of a target DBMS node. Without requesting from the target DBMS node a current logical timestamp of the DBMS node, calculating a synchronization timestamp for the distributed query. In one embodiment, the calculation of the synchronization timestamp for the distributed query is based on a current logical timestamp of the QC node and one or more previous logical timestamps of the target DBMS node that were received prior to the receiving the distributed query. The QC node sends a request to the target DBMS node to execute an operation of the query at the target DBMS node based on the synchronization timestamp.

Abstract: Various embodiments provide for a pre-validation of various aspects of an application deployment before any resources are provisioned in a user account. Pre-validation can perform checks on aspects such as connectivity and credential-based access for instances to be provisioned in a user account. A determination can also be made as to whether a role exists in the user account that has the appropriate policies and permissions to enable these instances, if provisioned, to have access to external services and resources needed to support the application. These checks can be performed through a launch wizard or deployment service that can collect information though a single console, and can ensure that these checks succeed before the requested instances are provisioned in the user account.

Abstract: Systems and methods are disclosed herein for modifying suggestion metadata in an electronic document. A copy request is received to copy a portion of the electronic document. The portion of the electronic document includes a first suggestion having metadata that indicates the suggestion was made by a first user. The copy request is received from a second user. A paste request to paste the copied portion is received from the second user. The metadata of the suggestion is modified based on the paste request to obtain modified metadata.

Abstract: A method for sharing documents between on-demand services is provided. In an embodiment, a user of a first on-demand service may be able to view a list of content that includes content stored at the first on-demand service and content stored at a second on-demand service. The content of the second on-demand service may be associated with information about the content, allowing the content to be shared among multiple users of the first on-demand service. The user wanting to view the content, select or click on an indicator identifying the content, a connection to the second on-demand service is established, and images of the content are sent from the second on-demand service to the first on-demand service.

Abstract: Embodiments include pre-processing work items to be processed by computerized processing elements. Aspects include accessing a performance index, which relates to (dynamic) processing performances of work items as processed by the computerized processing elements. Aspects also include determining a time interval (during which the receiver may group queued work items into a block, according to the accessed performance index. Aspects further includes setting a timer to the determined time interval, to allow the receiver to group work items being queued until that time interval has elapsed, according to the timer set. As a result, a block of grouped work items will be obtained, which can then be passed to a scheduler for subsequent processing by computerized processing elements.

Abstract: Systems and methods are described for load balancing requests in a distributed system using consistent hashing. Specifically, systems and methods are described for using “the power of k choices” when placing new servers on a consistent hash ring used to load balance requests. Rather than placing each new server at a fixed point determined by a hashing algorithm, a load balancer can identify multiple potential points on the hash ring for the new server. The load balancer can then compare these points to determine a preferred location, and place the server at the preferred location. Techniques described herein can substantially improve placement of servers, which in turn results in better load balancing.

Abstract: A System, Computer Program Product, and Computer-executable method for managing an object based storage within a cloud storage provider, the System, Computer Program Product, and Computer-executable method including receiving a data I/O, determining whether the data I/O relates to an existing object within the object based storage, if the data I/O relates to an existing object, updating a stream and existing data object in the object based storage, and creating a new data object and key based on the data I/O and updating the object based storage.

Abstract: In a method for deleting a cascaded snapshot, a storage device includes a logical volume corresponding to a plurality of cascaded snapshots. The plurality of cascaded snapshots comprises at least a first snapshot, a second snapshot, and a third snapshot. The second snapshot is a parent snapshot of the first snapshot, the third snapshot being a child snapshot of the first snapshot. The storage device receives an instruction for deleting the first snapshot. The first snapshot comprises target data. The storage device migrates information of the target data to the second snapshot. Further, the storage device sets a parent snapshot identifier corresponding to the third snapshot to an identifier of the second snapshot, and deletes the first snapshot.

Abstract: The disclosed techniques enable browsing of data items that are stored in a backup storage system in a backup format. A search query from a user is received where the search query is for a data item stored in a data storage system, such as a tape drive, a disk array, or a cloud-based storage system. The system may use an index to look up a data format of the data item. To present the data to the user, the system may perform a restoration operation using two or more staging operations to convert the data format to a format that can be presented to the user.

Abstract: Techniques described herein enhance the durability of cryptographically protected communications sessions. The negotiation of a cryptographically protected communications session results in the negotiation of a primary secret and a secondary secret. The primary secret and secondary secret are stored in separate locations, such as in two locations in RAM, one of which being used as a RAM disk. The primary secret is used to cryptographically protect the communications session. Following the detection of a change of state event, the cryptographically protected communications session switches to the secondary secret in place of the primary secret to cryptographically protect the communications session.

Abstract: A system for discovering and monitoring data movement across the file system on a specific device or across the network, which enables to detect data leakage and locate specific data across the organization. The system tracks files by having devices maintain a record of hash values associated with a file in a tables of hash values. The memory used to maintain the records of each file can be distributed to each device carrying the files. The system can analyze the data leak of a file by receiving a hash value of a file and requesting devices to search and respond with information about files that have the same hash value. Furthermore, based on the table of hash values for all the files, the system can recreate the origination of each file and the number of different versions that exist of the file.

Abstract: A current screen is presented on a display of a user device, which includes an element distinct from a previous element of a previous screen, where the previous element occupied less than an entirety of the previous screen. The user device receives a gesture input that requests that the previous element be presented within the current screen next to a current element of the current screen. The gesture input indicates a location of the current element, wherein the location of the current element is less than an entirety of the current screen and is the same location at which the previous element was presented on the previous screen. The user device presents, on the display of the user device and responsive to receiving the gesture input, a contemporaneous view of the previous element next to the current element at the location of the current element within the current screen.

Abstract: Disclosed are systems, methods, and non-transitory computer-readable storage media for migrating content items from a source user account to a target user account. A user can specify content items in the source user account to be migrated to an existing or new target user account. A new content entry including an account identifier of the target account and a pointer to the content item can be created for each migrated content item. Further, a determination can be made as to whether a sharing link to each content item exists, and if so, the content pointer of the old content entry is modified to forward or redirect to the new content entry. An active flag associated with the old content entry can be set to false or 0 to indicate that the old content entry is no longer active.

Abstract: Disclosed is a method, apparatus, and system for a method for implementing a mutual-exclusion semantic for target update, the method comprising: receiving a tagset update request for a tagset associated with an object, the tagset update request comprising one or more metadata tags to be updated; determining whether updating the tagset based on the received tagset update request would cause a value of any existing metadata tag in the tagset to change; and in response to determining that updating the tagset based on the received tagset update request would cause a value of at least one existing metadata tag in the tagset to change, rejecting the tagset update request.

Abstract: A server in a blockchain distribution network includes a processor and a transceiver operatively coupled to the processor. The transceiver is configured to receive a transaction from a peer node. The processor is configured to assign a transaction identifier to the transaction. The transceiver is configured to propagate the transaction identifier to one or more additional peer nodes and one or more additional servers in the blockchain distribution network. The transceiver is configured to receive bytes of a blockchain that represents a plurality of transactions. The blockchain includes the transaction identifier corresponding to the transaction. The transceiver is further configured to propagate the bytes of the blockchain to the one or more additional peer nodes and to the one or more additional servers in the blockchain distribution network.

Abstract: Methods, systems, and computer program products are described herein for updating big data tables using snapshot isolation. The tables may store data (e.g., as data objects) collected from different users. The tables are stored in a first data store. The data's metadata is stored in a second data store. The metadata comprises version numbers for the objects that correspond to a consistent version thereof. When an update process for the table is initiated, a coordinator locks the metadata, and. the objects are updated. If the update to the objects is successful, the coordinator commits the updates and obtains the new version numbers of the objects. If all the commits are successful, the coordinator atomically updates the metadata with the new version numbers and releases the lock. However, if a commit to an object is unsuccessful, a subsequent process rolls back the committed objects to the version numbers specified by the metadata.