Abstract: In one embodiment, a method receives a query for analyzing data in a database. The query includes a first level calculation that is performed before a second level calculation. When an operator associated with the first level calculation is present in the query, the method performs: calculating the first level calculation by removing group by information for a reference characteristic for the first level calculation to determine a first level calculation result and calculating the second level calculation using the first level calculation result using the group by information for the reference characteristic to determine a second level calculation result, wherein the group by in the second level calculation combines groups of rows in a database table of the database that have the same content in their specified columns.

Abstract: Disclosed herein are system, method, and computer program product embodiments for the detection and resolution of conflicts in data synchronization. An embodiment operates by receiving an upload from a user device of one or more changes to a local copy of a master document. A conflict is identified between the one or more uploaded changes and one or more previous changes to the master document. A super user is notified of the conflict. A resolution of the conflict is received. The resolution to resolve the conflict is applied.

Abstract: Various embodiments of systems and methods to generate web application firewall specific validation rule are described herein. Initially, a web service metadata is processed to retrieve a plurality of data parameters from the web service metadata. Next, a common validation rule is generated based on the retrieved one or more data parameters. The common validation rule is then modified to generate the web application firewall specific validation rule.

Abstract: A method for selectively enabling requests includes There is a first list of in-development backend capabilities and a second list of ready-for-release backend capabilities. There is a third list of in-development middleware capabilities and a fourth list of ready-for-release middleware capabilities. There is a fifth list including backend capabilities which are exposed to a user interface by middleware capabilities, the fifth list being an intersection of the second list and the fourth list. There is a sixth list of development capabilities by taking an intersection of the first list and the third list combined with an intersection of the second list and the third list. Input is accepted from the user interface moving selected development capabilities from the sixth list to the fifth list. Requests from the user interface directed to the backend are selectively enabled to allow only requests directed to backend capabilities of the fifth list of capabilities.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives, from an application, a request to schedule a notification. The program further generates a pending notification. The program also stores the pending notification in a queue. The program further periodically iterates through the queue to check whether an expiration time of the pending notification has elapsed. Upon determining that the expiration time of the pending notification has elapsed, the program also deletes the pending notification from the queue without processing the pending notification. Upon receiving from the application a second set of interactions performed on the application that matches the defined set of interactions specified in the pending notification, the program further processes the pending notification by sending the recipient specified in the pending notification a notification comprising the message specified in the pending notification.

Abstract: Database revalidation may be provided by parallelized execution of distance-based groups. A change to a first data object of the plurality of data objects is received. The first data object has a plurality of dependent data objects in the plurality of data objects. A maximum dependency distance for the respective dependent data objects in the plurality of dependent data objects is calculated. The respective dependent data objects in the plurality of dependent data objects are grouped into one or more groups based on their respective maximum dependency distance. A given group of the one or more groups represents a given maximum dependency distance. The one or more groups are executed on in order from smallest to largest of their respective representations of maximum dependency distance. Executing on the one or more groups includes revalidating the data objects of a respective group in parallel.

Abstract: A path associated with a set of selected log data is defined. An indication is received on a graphical user interface (GUI) to generate a bubblegram associated with the path, wherein the bubblegram comprises one or more bubbles, each bubble representing a particular dimension associated with the selected path. The one or more bubbles are rendered on the GUI according to a performed ranking of the one or more bubbles. A bubble is selected to generate a filter for the path based on the dimension associated with the bubble. A subsequent bubblegram is rendered based on a narrowed set of the selected log data.

Abstract: Methods and systems are disclosed for managing replication of metadata in a master-slave database environment. While metadata is managed on a master node using database tables with transaction guarantees, metadata copies on the slave node are managed using a lightweight key-value store. In exemplary embodiments, master metadata database tables are mapped to respective key-value structures at one or more slave nodes. The key-value structures have entries pointing to respective metadata objects, which include copies of metadata items stored in the master metadata database tables. The key-value structures can be hierarchically organized under a parent key-value structure. Metadata object versions can be organized as a linked list to facilitate multi-version concurrency control. Methods are disclosed for building the key-value store, for retrieving metadata from the store, for updating the store, for providing multi-version concurrency control, and for pruning obsolete metadata versions. Variants are disclosed.

Abstract: A request from an application client is received at a protected application. The request includes an access token. A grant information associated with the received access token is retrieved. The grant information includes a plurality of intersecting scopes of rights granted to the application client. In another aspect, a session is established between the protected application and the application client. Furthermore, at least one scope of rights from the plurality of intersecting scopes of rights is determined to be mapped to at least one Application Programming Interface (API) from a number of APIs provided by the protected application.

Abstract: Recovery of a database system by taking the database system offline is initiated. Thereafter, recovery operations specified by a redo log of the database system are replayed. A cleanup log is generated that identifies cleanup operations occurring during the replay of the recovery operations for garbage collection. Concurrent with the startup of the database, garbage collection of the cleanup operations as specified in the database savepoint is initiated. In addition, concurrent with the replay of the recovery operations, garbage collection of the cleanup operations specified by the cleanup log is initiated. The amount of parallelization of the garbage collection can be varied based on utilized processor resources. The database system is later brought online after all of the recovery operations are replayed.

Abstract: The present disclosure involves systems, software, and computer implemented methods for exchanging shared containers and adapting tenants in database systems. One example method includes receiving a request to deploy a new version of a database system. A deployment package is received that includes new version data. A new shared container is installed in parallel to a current shared container. The new version is deployed to each of multiple tenant containers. Each of the tenant containers is individually linked to the new shared container, including dropping at least one view in each respective tenant container to shared content in the current shared container and adding at least one view in each respective tenant container to the updated shared content in the new shared container. Changed tenant content is deployed to each tenant container. The current shared container is dropped after deployment to each of the multiple tenant containers has completed.

Abstract: In a general aspect, a method includes inserting a record in a partitioned fact table of a star schema data mart. Inserting the record can include determining a first hash value from a first dimension value of the record and determining a first set of candidate partitions from the first hash value. The method can further include determining a second hash value from a second dimension value of the record and determining a second set of candidate partitions from the first hash value. The method can further include comparing the first set of candidate partitions with the second set of candidate partitions to determine a common partition and inserting the record into the common partition.

Abstract: Systems and methods are provided for receiving a notification of an issue with a cloud services application, determining that troubleshooting of the issue comprises review of server logs containing personal data, enabling a data protection and privacy log level instead of a default log level to capture the personal data, generating the one or more server logs containing personal data during replication of the issue based on detecting that the data protection and privacy log level is enabled, indexing the one or more server logs containing personal data and setting access permission to the one or more server logs, detecting that a specified retention time period for the personal data has lapsed, automatically purging the personal data of the one or more server logs based on detecting that the specified retention time period has lapsed, and recording a record that the personal data has been purged.

Abstract: Methods, systems, and computer-readable storage media for providing weighted vector representations of documents, with actions including receiving text data, the text data including a plurality of documents, each document including a plurality of words, processing the text data to provide a plurality of word-vectors, each word-vector being based on a respective word of the plurality of words, determining a plurality of similarity scores based on the plurality of word-vectors, each similarity score representing a degree of similarity between word-vectors, grouping words of the plurality of words into clusters based on the plurality of similarity scores, each cluster including two or more words of the plurality of words, and providing a document representation for each document in the plurality of documents, each document representation including a feature vector, each feature corresponding to a cluster.

Abstract: A method, medium, and system to generate cardinality estimates for at least one query execution plan for a query by representing a given set of multidimensional data including a plurality of data points having a value by a hierarchical tree data structure including nodes, each node representing a distribution of a subset of the points in the data set and being partitioned into tiles; calculating a bounding rectangle of the data points in each node; entering all non-empty tiles into a queue; processing of the queue can continue until a computational memory space limit is reached or until a desired estimation resolution is met; and encoding the resulting tree structure.

Abstract: A range k-nearest neighbor search query of a database is processed by first defining an inner rectangle bounded within a circle around a center point specified by the range k-nearest neighbor search query. Thereafter, a distance to the center point is calculated for each point within the inner rectangle. Query results are returned if k or more points are within the inner rectangle. Otherwise, at least one additional query is executed. Related apparatus, systems, techniques and articles are also described.

Abstract: Example systems and methods of developing a learning model are presented. In one example, a sample data set to train a first learning algorithm is accessed. A number of states for each input of the sample data set is determined. A subset of the inputs is selected, and the sample data set is partitioned into a number of partitions equal to a combined number of states of the selected inputs. A second learning algorithm is created for each of the partitions, wherein each second learning algorithm receives the unselected inputs. Each of the second learning algorithms is assigned to a processor and trained using the samples of the partition corresponding to that algorithm. Decision logic is generated to direct each of a plurality of operational data units as input to one of the second learning algorithms based on states of the selected inputs of the operational data unit.

Abstract: A rule handler may receive a first routing rule and a second routing rule, each routing rule characterizing at least one potential physical transportation route. A rule converter may convert the first routing rule and the second routing rule into a first finite automaton (FA) and a second finite automaton, respectively, and may combine the first finite automaton and the second finite automaton into a finite automaton network graph. A graph comparator may then compare the finite automaton network graph to existing physical transportation routes, and a route selector may select, based on the comparing, at least one feasible physical transportation route from the existing physical transportation routes, the at least one feasible physical transportation route being an instance of the at least one potential physical transportation route.

Abstract: Technologies are provided for creating and using template constraint expressions in constraint-based systems. Template constraint expressions can be created that can be used to define multiple usages of a same constraint rule in a configuration model. Using the template constraint expression, the constraint rule can be translated once and used multiple times as different instances of the rule are activated. Updates to the rule can be made to the template constraint expression and applied to all of the related instances. Constraint expressions can be created based on the template constraint expression. Configuration rule definitions in a configuration model definition can be parsed to create graphical representations of the configuration model definition. One or more of the graphical representations can be used to create a template constraint expression. Multiple object instances in the configuration model can be identified that satisfy matching criteria of the template constraint expression.

Abstract: In an example, a computerized neural fabric is created by representing each pattern of learned weights of one or more machine learning algorithm-trained models specifying a specific set of products as a column in the computerized neural fabric, each pattern comprising one or more clusters representing combinations of convolutional filters, each cluster learning low level features and sending output via a vertical flow up the corresponding column to a final classification within the corresponding pattern. One or more potential lateral flows between patterns in the computerized neural fabrics is dynamically determined based on resemblance of a new product in a candidate image to the specific sets of products in each of the patterns and identifying possible mutations of the patterns based on the resemblance. Then, one of the one or more potential lateral flows is selected as a new model.