Abstract: Techniques for live migration of cloud resource infrastructure metadata are provided. A method may include receiving a resharding request associated with a database configured to store resource metadata according to a first database configuration. The resource metadata may be identified by a first mapping. The method may include preparing the resource metadata for migration to a second database configuration corresponding with a second mapping. The method may include migrating a subset of the resource metadata within the database in accordance with the second mapping. The method may include while migrating the subset of the resource metadata, serving requests on the resource metadata according to the first database configuration. The method may include after migrating the subset of the resource metadata, installing the second database configuration. The method may also include removing the subset of the resource metadata remaining in the database according to the first database configuration.

Abstract: A system such as a service of a computing resource service provider includes executable code that, if executed by one or more processors, causes the one or more processors to identify a set of resources associated with a first database system, determine, based at least in part on the set of resources, an expected outcome of an operation of a second database system, and generate, executable code that, if executed, verifies an actual outcome of the operation of the second database system against the expected outcome. The system may be utilized as part of a database migration process where data from a first database system is transferred to a second database system.

Abstract: Systems and methods for formatting data are disclosed. For example, a system may include at least one memory storing instructions and one or more processors configured to execute the instructions to perform operations. The operations may include receiving data comprising a plurality of sequences of data values and training a recurrent neural network model to output conditional probabilities of subsequent data values based on preceding data values in the data value sequences. The operations may include generating conditional probabilities using the trained recurrent neural network model and the received data. The operations may include determining a data format of a subset of the data value sequences, based on the generated conditional probabilities, and reformatting at least one of the data value sequences according to the determined data format.

Abstract: Method and apparatus for stress management in a searchable data service. The searchable data service may provide a searchable index to a backend data store, and an interface to build and query the searchable index, that enables client applications to search for and retrieve locators for stored entities in the backend data store. Embodiments of the searchable data service may implement a distributed stress management mechanism that may provide functionality including, but not limited to, the automated monitoring of critical resources, analysis of resource usage, and decisions on and performance of actions to keep resource usage within comfort zones. In one embodiment, in response to usage of a particular resource being detected as out of the comfort zone on a node, an action may be performed to transfer at least part of the resource usage for the local resource to another node that provides a similar resource.

Abstract: In an approach to online reorganization of database tables with concurrent updates using virtual partitions, responsive to receiving a table to reorganize, rows of the first table are selected, where the rows of the first table create a first virtual partition. A memory for a second virtual partition is allocated, where the second virtual partition is appended to a second table. A union view is created comprising a union of remaining rows of the first table with the second table, where the remaining rows of the first table have not been copied to the second table. The first virtual partition is copied into the second virtual partition. Responsive to receiving queries before copying the first virtual partition into the second virtual partition is complete, the queries are allowed to access the union view.

Abstract: Examples described herein relate to migrating data in a system having multi-tiered physical storage. In an example, relative weights corresponding to a plurality of data access parameters may be determined based on a ranking associated with each of the plurality of data access parameters. Further, a priority metric corresponding to each of a plurality of candidate types may be determined based on the relative weights of the plurality of data access parameters. Furthermore, one or more candidate types may be selected from the plurality of candidate types based on the priority metric corresponding to each of the plurality of candidate types. Moreover, data containers corresponding to the selected one or more candidate types may be migrated from a first tier storage to a second tier storage.

Abstract: A system and method providing database level migration of an application and associated data. In one embodiment, the method may include deploying a new data structure, a first database trigger to capture data written to an old data structure and to write the captured data to the new data structure, and a bulk migration stored procedure to a database instance; deploying, in response to a conclusion of an execution of the bulk migration stored procedure, a second database trigger to the database instance to capture data written to the new data structure and to write the captured data to the old data structure; deploying a second version of the application; routing validation data to the second version of the application to validate an expected operation thereof; and routing, in response to a completion of the validation, production data for the database instance to the second version of the application.

Abstract: A hardware accelerator device detects duplicate data blocks independently from a processor of an information handling system. The device includes an interface, a hash function, a bloom filter, and a data comparator. The interface receives data blocks. The hash function determines a hash of a received data block. The bloom filter includes comparison hashes, each associated with a comparison data block. The bloom filter determines if the hash matches a comparison hash. The data comparator directs the interface to receive the comparison block when the hash matches the comparison hash, and compares the received data block with the comparison data block to determine if they are identical. The device stores a pointer when the data comparison block determines that the blocks are identical.

Abstract: Systems and methods are disclosed for authenticating a user to use one or more components of a data intake and query system. The data intake and query system enables the generation or searching of events that include raw machine data associated with a timestamp. The data intake and query system receives a request for access via an application programming interface (API). Based on the request, the data intake and query system authenticates the user. The data intake and query system can receive a second request via the API for a component of the data intake and query system. Based on a determination that the user is authenticated, the data intake and query system can communicate the request to the component.

Abstract: The present disclosure describes systems, non-transitory computer-readable media, and methods for utilizing hash partitions to determine local densities and distances among users (or among other represented data points) for clustering sparse data into segments. For instance, the disclosed systems can generate hash signatures for users in a sparse dataset and can map users to hash partitions based on the hash signatures. The disclosed systems can further determine local densities and separation distances for particular users (or other represented data points) within the hash partitions. Upon determining local densities and separation distances for datapoints from the dataset, the disclosed systems can select a segment (or cluster of data points) grouped according to a hierarchy of a clustering algorithm, such as a density-peaks-clustering algorithm.

Abstract: The present disclosure provides a multi-source data analytics system, data manager, and related methods. The multi-source data analytics are measured and used to generate an overall performance indicator. In some examples, the overall performance indicator relates to digital content items available on a digital media platform. The digital media platform obtains relevant data from multiple sources (or channels) and calculates the overall performance indicator so as to account for one or a combination of promotional bias of at least some data sources, user visits (or interactions/views), user engagement, user recirculation, or user acquisition and retention (e.g., subscriber acquisition and retention) for one or more of the multiple data sources. The overall performance indicator may be used by a data manager to locate content on the digital media platform for more effective interaction among other uses.

Abstract: A technique for managing deduplication performs partial-block matching opportunistically by leveraging information acquired during times when a storage system has available resources. The information identifies anchor blocks that are likely targets for partial-block matches, based on discovering that the anchor blocks belong to populations of blocks that have high similarity. When processing write requests, inline activities access anchor blocks that closely match newly arriving candidate blocks and perform partial-block deduplication against those anchor blocks.

Abstract: A metadata aggregation system includes a computing platform having a hardware processor and a memory storing a software code including a trained entity matching predictive model trained using training data obtained from a reference database. The hardware processor executes the software code to obtain metadata inputs from multiple sources, conform the metadata inputs to a common format, match, using the trained entity matching predictive model, at least some of the conformed metadata inputs to the same entity, and determine, using the trained entity matching predictive model, a confidence score for each match. The software code further sends a request to one or more human editor(s) for confirmation of each match having a confidence score greater than a first threshold and less than a second threshold, and updates the reference database, in response to receiving a confirmation that at least one match is a confirmed match, to include the confirmed match.

Abstract: A method according to embodiments includes: storing an entire hash table of a table R in memory of a computational storage device; storing a second table S in storage media of the computational storage device, the table R being smaller than the table S, wherein the hash JOIN operation is directed to combining a cs-th column in the table S and a cr-th column in the table R; wherein, for each row of the table S, the computational storage device configured to perform a method, including: applying a hash function to a value of the cs-th column to provide a hash result; looking up the hash result in the hash table stored in the memory of the computational storage device; and if the hash result is found, sending the row of the table S and a corresponding row index of the table R to the host computing system.

Abstract: A distributed database receives an instruction to read or write data. The instruction includes a key. The database includes a key space defined by attoshards. An attoshard is a segment of key space having a size, in keys, proportional to a total number of nodes in the database. The attoshard includes keys for cluster segments at predefined positions in the attoshard. Each cluster segment corresponds to one cluster. A node of the database hashes the key to generate a token. The node performs a modulo operation on the token using the total number of nodes in the database to compute a remainder value. The node determines a cluster segment of an attoshard based on a position in the attoshard defined by the remainder value. The node determines a cluster for the instruction based on the cluster segment and executes the instruction at the determined cluster.

Abstract: Join key propagation including receiving a request to generate a referencing worksheet linked from a data source worksheet, wherein the data source worksheet is a presentation of a data set organized in columns from two data source tables joined using a join key, and wherein the referencing worksheet presents at least a subset of the data set presented by the data source worksheet; retrieving data source worksheet metadata and the join key using a reference to the data source worksheet metadata in the request; determining an additional column from the two data source tables to add to the referencing worksheet, wherein the additional column is excluded from the data source worksheet; and creating, using the data source worksheet metadata and the join key, the referencing worksheet presenting the columns from the two data source tables with the additional column.

Abstract: Systems and methods are disclosed for mapping search nodes to a search head in a data intake and query system based on a tenant identifier in order to execute a query received by the data intake and query system. The mapping may allow same or similar search nodes to be used to execute queries that are associated with a particular tenant identifier, in order to take advantage of caching and local data stored with those search nodes. In some cases, search nodes can be mapped based on the tenant identifier using a hashing algorithm, such as a consistent hashing algorithm.

Abstract: For an updateable view that is defined for a first database, some embodiments provide an automated method for processing an update to data tuples in a second database, the update specified by reference to the updateable view. The method receives a first query from a client for modifying a particular data tuple presented in the updateable view. From a metadata storage, the method retrieves a definition of the updateable view, where the definition includes a reference to a first set of one or more objects associated with the particular data tuple in the first database. Based on the retrieved definition, the method generates a second query referencing a second set of one or more objects associated with the particular data tuple in the second database. The method executes the generated second query on the second database, to modify the particular data tuple in the second database.

Abstract: Disclosed is system for presenting information related to a search query, comprising: a client device configured to receive the search query; a database arrangement; an ontological databank and a server arrangement communicably coupled to the client device and the database arrangement, wherein the server arrangement is configured to: receive the search query, segment the search query into one or more query segments; identify one or more query concepts associated with one or more query segments, wherein each of the one or more query concepts are tagged with a corresponding entity class; determine a data structure for the information related to the search query based on one or more metrics of the relationships of the one or more query concepts, and render, on the client device, the information related to the search query presented in the data structure.

Abstract: Systems, methods, and software described herein provide enhancements for managing permissions in a shared graph. In one implementation, a graph management system identifies a request to classify a first subgraph in the graph for access by a tenant of a plurality of tenants, wherein the request indicates one or more vertex types and/or one or more edge types for the first subgraph. The graph management system further identifies one or more vertices and/or one or more edges in the graph that qualify for the first subgraph based on the indicated one or more vertex types and/or one or more edge types, and allocates permissions to at least one user associated with the tenant to access the first subgraph.