Abstract: Systems and methods are provided for adaptive data replication. A first data object is stored. One or more first network characteristics of a communication network are detected. A first replication mode is triggered (e.g., a single-master replication mode) based on the one or more first network characteristics of the communication network. The single-master replication may be configured to facilitate real-time synchronizations (e.g., for critical updates). One or more second network characteristics of the communication network are detected. A second replication mode (e.g., a multi-master replication mode) is triggered based on the one or more second network characteristics. The second replication may be configured to facilitate a delayed synchronization (e.g., for non-critical updates) of the first data object and the second data object using the second update file.

Abstract: Graphics processors for implementing multi-tile memory management are disclosed. In one embodiment, a graphics processor includes a first graphics device having a local memory, a second graphics device having a local memory, and a graphics driver to provide a single virtual allocation with a common virtual address range to mirror a resource to each local memory of the first and second graphics devices.

Abstract: A technique provides efficient data failover by creation and deployment of a protection policy that ensures maintenance of frequent common snapshots between sites of a multi-site data replication environment. A global constraint optimizer executes on a node of a cluster to create the protection policy for deployment among other nodes of clusters at the sites. Constraints such as protection rules (PRs) specifying, e.g., an amount of tolerable data loss are applied to a category of data designated for failover from a primary site over a network to a plurality of (secondary and tertiary) sites typically located at geographically separated distances. The optimizer processes the PRs to compute parameters such as frequency of snapshot generation and replication among the sites, as well as retention of the latest common snapshot maintained at each site to create a recovery point and configuration of the protection policy that reduces network traffic for efficient use of the network among the sites.

Abstract: Systems and methods for geographically distributed node replication include a first node which receives a message from a client based on a proximity of the first node to the client, the message transmitted to the first node via anycast routing from the client. The first node may replicate the message to a first subset of the geographically distributed system of nodes based on a geographic proximity of nodes within the first subset. The first node may publish the message to a data feed of a message bus for the system of nodes, to cause at least one node of the system of nodes to receive the message from the first node, the at least one node outside the first subset and subscribing to the data feed of the first node.

Abstract: Various embodiments for a data management system for managing inferences are described herein. An embodiment operates by detecting a signal to perform a replication task. Parameters corresponding to the replication task are identified. The replication task is configured to at least partially replicate a source data table from a source repository to a target data table in a target repository, based on the parameters. It is determined that a columnar structure of a first column of the source data table including data to be replicated matches a columnar structure of a second column of the target data table where the data is to be replicated to. The replication task is executed responsive to the determination of the matching structures, the replication task including performing one or more arithmetic operations on the data.

Abstract: In response to receiving a request for an identity key from a first entity, an identity key for the first entity is generated. A first request from the first entity to replicate a set of data is received. The generated identity key for the first entity is added to the metadata of the set of data requested to be replicated. A determination is made whether a replication rule exists for the first entity. In response to determining that a replication rule exists for the first entity, the set of data is replicated according to the replication rule for the first entity.

Abstract: Provided methods and systems allow dynamic rendering of a reflexive questionnaire based on a modifiable spreadsheet for users with little to no programming experience and knowledge. Some methods comprise receiving a modifiable spreadsheet with multiple rows, each row comprising rendering instructions for a reflexive questionnaire from a first computer, such as a data type cell, statement cell, logic cell, and a field identifier; rendering a graphical user interface, on a second computer, comprising a label and an input element corresponding to the rendering instructions of a first row of the spreadsheet; receiving an input from the second computer; evaluating the input against the logic cell of the spreadsheet; in response to the input complying with the logic cell of the spreadsheet, dynamically rendering a second label and a second input element to be displayed on the graphical user interface based on the logic of the first row.

Abstract: Disclosed herein are various embodiments a code simplification system. An embodiment operates by determining that a software version of a coordinator node is different from a software version of one or more worker nodes, Commits by the one or more worker nodes to a database are disabled based on the determination that the software versions differ. An update is performed on each of the one or more worker nodes. An acknowledgement that the update on each of the one or more worker nodes has completed is received, and the commits to the database by the one or more worker nodes is enabled.

Abstract: In one embodiment, a method comprises maintaining state information regarding a data replication status for a storage object of the storage node of a primary storage cluster with the storage object being replicated to a replicated storage object of a secondary storage cluster, temporarily disallowing input/output (I/O) operations when the storage object has a connection loss or failure. The method further includes initiating a resynchronization between the storage object and the replicated storage object including initiating asynchronous persistent inflight tracking and replay of any missing I/O operations that are missing from one of a first Op log of the primary storage cluster and a second Op log of the secondary storage cluster, and allowing new I/O operations to be handled with the storage object of the primary storage cluster without waiting for completion of the asynchronous persistent inflight tracking and replay at the secondary storage cluster.

Abstract: Techniques are provided for timestamp consistency. An operation targeting a first storage object having a synchronous replication relationship with a second storage object is intercepted. A timestamp is assigned to the operation. A replication operation is created as a replication of the operation. The same timestamp is assigned to the replication operation. The operation is implemented upon the first storage object and the replication operation is implemented upon the second storage object.

Abstract: With multiple software applications, multiple electronic devices for a user to access and work upon, and multiple potential storage locations for the files it is difficult for a user to remember the identity of a file worked upon, its storage location, or which application they employed. Whilst some applications provide a user with a listing of recently opened files these are only those accessed by that specific application upon a specific device. Embodiments of the invention provide users with a synthesized centralized view of all files accessed irrespective of where the user has stored the electronic content, with which electronic device the electronic content was accessed with, or with which software application the electronic content was accessed with.

Abstract: A file data access method and apparatus, and a medium. The method includes: when a file copy instruction is received, creating a backup file; recording, in metadata of an original file, identification information of the backup file, and recording, in metadata of the backup file, identification information of the original file; when a read instruction for a first target file is received, determining whether there is a data object corresponding to the first target file; if YES, reading the data object; and if NO, determining a first target original file associated with the first target file according to identification information recorded in metadata of the first target file, and reading a data object of the first target original file. During data backup, an original file may be backed up by merely recording, in metadata, identification information of an associated file, without copying a data object.

Abstract: With multiple software applications, multiple electronic devices for a user to access and work upon, and multiple potential storage locations for the files it is difficult for a user to remember the identity of a file worked upon, its storage location, or which application they employed. Whilst some applications provide a user with a listing of recently opened files these are only those accessed by that specific application upon a specific device. Embodiments of the invention provide users with a synthesized centralized view of all files accessed irrespective of where the user has stored the electronic content, with which electronic device the electronic content was accessed with, or with which software application the electronic content was accessed with.

Abstract: Disclosed in embodiments of the present disclosure are methods and apparatuses for realizing a globally unique index, which are applicable to a distributed database. One of the methods includes: receiving a structured query language, SQL, request, obtaining a conflict detection SQL statement corresponding to the SQL request and calculating an expected value; issuing the conflict detection SQL statement to each database node for execution; obtaining an execution result of the conflict detection SQL statement, and comparing the execution result of the conflict detection SQL statement with the expected value; and when the execution result of the conflict detection SQL statement is less than or equal to the expected value, processing an original SQL statement of the SQL request, and issuing the original SQL statement to the each database node for execution.

Abstract: Techniques for providing horizontally scaled caching of versioned data are provided. In some aspects, the techniques described herein relate to a method including initializing a first version cache (VC) object based on a version of data stored in a data storage device; replicating the first VC to generate a second VC; receiving a write operation at the first VC; generating a delta for the write operation, the delta representing a change in the version of data; writing the delta to a persistent replication log, the persistent replication log storing an ordered set of deltas including the delta; writing data in the write operation to the data storage device; and applying the ordered set of deltas at the second VC to update data stored by the second VC.

Abstract: A method may include: receiving a notification of a triggering event, the triggering event identifying an associated product; accessing a baseline configuration for the product; transmitting a notification to a recipient responsible for maintaining the baseline configuration for the product; receiving an approved update to the baseline configuration from the recipient; generating an updated baseline configuration for the product based on the approved update; querying a database to identify an application subscriber for the triggering event for the product; and transmitting the updated baseline configuration to the identified application subscriber.

Abstract: Systems and methods for moving, reconciling, and aggregating data from mainframe computers to hybrid cloud are disclosed.

Abstract: A method for validating a query result for a query of a database uses an index of the database. A selection of a set of source data from the database is received and a first hash operation is performed on the source data in the database resulting in a database hash value for the source data. A second hash operation is performed on the source data in the index resulting in an index hash value. The index hash value is compared with the database hash value, and a guarantee indication is provided for the source data in the index.

Abstract: Database synchronization by initiating a transaction to synchronize data from a source database to a target database. The source database issues a trigger that provides a sequence identification (ID) and calculates a thread number that is employed for syncing the rows from the source database to the target database based on a primary key hash. The sequence identification (ID) and the thread number from the source database is inserted into a synchronization (SYNC) table. Data synchronization may also include picking the rows that are allotted their thread number from the SYNC table using polling threads. The rows from the SYNC table may be replicated into target database using a sequence provided by the sequence identification and thread number.

Abstract: The present disclosure describes storage techniques for hybrid transactional and analytical processing. Data captured by a first processing engine may be received. The first processing engine may be configured to perform online transactional processing). Multiple replicas of logical logs generated based on the data may be distributed to a Delta Store by applying a quorum protocol on the multiple replicas. Data in the Delta Store are stored in a row format and are visible to a query for online analytical processing performed by a second processing engine. Data may be flushed from the Delta Store to a Base Store based on one or more predetermined rules. Data in the Base Store are stored in a columnar format and may be accessible by the second processing engine.

Abstract: Replicas may be added to a multi-leader replica group for a data set. A new replica may be added to a group of replicas by copying a version of the data set according to a point in time to the new replica. As updates may occur at different ones of the replicas when the new replica is added, updates that occurred at a source replica for the snapshot and other replicas may be replicated by the different replicas according to the point in time at which the snapshot is created without blocking updates at any of the replicas in the replica group.

Abstract: The disclosed technology includes systems and methods for automatically generating a dynamic system context diagram based on machine-readable code. A method can include receiving, at a rules engine, machine-readable code describing interactions among a plurality of applications in software architecture, evaluating, with the rules engine in communication with a system of record (SoR), compliance of the interactions among the plurality of applications according to the SoR, identifying, with the rules engine, and based on compliance evaluation, one or more dependencies among the plurality of applications, generating, with an output engine, a system context diagram image comprising a graphical representation of the plurality of applications with associated interactions and dependencies, and outputting, for display, the system context diagram image.

Abstract: An incremental backup is made of a source volume on a production host to on premise secondary storage. The incremental backup includes a bitmap specifying locations of blocks that have changed since a last backup of the source volume, and data of the changed blocks. First checksums are calculated from data of the changed blocks. The incremental backup, including the changed blocks and the bitmap, are moved to cloud storage. The changed blocks are merged, at the cloud storage, with the last backup of the source volume to generate a synthetic full backup of the source volume. The bitmap is consulted to identify locations of the changed blocks. Second checksums are calculated from data written to the locations on the synthetic full backup. The first and second checksums are compared. If the first and second checksums do not match, an indication is generated that the synthetic full backup is corrupt.

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 data dictionary generation system automatically populates and updates a data dictionary for listings offering shared data. The data listing distribution component distributes the data dictionaries to various remote deployments in a data exchange by using a global messaging framework and replication method. For example, the data listing distribution component replicates a data dictionary generated for the listing and its shared data from a source deployment to one or more destination deployments associated with various geographic regions. The data listing distribution component distributes the listing to the various remote deployments to allow for the listing, including its shared data and data dictionary, to be accessed by users within the geographic region associated with the remote deployment.

Abstract: A method, computer system, and a computer program product for managing a multi-vendor environment is provided. The present invention may include receiving a request to make a change to an aggregate computer system from a participant of the aggregate computer system. The present invention may include creating, in response to the request, a change block. The present invention may include receiving approval for the change block in accordance with an endorsement policy. The present invention may include adding the change block to a distributed ledger. The present invention may include monitoring a performance of the aggregate computer system.

Abstract: In one aspect, a method includes forming, at a database platform, a file stage in a user account on the database platform, the user account being associated with a client, forming, at the database platform, a hidden stage directory table and a data pipeline for the file stage, and binding the data pipeline to the file stage. The method also includes receiving a notification of an event of the file stage. The method also includes identifying the data pipeline corresponding to the file stage. The method also includes updating the hidden stage directory table of the identified data pipeline.

Abstract: Direct storage loading may be used to add data to a database. New data may be added to a database, using nodes different than a database engine to access a database. The addition of the new data may be assigned to different nodes. The nodes may obtain the data and store the data to storage locations according allocated space in the database by the database engine. The new data can then be made available for access at the database engine.

Abstract: A data replication method includes obtaining differential data information corresponding to differential data, where the differential data information includes a storage address of the differential data, and a determining value of the differential data, replicating the differential data from the primary volume to the secondary volume according to the storage address of the differential data that is located in the primary volume when the determining value is not less than a preset threshold, and taking a snapshot for the primary volume when the determining value is less than the preset threshold and replicating the differential data to the secondary volume.

Abstract: Methods and systems disclosed herein allow data to be transferred from a data source to a target database with little to no offline period or data corruptions. The methods and systems describe a server that generates a temporary data repository having a similar configuration as the target data repository; transmits the set of new data records from the data source to the temporary data repository; identifies dependency relationship attributes among the data records stored within the target data repository; and when the server identifies that a predetermined number of data records and their respective dependent data records are stored within the temporary data records, the server merges the set of data records and the set of new data records. The server also stores a pre/post merger record of data such that the server can revert to a previous version of data or roll forward to another version.

Abstract: Described embodiments provide systems and methods of providing accessing to a file. A client device may store a copy of a file. The copy may be generated during active use of the file in which content of the file is accessible by the client device via an application hosted on a remote computing device. Responsive to a loss in connectivity that disrupts the active use of the file, the client device may identify a local application on the client device based at least on a type of the file. The client device may use the identified local application to access the copy of the file stored on the client device and continue the active use of content of the file. Subsequent to restoring the connectivity, the client device may provide the file to the remote computing device for synchronization of the file.

Abstract: A method, system, and computer program product to plan and schedule executions of various utility tasks of a utility command during a maintain window, the method including receiving a utility command. The method may also include identifying possible utility tasks used to execute the utility command. The method may also include determining preferred utility tasks. The method may also include calculating a degree of parallelism for the preferred utility tasks. The method may also include generating a utility execution plan for the utility command. The method may also include analyzing the utility execution plan against resource constraints of a time window and sub time windows of the time window. The method may also include generating a time window execution plan for each sub time window of the sub time windows. The method may also include updating the utility execution plan with the time window execution plans.

Abstract: A data storage management approach is disclosed that performs backup operations flexibly, based on a dynamic scheme of monitoring block changes occurring in production data. The illustrative system monitors block changes based on certain block-change thresholds and triggers block-level backups of the changed blocks when a threshold is passed. Block changes may be monitored in reference to particular files based on a reverse lookup mechanism. The illustrative system also collects and stores historical information on block changes, which may be used for reporting and predictive analysis.

Abstract: A computer system is provided that stores reference data records and event data records that each correspond to one of the reference data records. Tokens are generated from the reference data records and sorted into subsets. Each reference data record that has a given token is included in the corresponding subset. A correlation value is calculated between members (e.g., the reference data records) of the subsets. The correlation values are calculated by determining a common time, calculating a reference value, calculating a percentage difference from the reference value, and then determining a correlation value (e.g., a correlation coefficient) using the percentage difference.

Abstract: In one general embodiment, a computer program product for determining whether to process a uniform resource locator (URL) comprises a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, and where the program instructions are executable by a processor to cause the processor to perform a method comprising selecting, by the processor, a portion of a hash table, identifying, by the processor, a plurality of uniform resource locators (URLs) stored within the selected portion of the hash table, and for each of the plurality of identified URLs, individually determining, by the processor, whether to process the identified URL, based on data associated with the identified URL.

Abstract: Methods, computer program products, and/or systems are provided that perform the following operations: generating log files while performing data changes of a source database system table; storing the log files on a first memory device having a first access time; archiving a part of the log files from the first memory device on a second memory device having a second access time, the second access time being higher than the first access time; tracking a second number of pending data changes, the pending data changes being data changes of the records of data change of log files archived on the second memory device which are not yet replicated in a target database system table; selecting a type of data replication from a first type of data replication and a second type of data replication based on the second number; and replicating the data changes in the target database system table.

Abstract: Replication of search-related configuration customizations across multiple individual configuration files of search heads of a cluster for a consistent user experience. A search head leader of the cluster can receive a first journal entry relating to a first customization of a knowledge object from a first search head of the cluster. The search head leader may determine that the first journal entry references a parent commit journal entry matching a latest commit journal entry in a journal maintained by the search head leader. The first journal entry can be stored in the journal and sent to one or more search heads of the cluster.

Abstract: An example apparatus includes a distance matrix generator to determine a number of remapping combinations corresponding to a first and a second household demographic model, generate (a) a first age-based household demographic model and a second age-based household demographic model and (b) a third age-based household demographic model and a fourth age-based household demographic model, generate a first distance matrix corresponding to the first and the third age-based household demographic model, and generate a second distance matrix corresponding to the second and the fourth age-based household demographic model; a distance matrix identifier to determine a first and a second reassignment distance; and a person identification assigner to assign a person identification number of a first person corresponding to the first household to a second person corresponding to the second household based on the first distance matrix or the second distance matrix.

Abstract: Methods, processing units, and computer-readable media in a cloud-based database are described. Redo log records are applied to a page at a database replica only when an updated version of the page is requested at the database replica. A log cache may be used by a replica node of the database to track recent redo log records applicable to a given page. The recent redo log records stored in the log cache may be applied to update the page on-demand when an updated version of the page is requested. By applying only the redo log records applicable to pages that are currently being requested, processing resources may be used only to generate pages that are currently required. Methods for registering redo log records into the log cache by the master or replica server are also described.

Abstract: A method comprises dividing a plurality of operations of a microservice between a plurality of databases, and synchronizing data corresponding to the plurality of operations between the plurality of databases. The microservice is a create, read, update, delete (CRUD) microservice, and the plurality of operations comprise creating, reading, updating and deleting the data.

Abstract: Cached data is updated by a computing machine coupled to a primary database maintaining original data and to a cache maintaining data corresponding to the data in the primary database. In response to receiving a first database query relating to a first data, the computing machine determines whether to process the first database query by utilizing the cache or based on the primary database. In response to concluding processing the first database query, the computing machine determines whether to update the first data in the cache, and based on the result of the determining, updates the first data in the cache based on original first data in the primary database.

Abstract: Systems and methods as disclosed herein are provided for generating a research study application. A request to generate a research study is received from a user. A plurality of task generation options are presented on a graphical user interface of an electronic device. The plurality of task generation options are selected from the group consisting of a consent survey, an eligibility survey, a medical history survey, and a medical tracking survey. Input regarding the plurality of task generation options is received from the user. Additionally, a research study application is generated based on information received from the user.

Abstract: Disclosed herein are system, method, and computer program product embodiments for the performing of a replication task in a multi-database system, by a replication agent, for replicating a location range of columns in a table in a source repository data object, to a location range of columns in a target table in a target repository data object. An embodiment operates by using a data provisioning agent, remote source connection, and replication task controller in sequence to set up a replication task for execution.

Abstract: Predictive queue flushing for real-time synchronization of data sets between two data stores, comprising a data synchronization software module that interfaces with each data store, and uses a queue monitor to record and store changes to data on each data store and calculate velocity and acceleration of event arrivals, and a policy manager to manage synchronization, and a query generator to incorporate policies from the policy manager and measurements from the queue monitor to direct the data synchronization software module, flushing the change queue in accordance with the established synchronization policy, yielding synchronized shared data sets.

Abstract: In one general embodiment, a computer-implemented method includes selecting a portion of a hash table, identifying a plurality of uniform resource locators (URLs) stored within the selected portion of the hash table, and for each of the plurality of identified URLs, individually determining whether to process the identified URL, based on data associated with the identified URL.

Abstract: As described herein, a system, method, and computer program are provided for preventing user mistakes when making database changes. In use, a user command to modify a database is received. The user command is validated against a plurality of predefined business rules. One or more actions are conditionally performed before executing the user command, based on a result of the validating.

Abstract: Techniques to process metadata involve: in response to receiving a modification transaction for metadata on a computing device, acquiring information related to a busyness degree of the computing device; and according to at least a determination that the busyness degree is greater than a threshold degree, modifying the metadata in a metadata storage apparatus of the computing device directly without generating a log related to the modification transaction in a log storage apparatus of the computing device. Accordingly, such techniques can achieve good processing performance irrespective of a busy state or non-busy state of a computing device. In particular, when the computing device is in a busy state, a newly triggered modification transaction can still be timely executed, thereby improving IOPS performance of the computing device in a busy state.

Abstract: According to one or more aspects of the present disclosure, operations may include obtaining a token transaction request of a token transaction that includes a transfer of assignment of a crypto-token of a crypto-medium from a first entity to a second entity. The token transaction request may be a request to initiate the token transaction. The operations may further include generating a transaction signature in response to obtaining the token transaction request. The operations may include validating the token transaction using the digital signature and blocks of a private blockchain that includes a blockchain record of all transactions of the crypto-medium. In these or other embodiments, the operations may include generating a new block for the private blockchain, the new block including an update to the blockchain record that indicates the token transaction details. The generating of the new block may be triggered by the token transaction being validated.

Abstract: Techniques and structures to synchronize hierarchical data, comprising. A conflict between data stored at a computing device and data stored at a service provider database is detected. A synchronization operation is performed to synchronize a plurality of objects within the hierarchical entity data stored at the computing device with hierarchical entity data stored at the service provider database.

Abstract: In a running distributed data storage system that actively processes I/Os, metadata nodes are commissioned and decommissioned without taking down the storage system and without introducing interruptions to metadata or payload data I/O. The inflow of reads and writes continues without interruption even while new metadata nodes are in the process of being added and/or removed and the strong consistency of the system is guaranteed. Commissioning and decommissioning nodes within the running system enables streamlined replacement of permanently failed nodes and advantageously enables the system to adapt elastically to workload changes. An illustrative distributed barrier logic (the “view change barrier”) controls a multi-state process that controls a coordinated step-wise progression of the metadata nodes from an old view to a new normal. Rules for I/O handling govern each state until the state machine loop has been traversed and the system reaches its new normal.