Abstract: A cloud computing system, which works in cooperation with a plurality of relay devices, is configured to receive measurement data transmitted from each of the relay devices arranged in respective bases and perform accumulation processing in a hierarchical structure of a logical tree form in a measurement database, and perform aggregation analysis processing on the measurement data subjected to the accumulation processing in the respective bases and for each integration target between the bases. The aggregation analysis processing is performed on the measurement data for the each integration target between the bases by recognizing a relationship between the bases under the same starting point on the basis of a measurement unit of a measurement value or a type of a measurement source as for the value in the source accumulated in the database as an ending point of the hierarchical structure.

Abstract: Embodiments of the present disclosure are directed to systems and methods for managing a database. In one or more examples, the system obtains input data comprising one or more data entries, where each data entry comprises one or more data items, and each data item comprises a field name and a field value. The system can generate a key-value set for each data item to obtain a plurality of key-value sets. Each key-value set includes at least a first key element comprising the field name of the respective data item and a second key element comprising the field value of the respective data item. The system can sort and store the plurality of key-value sets in the database. The system can further receive a query indicative of a field name or a field value, and generate, for display, an output based on retrieved key elements sets based on the query.

Abstract: In some implementations, a method performed by data processing apparatuses includes receiving configuration data for a preconfigured data connector, including connection parameters, time interval parameters, and data transformation parameters. The connection parameters are used to establish a connection to a bulk data source. In response to determining that an amount of time has elapsed that corresponds to the time interval parameters, bulk data is retrieved from the bulk data source for a given time interval, and the retrieved bulk data is transformed in accordance with the data transformation parameters. Based on transforming the retrieved bulk data, a data metric is generated that condenses the retrieved bulk data. A predetermined predicted metric value is received from a prediction data source for the data metric for a time interval that corresponds to the given time interval, and the predicted metric value is stored with the measured metric value.

Abstract: A system for managing database logging, the comprises a processor; and a user task executing in a database server process and executable by the processor, the user task to: receive in a database management system on a database server, a command to manipulate a portion of a database managed by the database management system; obtain a lock on the portion of the database; create a first log record in a first private log cache associated with the user task, the first log record recording a data manipulation to the portion of the database; enqueue the first log record to a queue; and release the lock on the portion of the database after copying the first log record to the queue.

Abstract: The system ensures database validity by obtaining a data structure representing data processing blocks and a data flow among the data processing blocks. A first data processing block includes a first data input and the second data processing block includes a second data output. The system obtains controls associated with the data structure, where a first control corresponds to the first data output, and a second control corresponds to the second data input. The system obtains data to be processed by the first data processing block, processes the data through the first data processing block, and executes the first control based on the processed data. Based on the execution, the system determines whether the processed data satisfies the first control. If the processed data does not satisfy the first control, the system generates an alert indicating a problem with the output data validity.

Abstract: Systems and methods are provided for creating and utilizing search indexes with different properties to provide efficient and flexible means for retrieving and ranking high-dimensional content. A first index and a second index are generated with a different sets of properties, which may include a permutation prefix length and a vector quantization scheme, and are each associated with a computational workload. Further, at least one index structure may be created with a posting list associated with a permutation prefix and a set of references, rather than only a permutation prefix, to balance out posting lists of variable lengths within the index. Another embodiment of the disclosure provides for expansion of search results at search time, rather than during indexing, by retrieving posting lists associated with shorter permutation prefix after an initial list is determined to have insufficient recall.

Abstract: A method and system are provided for data synchronization. The method includes registering, in a database accessible by nodes in a cloud cluster system, node information for each node during an initialization of an application context for an application having at least one instance running on each node. The method further includes storing an update for data in (i) a local storage of a given one of the nodes and (ii) the database, responsive to a request to update the data received by the given one of the nodes. The method also includes generating a modified request that includes details for the updated data. The method additionally includes calling an application programming interface to update a state of respective local storages for the other nodes with the update responsive to the modified request, such that the update is synchronized across the at least one instance running on each node.

Abstract: A method of implementing sub-table replication starts with the processor detecting an update to an entitlements table. The processor performs filtering of a data table based on the update to the entitlements table. The data table including an entitlements column. The processor detects an update to the entitlements column and performs incremental replication of the data table by causing a version-based replication to be executed. Other embodiments are also described herein.

Abstract: Computer-implemented methods, systems and products for character string frequency analysis. The method includes a set of operations or steps, including parsing a plurality of character strings into one or more tokens, categorizing the one or more tokens into one or more token frequency categories, and generating a first similarity score between one or more pairs of character strings of the plurality of character strings. The method further includes calculating one or more degrees of commonality or rarity of the plurality of character strings based on the categorizing, generating one or more penalties for token pairs of the one or more pairs of character strings associated with the first similarity score based on the one or more degrees of commonality or rarity and the categorizing, and generating a second similarity score based the first similarity score and the one or more penalties.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to analyze graph information. An example apparatus includes a graph computational processor. The example graph computational processor is configured to analyze a first graph with respect to a second graph to identify a third graph within the first graph by: matching a first triplet from the first graph to a second triplet from the second graph by comparing each node and connecting edge included in each triplet; and generating the third graph by adding, when the first triplet matches the second triplet, the first triplet to a subgraph output set forming the third graph. The example graph computational processor of is configured to identify an additional node in the first graph based on the third graph and generate an output based on the additional node.

Abstract: A storage tier manager efficiently creates different representations of a dataset backup for different retention periods. Each of the representations of the dataset backup is distinctly identifiable despite initially representing a same dataset backup. The representations are structured metadata corresponding to the dataset backup. One representation is a cached backup version of the dataset backup (“cached backup” or “cached representation”) provided for low latency access while residing at a storage tier of the backup appliance for a relatively short retention period according to a lifecycle management policy. The other representation is a cloud backup version of the dataset backup (“cloud backup” or “cloud representation”) provided for persisting into cloud storage for a longer retention period according to the lifecycle management policy.

Abstract: A data management system includes: a tree-structure-holding means for storing a transformed tree structure into which an original tree structure has been transformed by a rotation operation, the original tree structure being a tree structure indicating hierarchical inclusion relations among data sets associated with nodes; an inter-data-relation-holding means for storing a reverse link, the reverse link being a link between nodes the levels of which have been reversed by the rotation operation; and an inter-link-relation-holding means for storing a temporarily placed link in association with the reverse link, the temporarily placed link being a link to a node that has been transferred from immediately below an ex-lower-level node to immediately below an ex-upper-level node, the ex-lower-level node and the ex-upper-level node being nodes the levels of which have been reversed.

Abstract: Techniques are described herein for building a framework for declarative query compilation using both rule-based and cost-based approaches for database management. The framework involves constructing and using: a set of rule-based properties tables that contain optimization parameters for both logical and physical optimization, a recursive algorithm to form candidate physical query plans that is based on the rule based tables, and a cost model for estimating the cost of a generated physical query plan that is used with the rule based properties tables to prune inferior query plans.

Abstract: A system is disclosed to evaluate data quality in a big data environment. An example method performed by the system includes retrieving one or more rules from an asset catalog. The method further includes retrieving, based on the one or more rules, counter information from a data set, and generating, by a processor, one or more metrics based on the one or more rules and the counter information. In addition, the method includes evaluating, by the processor, the one or more metrics based on the one or more rules. In an instance in which evaluation of a particular metric of the one or more metrics identifies an attribute value that exceeds a predetermined threshold, the method includes causing a notification message regarding the particular metric to be output. A corresponding apparatus and computer program product are also provided.

Abstract: System and method embodiments are provided for using different storage formats for a primary database and its replicas in a database managed replication (DMR) system. As such, the advantages of both formats can be combined with suitable design complexity and implementation. In an embodiment, data is arranged in a sequence of rows and stored in a first storage format at the primary database. The data arranged in the sequence of rows is also stored in a second storage format at the replica database. The sequence of rows is determined according to the first storage format or the second storage format. The first storage format is a row store (RS) and the second storage format is a column store (CS), or vice versa. In an embodiment, the sequence of rows is determined to improve compression efficiency at the CS.

Abstract: A method of implementing sub-table replication starts with the processor detecting an update to an entitlements table. The processor performs filtering of a data table based on the update to the entitlements table. The data table including an entitlements column. The processor detects an update to the entitlements column and performs incremental replication of the data table by causing a version-based replication to be executed. Other embodiments are also described herein.

Abstract: Techniques for patching metadata content in a base repository are disclosed. Techniques can include customizing, by a computer including a processor and a memory, metadata content in an existing base repository, consolidating the metadata content customized in the existing base repository into a consolidated customization file, obtaining a new version of a base repository, transforming the metadata content in the consolidated customization file in accordance with the new version of the base repository and applying the transformed metadata content to the new version of the base repository. Transformation can be performed in response to metadata content being renamed, recreated and deleted.

Abstract: Embodiments include systems and methods for performing data migration using source database classification. Information about source databases can be received from a source system, including source hardware types and processor information for the source databases. Each of the source databases can be classified to one of a plurality of predetermined database sizes based on the received information. The source system can be interrogated to derive information about the source databases, such as a processor utilization per database. Characteristics of the classified database sizes can be adjusted based on the derived information and resource requirements at a target system for the classified source databases can be determined. A shape for the target databases can be generated based on the resource requirements, the shape including target databases of predetermined database sizes implemented by target hardware, where the target databases are configured to receive migration data from the source databases.

Abstract: A mechanism is provided for re-ranking search results based on a personal medical condition. One or more medical conditions associated with a patient are identified based on an analysis of patient information associated with the patient. The one or more medical conditions are correlated with a set of medical condition content indicator data structures. A search query corresponding to the patient is processed to generate initial search results that are ranked with an initial ranking. The initial search results are analyzed based on a patient specific dictionary data structure corresponding to the one or more medical conditions associated with the patient. The content of the initial search results are re-ranked to generate re-ranked search results having a modified ranking that is based on the one or more medical conditions of the patient. The re-ranked search results are output to the patient in accordance with the modified ranking.

Abstract: Methods, systems, and computer-readable storage media for range queries over encrypted data include actions of receiving a range query token, determining one or more of whether a tree list of an encrypted search index is empty and a range of the token intersects with a range accounted of a tree in the tree list, the encrypted search index including the tree list and a point list, receiving encrypted query results based on one of a search tree, if the tree list is not empty and a range of the token is at least a sub-range of a range accounted for in the tree list, and the point list, if the tree list is empty or the range of the token is not at least a sub-range of a range accounted for in the tree list, and updating the encrypted search index based on the token.