Abstract: Techniques for implementing enterprise search using database views are disclosed. In some example embodiments, a computer-implemented method comprises: receiving database queries; generating, for each database query, a corresponding database view comprising a result set arranged in one or more fields of a table; storing the corresponding database views of the database queries; generating a corresponding search configuration for each one of the stored database views, the corresponding search configuration indicating the field(s) of the table of the stored database view; storing the corresponding search configurations for the stored database views; receiving an enterprise search query comprising one or more terms entered via a full-text search field; generating search results for the enterprise search query based on the term(s) using the stored search configurations to access data in the field(s) of the tables of the stored database views; and causing the generated search results to be displayed.

Abstract: An AI platform mesh includes a machine learning control plane hosted in a container orchestration cluster. The machine learning control plane includes a worker plane manager and a set of machine learning services. One or more remote runtime environments configured to execute machine learning workloads can be registered with the machine learning control plane via the worker plane manager. The remote runtime environments can communicate with the set of machine learning services via the worker plane manager.

Abstract: In an example embodiment, first a system is provided that enables tests created by a second entity to run with first entity data and configurations. A test module is able to assess test results with dynamic input (e.g., rule-based assessments). Second, a system is provided to run and test these test modules on the first entity system with first entity configuration and let the first entity define the test input and interpret the test results. This is not performed on all available tests, but only on the tests that are related to the change to be implemented.

Abstract: Lock table management is provided for a lock manager of a database system, in which lock management is provided in a manner that is fast and efficient, and that conserves processing, memory, and other computational resources. For example, the lock table management can use a hashmap in which keys and values are stored in separate arrays, which can be loaded into separate CPU cache lines.

Abstract: Techniques are described for use in database and data management systems to efficiently capture and replicate changes that occur in database tables. The changes are captured in a transaction-consistent order, and in a format that may easily be searched and accessed using common relational queries.

Abstract: A method for analyzing an electronic document including structured data and unstructured data may include applying a machine learning model to determine whether one or more rows of the electronic document correspond to a header row. The machine learning model may be trained to determine whether one or more cells of a row corresponds to a header field by determining whether a text value included in the cells corresponds to an entity. A row may be identified as a header row based on an output of the machine learning model indicating more than a threshold quantity of cells included in the row correspond to a header field. At least a portion of the structured data included in the electronic document may be extracted based on the entity included in the cells of the row identified as the header row. Related systems and computer program products are also provided.

Abstract: Methods, systems, and computer-readable storage media for receiving historical data, the historical data including variable vectors, each variable vector being assigned to a class, processing the historical data through encoders to provide feature vectors, each feature vector corresponding to a respective variable vector and being assigned to the class of the respective variable vector, generating a set of decision trees based on the feature vectors, each decision tree corresponding to a class in the set of classes, transforming each decision tree into a set of rules to provide sets of rules, each rule in a set of rules defining conditions to assign at least a portion of an electronic document to a respective class in the set of classes, and providing the sets of rules for execution in an enterprise system, the enterprise system classifying electronic documents to classes in the set of classes based on the sets of rules.

Abstract: A method may include defining a rule identifying an event that triggers a change in a value of a metric. The defining of the rule includes generating a subscription to receive the event from an event stream. Occurrences of the event identified by the rule may be detected based on receiving the event from the event stream. In response to each occurrence of the event, the value of the metric and/or the change in the value of the metric may be evaluated. A notification may be sent to a software application consuming the metric based on the value of the metric and/or the change in the value of the metric satisfying a threshold. Related systems and computer program products are also provided.

Abstract: Technologies are described for ranking test cases related to changes in a software code base using at least a portion of a call graph that is generated from the software code base. The at least a portion of the call graph comprises method nodes corresponding to methods in the software code base. The method nodes represent control flow relationships between the methods in the software code base. The at least a portion of the call graph also comprises test case nodes. Each test case node is connected to one or more method nodes corresponding to coverage of the one or more method nodes by the test case node. Using the at least a portion of the call graph, the test case nodes are automatically ranked. Ranking of the test case nodes is performed by evaluating various criteria associated with the at least a portion of the call graph.

Abstract: Disclosed herein are system, method, and computer program product embodiments for using a data statistic as a dynamic data integrity constraint. An embodiment operates by defining a data statistic for a column or a set of columns of a partition of a plurality of partitions of a database table. The embodiment creates a constraint data statistics object based on the data statistic. The embodiment receives a query for the database table. The embodiment determines the constraint data statistics object is consistent with a data state of the partition. The embodiment derives an implied constraint based on the constraint data statistics object. The embodiment processes the query for the partition based on the implied constraint.

Abstract: A computer implemented system and method of performing parallel load operations during an extract, transform, load (ETL) operation. The system generates a single transaction having multiple processes, where each process loads into one target table. The processes are executed in parallel, and the system performs verification on the single transaction.

Abstract: Some embodiments provide a non-transitory machine-readable medium stores a program. The program receives a query for data that includes an intersection operation on a first set of strings and a second set of strings. The program further generates a plurality of candidate query execution plans based on the query. The program also determines a plurality of execution costs associated with the plurality of candidate query execution plans. The program further selects a query execution plan from the plurality of candidate query execution plans based on the plurality of execution costs. The program also executes the query execution plan to generate a set of query results for the query.

Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in a federated database system or in a cache of a database management system of a central computing system. When data associated with the virtual table is requested, or prior to receiving the request, the data can be stored in a table in the cache. The logical pointer can be updated to reference the cache. If the cache is full, the table can be removed from the cache, and the logical pointer can be updated to reference a table at the federated database system.

Abstract: Techniques and solutions are described for automatically updating test code based on changes, including additions or deletions, to production code. Requests to analyze production code and a modification to production code are received. The modification is applied to the production code to provide modified production code. Test code specific for the production code is executed on the modified production code. It is determined that a test specified in the test code was failed by the modified production code. A condition responsible for test failure is identified, where the condition specifies at least one expected value or at least one expected result. A modification to update the test code is determined, where the modification includes an actual value or an actual result obtained during execution of the failed test. The modification to the test code is applied to provide modified test code.

Abstract: Systems and processes for generating and managing derivation definitions for calculating sustainability footprints are provided. In a method for generating derivation definitions for calculating footprints, inputs, rulesets, and/or coded processes are determined for the derivation definition. A sequence order for applying the rulesets and/or coded processes is determined for the derivation definition, and the derivation definition is stored in a repository for selection to calculate sustainability footprints.

Abstract: Disclosed herein are various embodiments a code simplification system. An embodiment operates by receiving an identification of both a first code object and a second code object directed to producing a similar result. It is determined that the first code object and the second code object each include code subsets that correspond to each other. Differences between the code subsets of the first code object and the second code object are identified. The differences may include at least one of: a different ordering of the plurality of code subsets between the first code object and the second code object, or an additional code subset in the first code object that is not included in the second code object. A notification is provided with the differences, and input is received indicating an action to take by which either the first code object or the second code object are updated.

Abstract: A system for unloading tables of a database is provided. In some aspects, the system performs operations including determining that a number of accesses to a table occurring within a time period has satisfied an access threshold. The operations may further include identifying, in response to the determining, a first timestamp indicating a most recent access to the table. The operations may further include determining whether a difference between a current timestamp and the first timestamp satisfies a first time threshold. The operations may further include comparing, in response to the difference satisfying the first time threshold, a ratio of the difference and a size of the table to a ratio threshold. The operations may further include unloading, in response to satisfying the ratio threshold, the table. The operations may further include adjusting, based on the feedback, the first time threshold and/or the ratio threshold.

Abstract: Methods, systems, and computer-readable storage media for receiving a dataset, the dataset including a plurality of data values, clustering data values of the plurality of data values into a plurality of input feature clusters in input feature space, training a local multi-task Gaussian process (MTGP) for each input feature cluster to provide optimized hyper-parameters in hyper-parameter space, an optimized hyper-parameter being provided for each input feature cluster, merging data values based on the optimized hyper-parameters, and distances between hyper-parameter clusters in the hyper-parameter space to provide a plurality of merged data values, and providing a LL-MTGP model based on the merged data values.

Abstract: A system includes reception of a database query, the query comprising a first query statement to insert rows of a source table into a target table, generation a second query statement and a third query statement based on the first query statement, the second query statement to insert rows of a first partition of the source table into the target table and the third query statement to insert rows of a second partition of the source table into the target table, generation of a first query operator executable to perform the second query statement, generation of a second query operator executable to perform the third query statement, transmission of the first executable query operator to a second database server node storing the first partition of the source table, and transmission of the second executable query operator to a third database server node storing the second partition of the source table.

Abstract: The present disclosure provides systems and methods for retaining bookmarks of a first document when a second document is saved using the first name of the first document. Upon receiving a request to save the second document using the first name, it is determined whether another document is saved using that particular name. If such a document exists, properties of bookmarks associated with the first document are compared to properties of the second document using a set of rules. If the set of rules are satisfied, indicating that the bookmarks are usable, then the second document is stored using the first name while retaining the bookmarks of the first document.