Abstract: Systems, methods, and non-transitory computer readable media are provided for providing a redundancy tool for performing transactions. A transaction to be performed on a data stored in a database may be received. A timestamp may be assigned to the transaction. A lock may be assigned on the timestamp. The transaction may be performed on the data. The lock may be refreshed while performing the transaction on the data. A validity of the lock may be checked at after performing the transaction on the data. Responsive to the lock being valid, a result of performing the transaction on the data may be committed.

Abstract: In a distributed processing system having multiple processing nodes including alive nodes and dead nodes, a method is provided for collecting an object from the alive nodes. The method includes maintaining a separate count value for each of remote nodes at which the object is remotely-referenced. The method further includes collecting the object for garbage collection when the separate count value for all of the remotes nodes is zero. The method also includes adding at least one per node sending counter responsive to a remote reference of the object being sent from a first remote node to a particular one of the remote nodes. The at least one per node sending counter is added at the first remote node to count a number of remote-references of the object being sent to the particular one of the remote nodes.

Abstract: An example operation may include one or more of receiving a request to merge a first blockchain network and a second blockchain network, the request comprising a script that specifies a network structure, synthesizing the script with configuration data of the first and second blockchain networks to generate a plurality of merge operations, and merging the first blockchain network with the second blockchain network based on the plurality of merge operations to create a merged blockchain network, wherein the merging comprises merging chaincodes and channels from the first and second blockchain networks into merged chaincodes and merged channels.

Abstract: Systems and methods for determining similarity between sets of objects are disclosed. A set of hashes are generated for a set of objects. A similarity vector is generated for the set of hashes. The similarity vector is a compact representation of the set of hashes and of the corresponding set of objects. The similarity of the set of objects is determined by comparing the similarity vector of the set of objects with other similarity vectors. In a data protection system, the set of objects can be placed with the node or system that stores objects that are most similar to the set of objects being placed.

Abstract: Technologies are described herein for artificial intelligence content detection system. According to some examples, a pattern detector is used to analyze content generated as a result of a search query acted on by an Internet search engine. The system analyzes content from one or more of the search results against patterns stored in a pattern data store. The patterns, if matched against the content, indicate that the content has a certain likelihood of being generated by an artificial intelligence source. The search results are modified to indicate content generated by an artificial intelligence source.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating and providing converted content.

Abstract: Embodiments described herein are related to cloning a volume in a file system. In some embodiments, for each index node representing a file or directory in the volume, the index node is updated to include a back pointer to each file or directory which points to the index node in the volume. In some embodiments, a copy-on-write operation is performed in order to generate a clone of the volume's root node. In certain embodiments, upon determining that a file or directory of the clone has been modified, a new index node is generated representing the file or directory by copying an index node representing a corresponding file or directory of the volume. In some embodiments, each file or directory which should point to the new index node in the clone is identified based on one or more back pointers and updated to point to the new index node.

Abstract: A designated storage system receives a request to store data in the local storage as a backup copy. The designated storage system requests a file system in the computer system to store the backup copy as a file in the local storage and maintains a record describing storage locations for each of the one or more sets of contiguous available file system data blocks. The storage system may transmit the record to a management computer configured to track which of the computer systems has stored the backup copy. The storage system then requests the file system to delete the file, whereupon the file system removes the file descriptor and frees the one or more file system data blocks in order to satisfy the deletion request but does not delete the data stored in the one or more file system data blocks.

Abstract: A system and method is provided for data classification to control file backup operations. An exemplary method includes sampling metadata of one or more files on a computer at a predetermined time interval, determining whether the metadata has changed over time after a predetermined amount of metadata is collected, deriving a model of the change of the metadata over time when the metadata has changed over time, wherein the model of change is a snapshot of dynamically sampled attributes of the one or more files and reflects a state of the computer, performing an analysis of the model of change by determining features of the one or more files comprising at least file usage dynamics of the computer and a user associated with the one or more files based on the model; and selecting a backup plan for the one or more files according to the file usage dynamics.

Abstract: Disclosed herein are system, method, and computer program product embodiments for partition pruning via non-homogenous synopsis information. An embodiment operates by maintaining synopsis information for a data partition in accordance with a first synopsis strategy, monitoring performance of the synopsis information within a partition pruning system, determining that the performance of the synopsis information is insufficient, and updating the synopsis information in accordance with a second synopsis strategy better suited for the attributes of the data partition. In some embodiments, a first data partition of a partitioned data table may employ a first synopsis strategy and a second data partition of the partitioned data table may employ a second synopsis strategy.

Abstract: Various embodiments herein include one or more of systems, methods, and software providing augmenting middleware communication services. Embodiments generally include services executable to provide communication capabilities between a middleware platform and an application, such as an enterprise-class application, to facilitate access to data and functionality of the application by mobile applications that access application functionality and data via the middleware platform. Some embodiments include augmenting the application with at least one service to receive a call from a middleware object requesting data and to identify data to be included in a response to the request. The identified data may then be retrieved and returned to the calling middleware object. The call of the middleware object is typically received from a mobile device application and the middleware object provides data received in response to the request to the mobile application.

Abstract: Generating property keys associated with nodes of a hierarchical graph that defines a topology of a physical space and that is configured to provide user data and sensor data from devices within a physical space. A first property key associated with a first node of the plurality of nodes within the hierarchical graph is received and stored in a property store in association with a first path of the first node. In response to receiving a request associated with determining each property key available to a second node that is a child node of the first node, the first property key is identified as being available to the second node by virtue of the second node being a child node of the first node. The first property key is updated in the property store to also be associated with the second path of the second node.

Abstract: Systems and methods of manipulating and transforming data and sharing ideas include a map comprised of one or more diocards. Each diocard represents an individual idea and has the same group of functions including a distinctions function, a systems function, a relationships function, and a perspectives function. The distinctions function enables definition of the individual idea by attributes the individual idea is comprised of and by non-attributes the individual idea is not comprised of. The systems function enables definition of the individual idea as part of a whole or a whole that can be broken into parts. The relationships function enables definition of the individual idea as having a relationship with one or more different ideas and that this relationship may include action and reaction-like properties. The perspectives function enables definition of the individual idea as a point having a view with respect to one or more different ideas.

Abstract: A data storage and retrieval system for a computer memory configured according to a columnar document store adapted to contain one or more documents. The columnar document store includes a dictionary containing one or more identifiers, each of the identifiers being associated in the dictionary with a value ID. The document store further includes a data structure having fields and containing at least a first column. The first column is associated with a first identifier of the one or more identifiers, and the first identifier is associated with a first set of values in a first set of documents which contain the first identifier. The first column includes a value ID of the first identifier, one or more document IDs, each identifying a document in the first set of documents, and the first set of values.

Abstract: A computer system selects a set of content for a user. The set of content has been selected from a larger set of content located on multiple sources on one or more networks. The selecting is performed based on a time constraint of the user, on a level of relevance to that user of each item of content in the larger set of content, and on an expected amount of time the user will spend consuming each item of content in the larger set of content. The sources of content were previously provided by the user and the level of relevance of the content and expected amount of time the user will spend consuming each item of content are estimated based on historical data for that user. The computer system sends the selected content toward a user device used by the user. Methods, apparatus, and computer program products are disclosed.

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

Abstract: Disclosed herein are system, method, and computer program product embodiments for partition pruning using globally encoded range partition information. An embodiment operates by partitioning a data table into a plurality of data partitions, determining a plurality of sub-partitions within the data partitions, and determining a global range table based at least in part on value ranges corresponding to the sub-partitions. Further, the global range table may be used to determine bit vectors for the data partitions and query predicates. In some examples, the bit vectors may be used to determine whether to prune data partitions during execution of a query over a large data volume.

Abstract: An information (ERP/EAM) system and equipment taxonomy for representing and managing of equipment, equipment subunits and component parts thereof across an enterprise that maps materialized physical objects to functional physical objects within a hierarchy of functional locations within the enterprise for all enterprise assets in accordance with applicable industry standards. The ERP/EAM system and the equipment taxonomy also provide multi-leveled failure reporting.

Abstract: Systems and methods for data management using tagging rules and/or policies. The systems and methods described herein may allow users or administrators to easily label data, so as to organize the data in using any suitable terminology or parameters. Tagging rules (or tag rules) may apply or assign one or more tags to a data file or object. A tag may relate to various components of the data file or object. For example, a tag may relate to a creation date, author, size, or information within the data, such as whether the file or object includes a picture. Once the data is associated with one or more tags, policies may determine how the data is manipulated, stored, accessed, or otherwise used. Policies may relate to actions or operations to be performed with respect to data having one or more particular tags.

Abstract: A computer-implemented method for managing file backup may include (i) detecting, by a computing device, an attempt to upload a file to a backup storage, (ii) calculating a degree of difference between the file and a previous version of the file on the backup storage, (iii) comparing, by the computing device, a list of applications that have written to the file with a list of acceptable applications for the file, (iv) calculating, based on the degree of difference and the comparison of the list of applications, a change score for the file, and (v) applying, based on the change score, a backup policy to the attempt to upload the file. Various other methods, systems, and computer-readable media are also disclosed.