Abstract: Configuration data is received characterizing configuration information of at least one application process executing on a target system. The configuration data includes a first table, a second table, and a third table. The first table includes a first conditional dependency on the second table and a second conditional dependency on the third table. The receiving is performed prior to transmission of the configuration data to the target system for application of the configuration data to the target system. At least one validation definition including a header and table elements specifying the first conditional dependency and the second conditional dependency is determined using the configuration data. Whether to validate the configuration data to ensure consistency within the target system is determined using the at least one validation definition. The determination of whether to validate the configuration data is provided. Related apparatus, systems, techniques and articles are also described.

Abstract: Systems, methods, and computer-readable media for associating a plurality of logical rules with groupings of data are disclosed. The systems and methods may involve at least one processor configured to: maintain a table containing columns; access a data structure containing the plurality of logical rules; access a correlation index identifying a plurality of column types and a subset of the plurality of logical rules; receive a selection of a new column to be added to the table; perform a look up in the correlation index for logical rules typically associated with a type of the new column; present a pick list of the logical rules typically associated with the type of the new column; receive a selection from the pick list; link to the new column a second particular logical rule associated with the selection from the pick list; and implement the second particular logical rule.

Abstract: Aspects of subject technology provide systems and methods for simultaneously spell-correcting and completing partial search queries being entered by a user on the user's electronic device. An apparatus such as a computing device may receive partial search queries from the user's electronic device as each character of the partial search query is entered by the user. The apparatus may utilize a machine-learning model to generate suggested queries that include spelling-corrected versions of the received partial query, query completion suggestions for the partial query, and/or spelling-corrected completion suggestions for the partial query.

Abstract: Time-series columnar-based information is received and indexed in a compute infrastructure for cost-effective cloud-based object storage. The approach leverages a file format that enables highly-performant search and retrieval of the data stored in the cloud. In operation, an indexer receives the time-series information, indexes that information according to the file format, and forwards the indexed information for storage to the object store, where it is stored as a set of time-based partitions. A partition comprises a set of files, namely, a manifest file, a data file, and an index file. These files are structured as a compact instance of a set of raw unstructured data that comprises the given partition. Highly-performant information retrieval is enabled in response to a time-bounded query, because operations at a query peer (with respect to one or more partitions) are carried out in real-time during query processing and without requiring retrieval of the data file as a whole.

Abstract: Systems, methods, and related technologies for application-centric object storage and configuration are described. In certain aspects, a processing device can receive, from an application, one or more requests with respect to a data object. The processing device can process the one or more requests to determine one or more data utilization characteristics of the application with respect to the data object. The processing device can configure one or more aspects of the data object in view of the one or more data utilization characteristics.

Abstract: Systems and methods are described for repairing recordings with at least a portion of a content item stored by a user device. If received metadata does not match reference metadata associated with a reference of the content item, one or more portions of the content stored by the user device may be damaged. The reference metadata and at least portions of the reference content item corresponding to the one or more portions of the content stored by the user device that are damaged may be received to replace the damaged content.

Abstract: A locally optimized plan for executing a command using a sequence of steps can be determined for a single computing node. However, the locally optimized sequence of steps may not be optimized for a combined system comprising multiple computing nodes, any one of which may be tasked with executing the command. A plan that is optimized for the combined system may be determined by comparing the predicted cost of locally optimized plans for computing nodes in the combined system.

Abstract: A search circuit includes a search table including a plurality of entry data, a search processing unit receiving a search key and performing a binary search operation for the search table. Each of the plurality of entry data includes a search data, a prefix length data and a search result data. The search processing unit reads one of the plurality of entry data from the search table according to a binary search operation, specifies a search target range based on the search data and the prefix length data in the read entry data, determines whether the search key is included in the search target range, and outputs the search result data of the read entry data based on a determination result.

Abstract: Techniques for providing analytics regarding software application usage by client computers are presented. The techniques can include providing to at least one of a plurality of client computers at least one license for a usage of at least one of a plurality of software applications; storing transaction information for each usage of the at least one of the plurality of software applications by the at least one of the plurality of client computers, where the transaction information for a particular usage includes a respective chargecode, a respective site name, and a respective indication of license entitlement criteria test results for each of a plurality of license entitlement criteria tests; receiving search criteria at a user interface; searching stored transaction information using the search criteria to obtain search results; and providing the search results.

Abstract: A plurality of module twins that respectively correspond to modules of a plurality of modules of an edge application are stored on an edge device, and the modules comprise the edge application. The modules of the plurality of modules are capable of being used interoperably with other modules without altering the other modules. The plurality of module twins individually include metadata associated with the corresponding module of the plurality of modules. Communications are enabled between the modules of the plurality of modules and the IoT support service according to a common security context, and the metadata of each module twin of the plurality of module twins is synchronized based on the module.

Abstract: Systems and methods are provided for personalizing new song suggestions for a user. A plurality of users provides thumbs up and thumbs down ratings for a pair of songs (song A and B). A first aggregate rating for song B is calculated based on ratings given to song A by all of the users that gave a like rating to song A. Similarly, a second aggregate rating is calculated for song B based on ratings given to song B by all users that gave a dislike rating to song A. Then a user that has not previously rated song B, supplies a rating for song A. A prediction is performed of how the user will rate song B based on the user's rating of song A. For example, the first aggregate rating for song B is used if the user rated song A positively.

Abstract: A query processing method. A server node parses a query request and generates a corresponding logical plan; judges the logical plan belonging to an OLAP scale query service or an OLTP scale query service; in response to judging that the logical plan belongs to the OLAP scale query service, segmenting the logical plan into logical subplans. A coordinator node generates a first physical plan corresponding to the logical plan, and feeds back the first physical plan to the server node. The server node assigns each of the logical subplans to the corresponding worker node according to the first physical plan. The worker node processes the corresponding logical subplan to obtain a query subresult, and reports the processing subresult layer by layer. The server node summarizes the received processing subresult, generates a final query result, and feeds back the final query result to a user.

Abstract: A query including at least a first part and a second part can be received by an electronic system. The first part of the query can indicate to access at least a first database table and a second database table to generate an intermediate result. The second part of the query can indicate to perform a sort operation on the intermediate result with respect to columns across the first database table and the second database table to produce a final result. The method further includes building execution plans for generating the intermediate result according to the first part, where the intermediate result is to be used as the final result without building an execution plan for performing the sort operation.

Abstract: Adaptive Sampling. Data comprising pairings of data value with lists of data keys are received. The range of possible values of the data keys is partitioned into unbalanced buckets, with at least two of the unbalanced buckets representing different fractions of the range. Each unbalanced bucket is assigned to a respective processing unit selected from a plurality of processing units. The pairings are processed by the processing units, with each processing unit generating an intermediate result. The intermediate results are combined to generate a comprehensive result. A sampling error is determined by scaling an unbalanced bucket's intermediate result according to its corresponding fraction and comparing the scaled intermediate result to the comprehensive result. An unbalanced bucket having a sampling error less than a sampling error threshold is selected. The selected unbalanced bucket's corresponding fraction is selected as a sampling rate for a second data processing job.

Abstract: A system may read source data corresponding to a source variable and apply a transformation to the source variable to generate an output variable. The transformation may include logic, and the output variable may be configured for ingestion into a big data storage format. The system may record lineage data of the output variable that comprises the transformation and/or the source variable. The system may also receive a request to generate a requested output variable. The requested output variable may be generated from a second transformation that is the same as the first transformation. The system may thus match the first transformation to the second transformation using the lineage data. In response to matching the first transformation to the second transformation, the system may deny the request. The original output variable may be returned in response to the matching the first transformation to the second transformation.

Abstract: A query processing method. A server node parses a query request and generates a corresponding logical plan; judges the logical plan belonging to an OLAP scale query service or an OLTP scale query service; in response to judging that the logical plan belongs to the OLAP scale query service, segmenting the logical plan into logical subplans. A coordinator node generates a first physical plan corresponding to the logical plan, and feeds back the first physical plan to the server node. The server node assigns each of the logical subplans to the corresponding worker node according to the first physical plan. The worker node processes the corresponding logical subplan to obtain a query subresult, and reports the processing subresult layer by layer. The server node summarizes the received processing subresult, generates a final query result, and feeds back the final query result to a user.

Abstract: In an approach for optimizing query executions a processor receives a request to transfer data from a first table to a second table. A processor detects a relationship between the first table and the second table, wherein the relationship is based on a similarity between the first table and the second table. A processor identifies at least a first access path for transferring the data from the first table to the second table. A processor calculates a first cost of transferring the data from the first table to the second table using the first access path based on the similarity between the first table and the second table, wherein the first cost indicates estimated processor usage to transfer the data.

Abstract: The disclosure herein describes providing a data query service to a user based on natural language request data. The natural language request data is obtained from a user interface and a query structure is populated based on the natural language request data. The query structure is compared to stored queries and, based on identifying a stored query that matches the query structure, the user is prompted to confirm or reject that the identified query be performed. Based on receiving a confirmation of the identified query from the user, the identified query is selected for performance. Alternatively, based on receiving a rejection of the identified query from the user, a query based on the query structure is generated and selected for performance. The selected query is then performed on at least one data source and query output from the performed query is provided to the user.

Abstract: Systems and methods are described herein for performing automated audit balance control (ABC) procedures for data that has moved between data stores within an enterprise or other organization. The systems and methods inspect the data at a target data store and determine the quality of the movement of the data to the target data store based on the inspection. For example, the systems and methods can inspect row or record counts for the data in a data store, aggregate numeric sums within the data at the target data store, perform key data value comparisons between different locations that contained the data, perform full data comparisons between different locations that contained the data, perform checksum comparisons, apply complex business rules, and so on, when determining or verifying the completeness and accuracy of data as it arrives to a temporary or permanent location.

Abstract: Methods, systems, and media for controlling append-only file rewrites are provided. In accordance with some embodiments, the methods comprising: determining a utilization of a shard of a database; determining whether the utilization exceeds a persistent storage utilization threshold; determining a recovery time to recover the shard from an append-only file; determining whether the recovery time exceeds a recovery time threshold; and when the utilization is determined to exceed the utilization threshold or when the recovery time is determined to exceed the recovery time threshold, causing an append-only-file rewrite to be performed.