Abstract: A system groups multiple entities in a large distributed data store (DDS), such as directories and files, into a subset called a domain. The domain is treated as a unit for defining policies to detect and treat sensitive data. Sensitive data can be defined by enterprise or industry. Treatment of sensitive data may include quarantining, masking, and encrypting, of the data or the entity containing the data. Data in a domain can be copied as a unit, with or without the same structure, and with transformations such as masking or encryption, into parts of the same DDS or to a different DDS. Domains can be the unit of access control for organizations, and assigned tags useful for identifying their purpose, ownership, location, or other characteristics. Policies and operations, assigned at the domain level, may vary from domain to domain, but within a domain are uniform, except for specific exclusions.

Abstract: Systems and methods for automated aggregated content commenting are disclosed herein. Such a system can include a memory including a content database; an evaluation criteria database; and a comment database. The system can include at least one server. The at least one server can: receive a content identifier; receive a user identifier; provide a representation of the piece of content to the user; receive a comment from the user identifying a portion of the piece of content; generate a portion of the comment database linked to the user and the content; generate an entry in the portion of the comment database linked to the user and the content; and store the comment in the entry in the portion of the comment database.

Abstract: An example operation may include one or more of creating a child ledger for each new environment that is setup, updating a master ledger when a smart contract condition is met, and when the master ledger is updated, initiating deployment of an update to a plurality of managed environments.

Abstract: Systems and methods for automated aggregated content commenting are disclosed herein. Such a system can include a memory including a content database; an evaluation criteria database; and a comment database. The system can include at least one server. The at least one server can: receive a content identifier; receive a user identifier; provide a representation of the piece of content to the user; receive a comment from the user identifying a portion of the piece of content; generate a portion of the comment database linked to the user and the content; generate an entry in the portion of the comment database linked to the user and the content; and store the comment in the entry in the portion of the comment database.

Abstract: Systems are provided for providing a contextualized set of help topics. A user interaction contextualization system receives a search request for help topics from a user device, responsive to which the user interaction contextualization system retrieves an uncontextualized set of help topics from a help topics index. The user interaction contextualization system may collect and analyze contextual data from various data sources, and real-time and historical user engagement data associated with the user. The user interaction contextualization system may then use the collected data to generate a contextualized set of help topics.

Abstract: A clustering machine can cluster descriptive vectors in a balanced manner. The clustering machine calculates distances between pairs of descriptive vectors and generates clusters of vectors arranged in a hierarchy. The clustering machine determines centroid vectors of the clusters, such that each cluster is represented by its corresponding centroid vector. The clustering machine calculates a sum of inter-cluster vector distances between pairs of centroid vectors, as well as a sum of intra-cluster vector distances between pairs of vectors in the clusters. The clustering machine calculates multiple scores of the hierarchy by varying a scalar and calculating a separate score for each scalar. The calculation of each score is based on the two sums previously calculated for the hierarchy. The clustering machine may select or otherwise identify a balanced subset of the hierarchy by finding an extremum in the calculated scores.

Abstract: Techniques for implementing access pattern-based distribution of key-value content in a distributed key-value store comprising a plurality of nodes are provided. In one set of embodiments, a node in the plurality of nodes can receive a request to create a key-value entry. The node can further determine whether the key-value entry is associated with a first (e.g., global) scope or a second (e.g., local) scope. If the key-value entry is associated with the first scope, the node can cause the key-value entry to be replicated on every node in the plurality of nodes. On the other hand, if the key-value entry is associated with the second scope, the node cause the key-value entry to be stored solely on that node.

Abstract: A table function can be received at a database system and applied to one or more data sources. The table function can have one or more generic input operators associated with a source data type of the one or more data sources. One or more output operators associated with a return set of data of the table function can be determined at function call compile time from the values passed to one or more generic input operators. The determining of the one or more output parameters can be based on one or more rules specified in the table function definition. The one or more output operators for the table function can be generated at function call compile time.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for retargeting content in a search environment. A method can include receiving a request for a content item to be provided with a search results page and determining that one or more retargeted content items are eligible for presentation with the search results page. Each retargeted content item is a content item that is eligible for presentation with the search results page based on: (1) the search query matching a targeting keyword for the retargeted content item, and (2) the user identifier matching a retargeted identifier that is included in a retargeting set for the retargeted content item. A responsive content item to be presented with the search results page is selected, based at least in part on bids that are associated with the retargeted content items, and data specifying the responsive content item are provided.

Abstract: Embodiments presented herein describe techniques for deduplicating chunks of data across multiple clusters. A process executing in a storage system identifies one or more chunks in an incoming stream of data. For each chunk, a first fingerprint corresponding to the chunk is generated. The process determines whether the first fingerprint matches a second fingerprint listed in a corresponding entry in a deduplication map. Each entry of the deduplication map corresponds to a chunk stored in a location in one of the storage clusters. Upon determining that the first fingerprint matches the second fingerprint, the process writes, to a local persistent storage, a pointer referencing the location in that storage cluster.

Abstract: Systems and methods for monitoring backup performance of a computing device are described. In one aspect, the disclosure relates to automatic transparent load-balancing such that there is no or substantially no user involvement and resource usage is optimized. In one aspect, the disclosure relates to customization of backup destination by user using scripting such that backups can be distributed by a rule to different locations or it can use local for agent configuration to resolve backup performance degradation issues.

Abstract: Efficient distributed indexing of clumpy data is disclosed. For example, a plurality of data stores store a plurality of data objects, where a plurality of data references to each of the plurality of data objects is recorded on a distributed index and an index manager executes a processor to temporarily partition a namespace of the plurality of data references into a plurality of temporary partitions. A respective count of data references in each temporary partition is computed. A trend line approximating a distribution of data references is calculated based on the respective counts. A cumulative representation of the distribution of the respective counts is calculated based on the trend line. The namespace is repartitioned based on the cumulative representation resulting in a repartitioned namespace, where the distributed index is divided into index segments based on the repartitioned namespace.

Abstract: A computer system receives a definition of a group that includes an indication of a hierarchal rank of group members, a plurality of content items that correspond to the group, and identifying information indicating at least one group member that corresponds to a content item. A search input by a first user is detected and an indication of a hierarchal rank for the first user is stored. Determining a weight to assign to a search result includes comparing a hierarchal rank of at least one group member that corresponds to the first content item with the hierarchal rank of the first user.

Abstract: A first entity and a second entity can be retrieved from a database and compared. The first entity and the second entity can each comprise at least one respective primary key, at least one respective attribute, and at least one pair of corresponding instances. One or more equivalent attributes can be identified, and, for each equivalent attribute, a set of attribute value differences can be compiled for each respective corresponding instance between the first entity and the second entity.

Abstract: An efficient and scalable transaction processing using a consensus-based transaction model is disclosed. A transaction processor receives a transaction that includes a plurality of update subtransactions to be performed against a corresponding plurality of resources. A transaction identifier (ID) that corresponds to the transaction is determined. For each resource of the plurality of resources, the transaction ID is sent to a resource manager associated with the resource to determine a status of the corresponding update subtransaction as one of 1) a not seen status, 2) a prepared status, or 3) a committed status. Based on the status of the corresponding update subtransaction, any action against the resource via the resource manager that is necessary to bring the status of the corresponding update subtransaction to the committed status is performed. The transaction is marked as being completed.

Abstract: Embodiments of the present specification disclose random walking and a cluster-based random walking method, apparatus and device. A solution includes: obtaining information about each node included in graph data, generating, according to the information about each node, a hash table reflecting a correspondence between the node and an adjacent node of the node, and generating a random sequence according to the hash table, to implement random walking in the graph data. The solution is applicable to clusters and single machines.

Abstract: A document management system includes one or more processing apparatuses and a management apparatus. Each processing apparatus is located on one of local networks, and executes a protection process to generate a protected document from a document. The management apparatus is located on an external network connected to the local networks, and manages the processing apparatus(es). Each processing apparatus includes a transmitter and a generator. The transmitter transmits a status of the processing apparatus to the management apparatus. The generator executes the protection process on an input document and generates a protected document upon being permitted by the management apparatus to execute the protection process. The management apparatus includes a receiver and a controller. The receiver receives, from the processing apparatus(es), statuses of the processing apparatus(es).

Abstract: In some implementations, systems and methods that are capable of customizing negative media searches using domain-specific search indexes are described. Data indicating a search query associated with a negative media search for an entity and a corpus of documents to be searched are obtained. Content from a particular collection of documents from among the corpus of documents is obtained and processed. Multiple scores for the entity are computed based on processing the content obtained from the collection of documents. The multiple scores are aggregated to compute a priority indicator that represents a likelihood that the collection of documents includes content that is descriptive of derogatory information.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for creating structured data using data received from unstructured textual data sources. One of the methods includes receiving unstructured textual data, identifying one or more keywords in the unstructured textual data, determining one or more patterns included in the unstructured textual data using the identified keywords, identifying one or more intelligence types that correspond with the unstructured textual data using the determined patterns, and associating, for each of the identified intelligence types, a data subset from the unstructured textual data with the respective intelligence type.

Abstract: Provided are method and apparatus for writing and reproducing a multimedia service using a tag in order to provide an intuitive interface for a user using a multimedia service. The method includes selecting a multimedia service to be written; generating tag information identifying the selected multimedia service; and writing the generated tag information to a tag. Accordingly, multimedia service information and content information can be stored in a tag by being written to tag information using a common format, and thus the user can later execute a service operation by easily writing information of a desired service operation to a tag and then simply connecting the tag to a tag reading device.