Abstract: A method for managing data includes obtaining, by a database proxy server, a document manifest, wherein the document manifest specifies a plurality of queries, wherein each of the plurality of queries specifies data and a policy to be implemented on the data, wherein the data is stored in a central database, and processing the plurality of queries.

Abstract: A tag-based, user-directed media recommendation scheme is described herein. For example described herein is a recommender system (and method implemented by the recommender system) comprising: a recommendation engine configured to generate a recommendations list which includes a current set of recommendations for a user of a client device; and, a tag engine configured to: (1) receive the recommendations list; (2) obtain information about representative items associated with the user of the client device; (3) correlate the recommendations with tags; (4) correlate the representative items with the tags, (5) sort the tags into a tag list; and (6) provide the recommendations list and the tag list to the client device. The representative items include at least one of following: (1) an item previously purchased by the user; (2) an item previously watched by the user; (3) an item previously placed on a wish-list by the user; and (4) an item recommended by the recommendation engine for the user.

Abstract: Example systems and methods for cloning catalog objects are described. In one implementation, a method identifies an original catalog object associated with data and creates a duplicate copy of the original catalog object without copying the data itself. The method allows access to the data using the duplicate catalog object and supports modifying the data associated with the original catalog object independently of the duplicate catalog object. The duplicate catalog object can be deleted upon completion of modifying the data associated with the original catalog object.

Abstract: Example systems and methods for cloning catalog objects are described. In one implementation, a method includes creating a copy of a catalog object without copying a data associated with the catalog object by only coping metadata associated with the object. The method further includes modifying, by one or more processors, the data associated with the catalog object independently of the copy of the catalog object such that modified data is not visible to the copy of the catalog object and wherein the modified data is not visible to the catalog object in a database. The method further includes deleting the copy of the catalog object following completion of the modification of the data associated with the catalog object.

Abstract: Embodiments of the present disclosure provide techniques for efficiently and accurately performing propagation of search-head specific configuration customizations across multiple individual configuration files of search heads of a cluster for a consistent user experience. The cluster of search heads may be synchronized such that the search heads operate to receive the configuration or knowledge object customizations from one or more clients from a central or lead search head. To reduce the amount of data that is transferred during propagation, the list of configuration or knowledge object customizations maintained in each search head is filtered from the list of the lead search head until a divergence point is determined. Once determined and communicated to the lead search head, the lead search head sends the configuration and knowledge object customization data that is absent from the internal list of the member search head.

Abstract: Techniques for a system capable of performing low-latency database query processing are disclosed herein. The system includes a gateway server and a plurality of worker nodes. The gateway server is configured to divide a database query, for a database containing data stored in a distributed storage cluster having a plurality of data nodes, into a plurality of partial queries and construct a query result based on a plurality of intermediate results. Each worker node of the plurality of worker nodes is configured to process a respective partial query of the plurality of partial queries by scanning data related to the respective partial query that stored on at least one data node of the distributed storage cluster and generate an intermediate result of the plurality of intermediate results that is stored in a memory of that worker node.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for reclaiming one or more portions of storage resources in a computer system serving one or more virtual computing instances, where the storage resources in the computer system are organized in clusters of storage blocks. In one aspect, a method includes maintaining a respective block tracking value for each storage block that indicates whether a call to reclaim the storage block is outstanding; determining, from the block tracking values, a respective cluster priority value for each of the clusters based on a count of storage blocks in the respective cluster for which a call to reclaim is outstanding; and reclaiming a first portion of storage resources in the computer system in accordance with the cluster priority values.

Abstract: An improved content indexing (CI) system is disclosed herein. For example, the improved CI system may include a distributed architecture of client computing devices, media agents, a single backup and CI database, and a pool of servers. After a file backup occurs, the backup and CI database may include file metadata indices and other information associated with backed up files. Servers in the pool of servers may, in parallel, query the backup and CI database for a list of files assigned to the respective server that have not been content indexed. The servers may then request a media agent to restore the assigned files from secondary storage and provide the restored files to the servers. The servers may then content index the received restored files. Once the content indexing is complete, the servers can send the content index information to the backup and CI database for storage.

Abstract: A data querying system is disclosed that provides improved computer functionality that enables efficient permissioning and querying of specific portions of a data table, such that users (e.g., based on user roles or user attributes) are only allowed access to specific portions (e.g., particular data items/rows, and particular data items attributes/columns) of the data. The system advantageously provides efficient and improved querying and permissioning of specific portions of a data table through replication of the data table, or portions of the data table, and does not require permissioning of each individual cell of the data table. Further, the data table replication, querying, and permissioning techniques of the present disclosure, according to various implementations, advantageously integrate with a wide variety of data table query or search services to provide improved functionality, efficiency, and data permissioning.

Abstract: The information processing apparatus includes an acquisition unit, a sparsity calculation unit, a selection unit, and an output unit. The acquisition unit acquires the input matrix data information. The sparsity calculation unit calculates the sparsity of the target matrix data represented by the input matrix data information. The selection unit selects a representation format to be applied to the output matrix data information from a plurality of representation formats, based on the sparsity calculated by the sparsity calculation unit. The plurality of representation formats include the dense representation format and at least two sparse representation formats. The output unit outputs the output matrix data information that represents the target matrix data in the representation format selected by the selection unit.

Abstract: Resource data objects describing resources in a system may be maintained in multiple different hierarchies for applying policies to manage the resources. Lookup requests may access the different hierarchies to determine which policies are applicable to a given resource based on the policies identified in each of the hierarchies. Modifications to hierarchies may be performed in isolation so that the application of policies in other hierarchies is unchanged by modifications to a different hierarchy. Access restrictions may be enforced with respect to hierarchies so that different users may be permitted access to different hierarchies for system resource management.

Abstract: In some examples, candidate projection enumeration based query response generation may include obtaining a query, and identifying, based on the query, a plurality of candidate columns from at least one table to respond to the query. Using a tree-based model, the candidate columns may be analyzed to generate a candidate set of projections to respond to the query. Each candidate projection of the candidate set of projections may include a sort order associated with at least one candidate column of the candidate columns, a segmentation key value associated with at least one candidate column of the candidate columns, and a replication value associated with the candidate projection. Based on the candidate set of projections, a response to the query may be generated.

Abstract: Compositing aware digital image search techniques and systems are described that leverage machine learning. In one example, a compositing aware image search system employs a two-stream convolutional neural network (CNN) to jointly learn feature embeddings from foreground digital images that capture a foreground object and background digital images that capture a background scene. In order to train models of the convolutional neural networks, triplets of training digital images are used. Each triplet may include a positive foreground digital image and a positive background digital image taken from the same digital image. The triplet also contains a negative foreground or background digital image that is dissimilar to the positive foreground or background digital image that is also included as part of the triplet.

Abstract: The present disclosure relates to systems, methods, and non-transitory computer readable storage media for implementing a scalable, secure, efficient, and adaptable distributed digital ledger transaction network. Indeed, the disclosed systems can reduce storage and processing requirements, improve security of implementing computing devices and underlying digital assets, accommodate a wide variety of different digital programs (or “smart contracts”), and scale to accommodate billions of users and associated digital transactions. For example, the disclosed systems can utilize a host of features that improve storage, account/address management, digital transaction execution, consensus, and synchronization processes. The disclosed systems can also utilize a new programming language that improves efficiency and security of the distributed digital ledger transaction network.

Abstract: Example systems and methods for cloning catalog objects are described. In one implementation, a method identifies an original catalog object associated with data and creates a duplicate copy of the original catalog object without copying the data itself. The method allows access to the data using the duplicate catalog object and supports modifying the data associated with the original catalog object independently of the duplicate catalog object. The duplicate catalog object can be deleted upon completion of modifying the data associated with the original catalog object.

Abstract: Systems and methods of the present invention provide for one or more server computers communicatively coupled to a network and configured to run, within an active memory: a data collection module aggregating a plurality of domain name data; a profile generation module generating a domain name profile from the domain name data comprising attributes associated with a first domain name; a graph generation module defining domain names sharing attributes with the domain name, a second domain name in the domain names sharing a greatest number of attributes with the first domain name and closest, in proximity within a generated graph, to the first domain name; and a domain name strategy suggestion module rendering a user interface comprising a user interface control that identifies a referral to an administrator for the second domain name and provides, within the user interface control, a link for contacting the administrator.

Abstract: The disclosed embodiments also include monitoring and metering services of the data fabric service (DFS) system. Specifically, these services can include techniques for monitoring and metering metrics of the DFS system. The metrics are standards for measuring use or misuse of the DFS system. Examples of the metrics include data or components of the DFS system. For example, a metric can include data stored or communicated by the DFS system or components of the DFS system that are used or reserved for exclusive use by customers. The metrics can be measured with respect to time or computing resources (e.g., CPU utilization, memory usage) of the DFS system. For example, a DFS service can include metering the usage of particular worker nodes by a customer over a threshold period of time.

Abstract: A method, device, and computer program storage product for generating a query to extract clinical features into a set of electronic medical record (EMR) tables based on clinical knowledge. A knowledge tree is constructed according to a set of clinical knowledge data. An EMR graph corresponding to a set of EMR tables is obtained. The EMR graph comprises at set of table nodes and a set of attribute nodes. The set of table nodes and the set of attribute nodes represent a structure of each EMR table in the set of EMR tables and a reference relationship among attributes of set of EMR tables. A plurality of sub-queries is generated based on the knowledge tree and the EMR graph. At least one query is generated by combining the plurality of sub-queries according to the knowledge tree.

Abstract: Methods, systems, and devices, including computer programs encoded on computer storage media, for data processing are provided. One of the methods includes: receiving a query parameter; obtaining query result data from each of one or more predetermined data sources according to the query parameter; converting the query result data into target reliable data conforming to a predetermined data reliability protocol; and sending the target reliable data to a blockchain node.

Abstract: A computer implemented method is provided comprising receiving a group of transaction logs from a first database, allocating transaction logs from the group of transaction logs to a first queue and to a second queue, generating an end-of-group transaction log indicative of an end of the group of transaction logs, allocating the end-of-group log to the first queue and the second queue; replaying transaction logs from the first queue including the end-of-group transaction log allocated to the first queue, replaying transaction logs from the second queue including the end-of-group transaction log allocated to the second queue; and changing visibility of one or more transactions in response to replaying the end-of-group transaction log allocated to the first queue and the end-of-group transaction log allocated to the second queue. Related apparatus, systems, techniques and articles are also described.