Abstract: In one set of embodiments, a computer system can create a snapshot of a data set, where the snapshot includes a plurality of data blocks of the data set. The computer system can upload the snapshot to a cloud object storage platform of a cloud infrastructure, where the snapshot is uploaded as a plurality of log segments conforming to an object format of the cloud object storage platform, and where each log segment includes one or more data blocks in the plurality of data blocks, and a set of metadata comprising, for each of the one or more data blocks, an identifier of the data set, an identifier of the snapshot, and a logical block address (LBA) of the data block. The computer system can then communicate the set of metadata to a server component running in a cloud compute and block storage platform of the cloud infrastructure.

Abstract: The present disclosure provides a method for storing data, including: storing data in a first node, the first node being selected from a first node set including a first edge node and child nodes thereof; selecting, from a second node set including a second edge node and child nodes thereof, a second node for storing the data, the first edge node being a child node of the second edge node; and storing the data in the second node. The present disclosure further provides a method for searching for data. The present disclosure can reduce the time for searching for data in a distributed storage system.

Abstract: A data intake and query system can ingest and index large amounts of data using one or more ingestors and indexers. The ingestors can ingest incoming data and use it to generate events. The ingestor can group the events and prepare them for communication to a message bus. The ingestor can determine a size of the group of events. If the size of the group of events satisfies a message size threshold, the ingestor can store the group of events to a data store, obtain a reference to the group of events, and communicate the reference to the group of events to a message queue. An indexer can obtained the reference from the message queue and use the reference to obtain the group of events from the data store.

Abstract: The current document is directed a resource-exchange system that facilitates resource exchange and sharing among computing facilities. The currently disclosed methods and systems employ efficient, distributed-search methods and subsystems within distributed computer systems that include large numbers of geographically distributed data centers to locate resource-provider computing facilities that match the resource needs of resource-consumer computing-facilities based on attribute values associated with the needed resources, the resource providers, and the resource consumers. The resource-exchange system monitors and controls resource exchanges on behalf of participants in the resource-exchange system in order to optimize resource usage within participant data centers and computing facilities.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for a source independent query language. One of the methods includes receiving a first executable statement, the first executable statement referencing a second set of fields in a table in a relational database, the first executable statement having instructions to cause the database to perform operations on data in the table. The method includes generating a second executable statement based on the first set of fields and the first executable statement. The method includes determining a mapping between the first set of fields and the second set of fields. The method includes specifying a derived table using the corresponding values and the mapping. The method includes generating instructions to cause the database to perform the operations on the derived table. The method includes sending the second executable statement to the database.

Abstract: Data exploration as search over automated pre-generated plot objects can include data analytics systems with automated data mining and simplified user experience front ends. A computer-implemented method, that can be performed by the described data analytics systems, includes receiving a request for plots or plot types of a specified criteria; searching a plot object resource for plots relevant to the specified criteria, the plot object resource comprising an indexed repository of available plots; sorting and ranking the plots or plot types according to associated scores, the associated scores for each plot being based on information theoretic metrics relevant to a measure of interest; and providing plots satisfying a criteria of the sorting and the ranking to a source of the request.

Abstract: A method for execution by a query processing system includes determining a query request that indicates a plurality of operators, where the plurality of operators includes at least one relational algebra operator and further includes at least one non-relational operator. A query operator execution flow is generated from the query request that indicates a serialized ordering of the plurality of operators. A query resultant of the query is generated by facilitating execution of the query via a set of nodes of a database system that each perform a plurality of operator executions in accordance with the query operator execution flow, where a subset of the set of nodes each execute at least one operator execution corresponding to the at least one non-relational operator in accordance with the execution of the query.

Abstract: Seed patterns are derived from a sequence database. Execution costs for types of seed patterns are computed. Each seed pattern is iteratively distributed to distributed nodes along with that seed pattern's assigned execution cost. The distributed nodes processing in parallel to mine the sequence database for super patterns found in the sequence database. When a distributed node exhausts its execution budget, any remaining mining needed for the seed pattern being mined is reallocated to another distributed node having remaining execution budget.

Abstract: Techniques for handling data access conflicts are disclosed. In some embodiments, a conflict handling system detects a set of one or more objects that are currently being accessed by an application. The conflict handling system queries a database to determine whether the set of one or more objects have changes pending. Responsive to determining that an object has a change pending, the conflict handling system identifies and loads, at runtime of the application, a set of one or more application-specific rules that are defined for handling data conflicts. The conflict handling system executes the rules to generate a conflict resolution result for the object. The application may then perform an application-specific function based on the conflict resolution result.

Abstract: Techniques are disclosed relating to multi-level, cluster-based optimization. In various embodiments, the disclosed techniques include performing a multi-level optimization operation to optimize the composition of a cluster of collections. For example, in various embodiments, the disclosed techniques include iteratively filtering a (typically large) set of available items down into progressively smaller subsets, from which items may be selected to modify the composition of the collections in a cluster of related collections. In some embodiments, the disclosed techniques include performing multi-level optimization operation that includes a collection-level optimization calculation for individual collections in the cluster, and, after filtering the set of available items based on the collection-level optimization calculations, performing a cluster-level optimization calculation.

Abstract: User permissions for a search on content managed by a content management system (CMS) can be evaluated in a search engine based on a user identity of a user providing a query input for the query rather than after return of an initial results set to the CMS or some other front-end application. The search engine can constrain possible results returned from a search for the query input using a content index of a plurality of content items maintained in a repository of the content management system. The constraining can include limiting the search engine from adding a content item of the plurality of content items to a permissions-filtered results set unless the evaluating of the user permissions and the search for the query input against the content index do not exclude the content item. Other aspects can support index updating by selective use of a metadata index.

Abstract: A system a module that is configured to cause a processor to obtain a set of file references that are configured to access files associated with a first computing system, where the set of file references include a references to the target file and one or more source files. The module is further configured to cause the processor to retrieve the target file and the one or more source files and to partition the target file and the one or more source files into respective first set of tokens and second set of tokens. The module is further configured to cause the processor to identify, based on the first set of tokens and the second set of tokens, at least one source file of the one or more source files that contain a threshold quantity of tokens of the target file.

Abstract: A virtual data store system comprises a network interface and a processing device operable to access a source database of data records comprising data, wherein an entity is enabled to utilize the virtual data store system as a database. A verification query is formulated with respect to a data record, that stores an item of data, which is transmitted to online network sources via a proxy service. A query response is parsed and in response to determining that the item of data in the data record is potentially present in the parsed response, a corresponding confidence score is generated. If the confidence score is below a first threshold, a subsequent verification operation is performed. If the subsequent verification operation fails, the second item of data is deleted from memory to conserve memory resources. The data record may be accessed from the virtual data store and used to initiate a networked communication.

Abstract: Using a graph representation of join history may be performed to distribute database data. Join history may be collected, captured, or tracked which describes the history of join operations between columns of different tables in a database. A graph representation of the join history may be generated. The graph representation may indicate a likelihood of different joins that may be performed between the columns of the tables of a database. An evaluation of the join history may be performed to identify columns for tables in the database to distribute the data of the tables amongst multiple storage locations according to the identified columns.

Abstract: Servicing database requests using subsets of canonicalized tables including maintaining a canonical table repository of canonicalized tables, wherein each canonicalized table is a transformed version of a table previously retrieved from a database; receiving, from a client computing system, a request for a table from the database; generating a description of a canonical version of the requested table; determining that the canonical version of the requested table is a subset of a canonicalized table in the canonical table repository; and in response to determining that the canonical version of the requested table is a subset of the canonicalized table in the canonical table repository: transforming the canonicalized table containing a superset of the canonical version of the requested table based on the received request for the table; and providing, to the client computing system, the transformed canonicalized table containing the superset of the canonical version of the requested table.

Abstract: Disclosed is a system to provide an answer to a query generated by a device while hiding the answer and the query from a server providing the answer. Data structures, created at the server, contain information such as information about restaurants, mechanics, medical conditions, etc. The server creates bundles including two or more data structures containing disparate information, and a unique identifier for each bundle. The server creates a table of contents indicating the unique identifier of a bundle and the information contained in the bundle and sends the table of contents to the device. The server provides the answer to the query from the device by receiving the unique identifier of the bundle and providing the bundle having the unique identifier to the device. While the bundle contains the answer to the query, the server does not know the query or the answer because the bundle contains disparate information.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for storing semi-structured data. One of the methods includes maintaining a plurality of schemas; receiving a first semi-structured data item; determining that the first semi-structured data item does not match any of the schemas in the plurality of schemas; and in response to determining that the first semi-structured data item does not match any of the schemas in the plurality of schemas: generating a new schema, encoding the first semi-structured data item in the first data format to generate the first new encoded data item in accordance with the new schema, storing the first new encoded data item in the data item repository, and associating the first new encoded data item with the new schema.

Abstract: Embodiments of this application provide a data processing method in a database. A plurality of aggregation intervals are selected, wherein the plurality of aggregation intervals are different from each other. And at least one piece of data in the database is aggregated separately based on each aggregation interval, so that data clusters stored in the database have data ranges with different attribute value spans.

Abstract: One example method includes, in response to a crash event, obtaining data protection system credentials, accessing a target storage of the data protection system, obtaining, from the target storage, a configuration file including configuration information for a data protection cluster, and using, by the data protection cluster, the configuration information to self-configure. The method further includes creating a consistency group (CG) of a group of volume, and restoring a journal volume to append backup indexes.

Abstract: A method includes: determining, based on an elapsed time, a priority for each of groups obtained by clustering a plurality of pieces of response information based on similarity between the pieces of response information, each response information indicating a response to an event that has occurred, the elapsed time being measured from a time period in which the event recorded in each response information of each group occurred most often; calculating credibility for each response information, based on a number of times specifications of a system relating to the event have been changed after the response, and an elapsed time from date and time when the response recorded in the pieces of response information has been made; and controlling a presentation mode upon presenting the plurality of pieces of response information, based on the priority calculated for each group and the credibility calculated for each response information.