Abstract: Automated discovery of relationships between entities within an IT environment. A technique is performed by a relationship module that performs a discovery search for entity relationships to produce a set of relationship search results. The relationship module then generates a set of relationship definitions from the set of relationship search results which are stored to a relationship collection in a data store. A technique for automatically updating entity and relationship definitions and removing outdated entity and relationship definitions stored to a data store. An update module automatically updates entity and relationship definitions at predetermined time intervals. The update history in each definition is also modified to reflect the update process. A retire module automatically removes outdated definitions using the update history in each definition.

Abstract: A method of providing examples to a computerized conversation agent includes associating one or more triplets of two concepts and a relationship therebetween with an intent related to a query. The triplet is embedded in a knowledge graph and the concepts in the knowledge graph are mapped to the intent. A call log is scanned for examples of the intent based on the concepts in the knowledge graph and the examples are mapped to the intent.

Abstract: A method and apparatus for enriching metadata are disclosed. For example, the method implemented via a processor monitors metadata associated with a first webpage of a plurality of webpages, the first webpage having been determined to be similar to a second webpage of the plurality of webpages, detects a change to the metadata associated with the first webpage, determines whether the change to the metadata associated with the first webpage invokes an update to a metadata associated with the second webpage, and processes the update of the metadata associated with the second webpage when the change invokes the update to the metadata associated with the second webpage.

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: Techniques are provided for implementing write ordering for persistent memory. A set of actions are identified for commitment to persistent memory of a node for executing an operation upon the persistent memory. An episode is created to comprise a first subset of actions of the set of actions that can be committed to the persistent memory in any order with respect to one another such that a consistent state of the persistent memory can be reconstructed in the event of a crash of the node during execution of the operation. The first subset of actions within the episode are committed to the persistent memory and further execution of the operation is blocked until the episode completes.

Abstract: Disclosed herein are system, method, and computer program product embodiments for providing a lock-free parallel log replay and synchronization scheme to support asynchronous table replication. By synchronizing a replica table with the server-side data and conducting subsequent updates using transaction logs via a replayer, locking of tables may be avoided. A consistent transactional state may be maintained by employing a replayer to mark the table as enabled instead of a synchronizer. The replayer may also deduce transitive closures among transactions and replay the transactions in parallel based on the deduced transitive closures to optimize playback. These techniques provide enhanced data availability and minimize database blocking and deadlocking while improving query performance.

Abstract: An information management system according to certain aspects allows users to share a portion of a file (e.g., a document) stored in secondary storage. The user may specify a portion of a secondary storage file to share and send a link to the portion to another user. The other user can access the shared portion from the link, and just the shared portion may be restored from secondary storage. The system according to certain aspects provides a native view of secondary storage data on a client computing device. The index data and/or metadata relating to secondary storage data may be stored in native application format for access via the native source application.

Abstract: A distributed data processing system for a database composed of data records organized into tables for responding to a request to split an index in a consistent and concurrent fashion. A request to split an index atom at any given node is processed by a designated “chairman” for that index atom. The chairman splits its index by maintaining a lower portion thereof and by moving the contents of an upper portion to a newly created index atom as the right sibling. Each other node takes appropriate steps to assure orderly transfer of this information from the chairman consistently and concurrently across the distributed database processing system.

Abstract: Techniques are described for performing dependency locking to enable parallel execution of database server processes modifying the same object. In an embodiment, a DBMS receives a request to execute an operation on its managed database. The request may include an object identifier and a version identifier for a version of a database object, which is required for the successful execution of the operation on the database. The required version of the database object may not exist and may be generated only after the execution of another, second, operation on the database. The first database server process initiates execution of the earlier received operation on the database. The first database server process queries the first database for the version of the particular database object and determines that the version of the database object does not exist yet, in one embodiment.

Abstract: In an example, method of data protection in a document database system includes grouping documents input to the document database system into super documents, each of the super documents including a plurality of chunks, each of the plurality of chunks including one of the documents. The method further includes operating an object storage system according to a storage policy that implements parity processing, where the parity processing includes computing parity chunks for the super documents and storing the parity chunks in an object store, where a plurality of the parity chunks are computed for each of the super documents. The method further includes sending each of the super documents to the object storage system for parity processing according to the storage policy.

Abstract: Recovery support techniques for storage virtualization environments are described. In one embodiment, for example, a method may be performed that comprises defining, by processing circuitry, a storage container comprising one or more logical storage volumes of a logical storage array of a storage system, associating the storage container with a virtual volume (vvol) datastore, identifying metadata for a vvol of the vvol datastore, and writing the metadata for the vvol to the storage system. Other embodiments are described and claimed.

Abstract: The invention provides systems, methods and computer program products for executing remote application iteration(s) of client application software on a remote server platform, and for enabling each remote application iteration of a client application software to have access to a corresponding instance of an application software environment that contains or otherwise has access to data object(s) necessary for execution of the remote application iteration. The invention additionally enables execution of a remote application iteration of a client software application at a remote server platform, through need-based or dynamic retrieval of data objects from an on-premise device for provisioning (on the remote platform server) an instance of the client software application environment required for execution of the remote application iteration of the client software application.

Abstract: Systems and methods are provided for storing a first data object comprising a first set of immutable components, the first data object being associated with a corresponding second data object stored by a remote replication system. A difference is determined between the first set of immutable components of the first data object and a second set of immutable components of the corresponding second data object. A subset of immutable components is identified from the first set of immutable components based on the difference. The subset of immutable components from the first set of immutable components is provided to the remote replication system over a communication network.

Abstract: Systems and techniques are described for transferring data. A described technique includes determining that a first replica of an object stored at a first host has become available to a distributed storage system after previously being unavailable to the distributed storage system. The object includes a range of memory addresses at which data of the object is stored. In response to determining that the first replica has become available, resyncing data for the first replica is obtained. The resyncing data indicates whether each range of memory addresses is synchronized at the first replica with other replicas of the object. Tracking data for the first replica is obtained. The tracking data indicates whether data stored at the range of memory addresses of the object has been modified at a second replica while the first replica was unavailable. The resyncing data is updated based on the tracking data.

Abstract: Systems, computer program products, and methods are described herein for monitoring lower level environment for unsanitized data. The present invention is configured to initiate a retrieval query with a first database in a lower level environment; retrieve one or more data items from the first database based on at least the retrieval query; compare the retrieved one or more data items with one or more records associated with a production environment; determine a match between the one or more data items and the one or more records based on at least the comparing; retrieve matched data based on at least determining the match; and transmit control signals configured to cause a user device associated with a user to display the matched data.

Abstract: Systems and methods are disclosed for dynamically assigning a search head or search nodes in a data intake and query system for a query received by the data intake and query system. Existing search heads and search nodes can periodically report their status to the data intake and query system, which can use that information to help determine the need to provision additional search heads and search nodes. The data intake and query system can receive a query identifying a set of data to be processed and a manner of processing the set of data. The data intake and query system can use the status information for existing search heads and search nodes to dynamically assign a search head and search nodes for the query. Dynamically assigning the search head and search nodes in this manner may provide many benefits, including improved load balancing and resource utilization.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for recovering a database, distributed in two or more storage devices, based on a backup of each storage device. The backup of each storage device is acquired. In association with the backup for each storage device, a quiesce point indication is acquired. The quiesce point indication indicates backed up data of each storage device. The backed up data is based on a quiesce point. For each storage device, a recovery process is selected. For each storage device, in response to the selected recovery process being a collective copying process, recovering contents of each storage device is done by collective copying. In response to the selected recovery process being to recover based on the quiesce point indication, the contents of each storage device is recovered based on the indicated backed up data of the quiesce point indication.

Abstract: The present disclosure relates to systems, methods and computer programs for managing end user data deletion by communicating a prepare for deletion message to one or more two-step deletion subscriber entities to instruct them to prepare to enact a data deletion request, and communicate a deletion message to the one or more two-step target subscriber entities only after a ready for deletion message is received from each of the one or more two-step deletion subscriber entities.

Abstract: The present invention provides a contact management, creation, and filtering application on a mobile or computing devices by providing a contact list or address book with enhanced searching capabilities, whether the original address book or contact list is created by the application software of the present invention, with other application software while the application software of the present invention is running in the background, or the address book or contact list is being modified or sync either using the application software.

Abstract: A method, a master database node and a subscriber database node for optimizing an index. The method for optimizing index includes: checking, by a master database node, if role information of an index matches role information of the master database node, when the index is added into the master database node; updating database information by using the index when the role information of the index matches the role information of the master database node. In this invention, unnecessary indexes in the master database node and the subscriber database node are reduced while keeping the schema the same. Furthermore, unnecessary logs transmitted from the master database node to the subscriber database node are reduced.

Abstract: An apparatus is configured to initiate a first replication session to replicate data of a first consistency group in a first storage system to a second consistency group in a second storage system, to create an additional consistency group linked to the second consistency group in the second storage system, and to initiate a second replication session to replicate data of the additional consistency group to another consistency group in a third storage system. The additional consistency group linked to the second consistency group in some embodiments is periodically updated against the second consistency group. For example, in one or more embodiments the second consistency group is updated based at least in part on an active snapshot set of the first replication session, and the additional consistency group is updated based at least in part on the second consistency group.

Abstract: The present invention generally relates to network-attack-resilient intrusion-tolerant Supervisory Control and Data Acquisition (SCADA) systems. Some implementations utilize redundant, proactively-recovery-configured servers at multiple centers communally executing a replication protocol. Some implementations, in addition to control centers, include data centers, which participate in the replication protocol, except that they may not be capable of controlling remote units such as Remote Terminal Units (RTUs).

Abstract: One embodiment provides a method, including: receiving, at an information handling device, an indication of unsaved data; determining, using a processor, whether an identified loss potential for the unsaved data necessitates an adjustment to a backup protocol for the information handling device; and adjusting, responsive to determining that the adjustment is necessitated, the backup protocol. Other aspects are described and claimed.

Abstract: In one example, a method for a distributed model of data ingestion includes receiving multiple asynchronous backup requests from a plurality of clients, and performing primary processing with respect to data elements of a first one of the backup requests. Next, a job concerning a secondary process is added to a job queue. A handoff is then made for performance of the secondary processing with respect to data elements of the first backup request. The job is then accessed and the secondary processing is performed with respect to the data elements of the backup request, wherein the primary processing and secondary processing are respective first and second stages of an ingestion process, and the primary processing is performed prior to the secondary processing.

Abstract: This present application discloses a method and apparatus for synchronizing data in a robot operating system. A specific implementation of the method includes: detecting an operation on data being transmitted between communication processes, wherein the operation includes at least one of updating the data, deleting the data, and storing the data; determining whether the data are persistent data, in response to positively detecting an operation on the data being transmitted between the communication processes; and transmitting a change message of the data to communication processes other than the communication processes in response to positively determining that the data are persistent data. In the embodiment, the persistent data may always remain consistent across the communication processes.

Abstract: Methods, systems, and devices supporting a data model abstraction framework are described. Some platforms (e.g., a multi-tenant cloud computing platform) may manage data across a number of persistent systems (e.g., cloud platforms, data stores, packages, etc.). To efficiently manage data across such systems, a platform may implement a metadata-driven abstraction layer. The abstraction layer may support a number of interface objects and interface fields, which may operate as abstracted versions of persistent objects and persistent fields. External entities (e.g., users, triggers, customizations, packages, plugins, or any other entities) may interact with the interface objects, and the abstraction layer may automatically handle mappings from the interface objects to the persistent systems. By using the metadata-driven abstraction layer, the platform may resolve conflicts between the external entities and multiple underlying persistent systems.

Abstract: Systems and methods for enforcing retention policies with respect to virtual machine snapshots are disclosed. In one implementation, a method may include identifying, by a virtualization manager, a snapshot of a virtual machine hosted by a host computer system. The method further includes retrieving, from metadata associated with the snapshot, a value of a time to live (TTL) parameter associated with the snapshot. The method also includes responsive to determining that the value of the TTL parameter satisfies a threshold criterion, deleting the snapshot.

Abstract: Embodiments of the present invention allow a Source database and a Target database to be compared and merged in such a way that logically relevant data is considered and merged while ignoring irrelevant differences (e.g., object identifiers) and that all dependencies across relational database tables are considered and merged. Some exemplary embodiments are discussed herein with reference to databases such as the Standard Database (SDB) for Intergraph Smart™ Reference Data product from Intergraph Corporation and are referred to generally as the “SDB Merge Tool,” although the disclosed concepts can be applied more generally to other types of databases.

Abstract: Techniques are provided for transitioning a first storage object and a second storage object from an asynchronous replication state to a synchronous replication state. Metadata operations are logged into a metadata log. Dirty data, modified by data operations executed upon the first storage object, are tracked using a dirty region log. Metadata operations are replicated from the metadata log to the second storage object during a metadata drain phase. During the metadata drain phase, incoming operations are logged into the metadata log when the metadata log has a non-zero size, otherwise, the metadata operations are replicated to the second storage object. After the metadata drain phase, a data drain phase is performed using the dirty region log.

Abstract: Node clustering configuration is disclosed herein. An example method includes determining nodes of a cluster, each of the nodes having a unique identifier and a cluster identifier for the cluster, determining a voting configuration for the cluster, the voting configuration defining a quorum of master-eligible nodes of the nodes, the voting configuration being adaptable so as to maintain an optimal level of fault tolerance for the cluster, and electing one of the master-eligible nodes as a master node.

Abstract: Various embodiments of the invention disclosed herein provide techniques for performing distributed anti-entropy repair procedures across a plurality of nodes in a distributed database network. A node included in a plurality of nodes within the distributed database network determines, before all other nodes included in the plurality of nodes, that a first anti-entropy repair procedure has ended. The node determines that a second anti-entropy repair procedure is ready to begin. The node generates a schedule for executing one or more operations associated with the second anti-entropy repair procedure. The node writes the schedule to a shared repair schedule data structure to initiate the second anti-entropy repair procedure across multiple nodes included in the plurality of nodes. Each of the nodes included in the plurality of nodes then performs a node repair based on the schedule.

Abstract: A map developer may maintain multiple versions of a geographic database. Example systems and methods manage the propagation of updates to the multiple versions of the geographic databases even when structural (schema) changes have been made between database versions. A computing device identifies a first geographic database with a first schema, and the computing device identifies a second geographic database with a second schema. The second geographic database is a later version of the first geographic database. The computing device applies an update to the first geographic database and applies the update to the second geographic database according to a rule for a difference between the first schema and the second schema.

Abstract: Systems and methods are described for modifying input and output (I/O) to an object storage service by implementing one or more owner-specified functions to I/O requests. A function can implement a data manipulation, such as filtering out sensitive data before reading or writing the data. The functions can be applied prior to implementing a request method (e.g., GET or PUT) specified within the I/O request, such that the data to which the method is applied my not match the object specified within the request. For example, a user may request to obtain (e.g., GET) a data set. The data set may be passed to a function that filters sensitive data to the data set, and the GET request method may then be applied to the output of the function. In this manner, owners of objects on an object storage service are provided with greater control of objects stored or retrieved from the service.

Abstract: Cloud storage provides for accessible interfaces, near-instant elasticity and scalability, multi-tenancy, and metered resources within a framework of distributed resources acing to provide highly fault tolerant solutions with high data durability. However, cloud storage also has drawbacks and limitations with information uploading and how information is subsequently accessed.

Abstract: The present disclosure describes systems and methods for aggregation and management of cloud storage among a plurality of providers via file fragmenting to provide increased reliability and security. In one implementation, fragments or blocks may be distributed among a plurality of cloud storage providers, such that no provider retains a complete copy of a file. Accordingly, even if an individual service is compromised, a malicious actor cannot access the data. In another implementation, fragments may be duplicated and distributed to multiple providers, such that loss of communications to any one provider does not result in inability to access the data. This implementation may be combined with error correction techniques to allow recovery, even with loss of multiple providers. File synchronization may also be faster in these implementations by dividing reading and writing operations among multiple providers.

Abstract: A map-reduce compatible distributed file system that consists of successive component layers that each provide the basis on which the next layer is built provides transactional read-write-update semantics with file chunk replication and huge file-create rates. Containers provide the fundamental basis for data replication, relocation, and transactional updates. A container location database allows containers to be found among all file servers, as well as defining precedence among replicas of containers to organize transactional updates of container contents. Volumes facilitate control of data placement, creation of snapshots and mirrors, and retention of a variety of control and policy information. Also addressed is the use of distributed transactions in a map-reduce system; the use of local and distributed snapshots; replication, including techniques for reconciling the divergence of replicated data after a crash; and mirroring.

Abstract: Apparatus, systems, methods, and related computer program products for synchronizing distributed states amongst a plurality of entities and authenticating devices to access information and/or services provided by a remote server. Synchronization techniques include client devices and remote servers storing buckets of information. The client device sends a subscription request to the remote serve identifying a bucket of information and, when that bucket changes, the remote server sends the change to the client device. Authentication techniques include client devices including unique default credentials that, when presented to a remote server, provide limited access to the server. The client device may obtain assigned credentials that, when presented to the remote server, provide less limited access to the server.

Abstract: First and second pluralities of replicated state machines may execute a sequence of ordered agreements to make mutations to data stored in first and second data storage services of first and second types, respectively. First and second metadata of the mutated data stored in the first and second data storage services may then be received and stored. The first and second data storage services may then be synchronized using the received first and second metadata to determine when the data stored in the first and second data storage services have both settled after having mutated according to a predetermined agreement of the sequence of ordered agreements. A comparison of the stored first and second metadata may then be carried out when the data stored in the first data storage service and the data stored in the second data storage service have settled according to the predetermined agreement.

Abstract: Incremental, out-of-place updates may be implemented for index structures maintained for data stores. Portions of the index structure may be selected for updating, and an updated version of the portion of the index structure generated in another storage location different than a current storage location for the index structure such that the index structure may be searched in order to perform access requests. Updating the portion of the index structure may include compacting the portion of the index structure and/or merging the portion of the index structure with a sub-index structure generated from a portion of a log of index updates that may be maintained. The current portion of the index structure may then be replaced with the updated version of the current portion so that the updated version may be evaluated when searches of the index structure are performed.

Abstract: Systems and methods for performing backups including incremental backups are provided. A change log is provided. The change log includes a map file that includes a bit for each inode in a file system. The bits are set on certain file events. The map file allows the files to be included in the next backup to be identified without having to trawl the entire file system. The change log also includes a data file that lists actual changes to the various files in corresponding records that are indexed by the inode number. The change log can enable faster incremental backups in part by eliminating unnecessary disk access requests.

Abstract: Systems and methods for just-in-time data quality assessment of best records created during data migration are disclosed. A data steward includes tools for creating and editing a best record creation strategy that defines how records from multiple systems will be integrated into target systems. At design time, the data steward can generate best record creation and validation rules based on the best record creation strategy. The data steward can apply the best record creation and validation rules to a sample of matched records from multiple data sources to generate a sample set of best records. The efficacy of the best record creation rules can be evaluated by assessing the number of fields in the sample set that fail the validation rules. During review, the validation rules can be applied to edits to the best records received from a human reviewer to ensure compliance with the best record creation strategy.

Abstract: A method of automatic load rebalancing includes determining that a new storage device was added to a storage array comprising a plurality of storage devices, wherein the new storage device is distinct from the plurality of storage devices. The method further includes, in response to the determining, identifying a first shard on a first storage device of the plurality of storage devices, wherein the first storage device has a fullness metric that is equal to or exceeds a fullness threshold. The method further includes moving, by a processing device of a storage array controller of the storage array, the first shard from the first storage device to the new storage device.

Abstract: Techniques are provided for freeing and utilizing unused inodes. For example, an operation, targeting a first storage object of a first node having a replication relationship with a second storage object of a second node, is intercepted. A replication operation is created as a replication of the operation. The operation is implemented upon the first storage object and the replication operation is implemented upon the second storage object. A determination is made that the replication operation uses an inode no longer used by storage objects of the second node. The inode targeted by the replication operation is freed and utilized based upon the inode being a leaf inode. If the inode is a stream directory inode, then data streams of the stream directory inode are moved under a new private inode and the stream directory inode is released.

Abstract: A method and system for streaming data from portable storage devices. Specifically, the disclosed method and system implement iterative data streaming from a portable storage device for remote storage operations, while requiring zero over-provisioning storage space for buffering incoming write operations to the portable storage device.

Abstract: Methods, systems, computer-readable media, and apparatuses for combining nodes and/or aggregating streaming queries in a simulation are presented. In some examples, combining nodes and/or aggregating streaming queries may result in less duplicative data being sent through the system. A first node may be connected to a first aggregator, and the first aggregator may be connected to a second node. In some examples, the first node may comprise a client or another aggregator, and the second node may comprise a data source or another aggregator. Based on a determination that a first streaming query subscription of the first node connected to the first aggregator has changed to a second streaming query subscription, one or more aggregator controller(s) may determine to migrate the first node to a different aggregator. Migrating the first node to a different aggregator may increase overlap of streaming query subscriptions in the system and/or reduce the amount of duplicative data being sent through the system.

Abstract: User-based recovery point objectives (RPOs) for disaster recovery are described herein. A method as described herein can include obtaining, by a device operatively coupled to a processor, transient information associated with a file stored by a data storage system; determining, by the device, whether the transient information associated with the file indicates that a condition for replicating the file has been met; and inserting, by the device, the file into a replication queue associated with the data storage system in response to a positive result of the determining.

Abstract: A system identifies (I) a first independent filesystem that (i) includes a file and (ii) uses file-handles to locate files and (II) a second independent filesystem that (i) operates independently of file-handles, associated with the first independent filesystem, when locating files and (ii) includes a copy of the file. The system generates a file-handle for the copy of the file on an inode of first independent filesystem based on a full-path for the copy of the file on the second independent filesystem. The system replicates one or more data blocks between the first independent filesystem and the second independent filesystem based, at least in part, on the full-path.

Abstract: Systems and methods for re-using content in a content management system. The content management system may have two or more repositories. A link document may be generated in a link repository for a source document in a source repository. The link document may be a copy of the source document, and synchronized to the source document in a number of different ways, dynamically or statically. When the source document is updated, the source repository may notify the link repository about the change, receive a pull request from the link repository for the change, and generate an updated link document.

Abstract: System, method, and computer program product for partitioned data replication are described. A data replication system can partition a file stored on a primary storage device into multiple data blocks, and store an index mapping the blocks and the file. Initially, the system can replicate the file and the index to a secondary storage device. The data stored in the file can change after the initial replication. The system can determine which block among the data blocks has changed by updating the index and comparing the updated index with the original index. The system can then replicate the change by replicating only the changed block and the updated index to the secondary system.

Abstract: An example system and method facilitates operation of a networked software application that communicates with a network resource during periods of intermittent network connectivity and includes determining when a networked software application is offline and when it is online; selectively intercepting one or more request messages from the networked software application addressed to a network resource when the software application is offline, resulting in a store of intercepted request messages; detecting when the networked software application transitions from being offline to being online; and selectively issuing the one or more request messages to the network resource in a sequence in which the one or more request messages were stored in the store of intercepted request messages.