Abstract: The present disclosure relates to computer-implemented methods, software, and systems for processing hierarchies of data. A first changeable version of a current hierarchy of nodes is created to refer to a current stable version and to a first set of new relations associated with changes in a first set of relations between entities in the current stable version is response to a received first instruction. A second instruction to adjust the current stable version is received from a second user. In response to receiving the second instruction, a second changeable version of the current hierarchy of nodes is created. The second changeable version refers to the first changeable version and to a second set of new relations associated with changes in a second set of relations between entities in the first changeable version. A new stable version of a new current hierarchy of nodes is generated.

Abstract: Systems and methods are provided for receiving an updated data set from a backend server system, determining a visible set of data in a user interface displayed on a computing device, and processing, based on the updated data set from the backend server system, each row tuple in the visible set of data in the user interface to generate updated row tuples. The systems and methods further provide for determining one or more data cell that has been changed in the visible set of data corresponding to the updated row tuples, and rendering, in the user interface, only the one or more data cell that has been changed corresponding to the one or more row tuple to update the one or more data cell in the user interface displayed on the computing device.

Abstract: Systems and methods include determination of a first code artifact and a second code artifact, generation of a first plurality of key, value pairs based on the first code artifact and a second plurality of key, value pairs based on the second code artifact, identification of a plurality of changes between the first plurality of key, value pairs and the second plurality of key, value pairs, the plurality of changes represented by a third plurality of key, value pairs; determination, for each of a plurality of rules, of whether the third plurality of key, value pairs includes at least one key, value pair associated with the rule and, if so, application of the rule to each of the at least one key, value pairs to determine an analysis output associated with each of the at least one key, value pairs, and generation of a visualization based on the analysis outputs.

Abstract: The present disclosure relates to computer-implemented methods, software, and systems for managing cloud application in a transparent multiple availability zone cloud platform. A request to access a cloud application running on the multiple availability zone cloud platform is received. The request can include an application location for accessing the cloud application. A network address corresponding to the application location is determined. In response to determining the network address, a first availability zone of the multiple availability zone cloud platform that is currently active to process the request is determined. A plurality of network locations corresponding to a host component of the application location is determined by a first load balancer. A network location of the plurality of network locations for processing the request is identified based on load balancing criteria.

Abstract: A computer-implement method can receive a text message sent from a mobile application and extract a plurality of named entities from the text message. The method can evaluate, based on the plurality of named entities, whether the text message represents a valid expenditure. Responsive to finding that the text message represents a valid expenditure, the method can classify the text message into one of multiple categories, and generate an expenditure entry including the plurality of named entities and a category to which the text message is classified into.

Abstract: Techniques and solutions are provided for improving the performance of scheduled, computer-implemented tasks. A scheduler client can include an embedded scheduler. The embedded scheduler can monitor resource use by the scheduler client during execution of instances of a scheduled job. The embedded scheduler can also monitor resource used by targets of the scheduler client. The embedded scheduler can improve parallelization of subtasks for an instance of a scheduled job. Multiple instances of the scheduler client can be created to provide additional resources to be used in executing schedule instances. The multiple instances of the scheduler client can share access to information regarding schedule instances, such as to assist in selection of schedule instances to be executed by a particular scheduler client.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program may generate a visualization comprising a set of data from a data model. The set of data comprises a set of measure values categorized according to a plurality of dimensions. The program may receive a request to rank the set of measure values based on a first dimension in the plurality of dimensions and a second dimension in the plurality of dimensions. The program may in response to receiving the request, generating a query for a subset of the set of data for the visualization. The query comprises a set of conditions. The program may send the query to a computing system for processing. The program may receive, from the computing system, the subset of the set of data. The program may update the visualization to include the subset of the set of data.

Abstract: Technologies and solutions are also provided for determining a number of characters in encoded data, particularly for encoding formats that have variable byte lengths. Bytes in the encoding format can have different types, including at least one type that represents a continuation byte. That is, rather than having all data for a character being in a single byte, the data is encoded using two or more bytes. The number of continuation bytes can be counted and subtracted from a total number of bytes in a data set to determine the number of characters in the data set. Optionally, the validity of the data set with respect to an encoding format can be determined prior to, or concurrently with, determining a number of characters in the data set. SIMD techniques can be used with the character counting/validation processes to improve their performance.

Abstract: Techniques and solutions are provided for determining the validity of encoded data. Data encoding techniques associated with a particular format can encode characters as a sequence of bytes, where the bytes can be of particular types. Particular sequences of byte types can be valid or invalid using a given encoding format. Lookup tables can be defined to examine bytes in a byte sequence to determine whether the sequence is valid or invalid. In a particular example, results of lookup operations can produce a result in the form of a sequence of bits, where values of the bits can be used to identify that a sequence is invalid, as well a particular type of encoding error. The techniques can be implemented in ways that are particularly efficient for a computing system, such as implementing lookup operations using SIMD (“Single Instruction, Multiple Data”) techniques.

Abstract: A database system detects a query targeting a first database object stored in a unified persistence format in a persistence store. In response to detecting the query, the database system determines whether to load the first database object in column-loadable format or page-loadable format into an in-memory store. In response to determining to load the first database object in the column-loadable format, the database system determines if a first bit representation of one or more corresponding primitives in the persistence store is compatible with a second bit representation used for storing the primitives in the in-memory store. The database system performs a native copy operation to copy the primitives from the persistence store to the in-memory store if the bit representations are compatible, where the native copy operation involves copying the primitives on a page-by-page basis without decoding and encoding values of the one or more primitives.

Abstract: A system may include a virtual machine, of a cloud computing environment, that executes a target application workload to be intercepted. A software defined anomaly detection engine (that is separate from the target application workload and that is also executing in the virtual machine) may intercept the target application workload. A computer processor of the software defined anomaly detection engine may intercept network traffic that is external to the virtual machine and associated with the target application workload. The software defined anomaly detection engine may then automatically execute an anomaly detection algorithm in substantially real time on the intercepted network traffic to generate an intercept result. An anomaly detection alert signal may be transmitted based on a comparison of the intercept result and an anomaly threshold value.

Abstract: Some embodiments provide a program that receives a set of data for a first record in a first table. The set of data comprises a set of values for a set of attributes. In a data loading process configured to load a subset of the set of data into a subset of a first set of columns in the first table, the program determines that a first column in a first set of columns does not belong in the subset of the first set of columns. The program generates the first record in the first table. The program generates a value for the first column in the first set of columns that refers to a second record in the second table configured to represent a defined type of record. The program stores the value in the first column in the first set of columns of the first record.

Abstract: According to some embodiments, methods and systems may be associated with a cloud computing environment. A workload prediction framework may receive observed workload information associated with a database in the cloud computing environment (e.g., a DataBase as a Service (“DBaaS”)). Based on the observed workload information, a Statement Arrival Rate (“SAR”) prediction may be generated. In addition, a host variable assignment prediction may be generated based on the observed workload information. The workload prediction framework may then use the SAR prediction and the host variable assignment prediction to automatically create a workload prediction for the database. A physical database design advisor (e.g., a table partitioning advisor) may receive the workload prediction and, responsive to the workload prediction, automatically generate a recommended physical layout for the database (e.g., using a cost model, the current physical layout, and an objective function).

Abstract: Various systems and methods for selective revalidation of data objects are provided. In one example, a computer-implemented method includes updating a target data object of a database system according to a definition statement, and determining whether the definition statement changes one or more object properties of the target data object. In response to determining that the definition statement changes the one or more object properties of the target data object, the method includes revalidating data objects depending on the target data object. In response to determining that the definition statement does not change the one or more object properties of the target data object, the method includes not revalidating the data objects depending on the target data object. In this way, database management performance and speed may be improved while maintaining validity of data objects in a database.

Abstract: A method, a system, and computer program product for offline document editing. A request to download a document stored at a remote database is received. The document is accessible through an online application. A structure of the document is generated by using metadata associated with the document. The document is generated by filling entries of the structure using data retrieved from the remote database. The document is transmitted to be downloaded for offline editing. An updated document generated by modifying the document using offline editing is received. The remote database is updated using the updated document.

Abstract: Disclosed herein are system, method, and computer program product embodiments for providing a lock-free read access to one or more data structures. An embodiment operates by allocating a first portion of a memory corresponding to a first data structure of the one or more data structures, the first data structure comprising a size. The embodiment then performs a first operation associated with the first data structure. The embodiment then receives a first request to insert second data to the first data structure, and determines whether an increase of the size is to be executed. The embodiment then, based on the determination that an increase of the size is to be executed, inserting the second data to a modified first data structure, comprising: executing garbage collection to free-up the first portion of the memory based on at least one parallel operation associated with the first data structure.

Abstract: In some implementations, there is provided a method that includes monitoring, by an application uptime system, whether execution of an application is successful without causing an incident; in response to the execution of the application being unsuccessful and causing the incident, the method further comprising: collecting one or more end user incident reports including an incident identifier, a start time of the incident, and a stop time of the incident, collecting one or more development system incident reports linked to the one or more end user incident reports, determining at least one end user metric for the application, generating one or more user interface views based on the at least one end user metric for the application, and causing to be presented the one or more user interface views. Related systems, methods, and articles of manufacture are also disclosed.

Abstract: Techniques for implementing cloud services of a cloud service provider in a dedicated user account environment in a distributed computing system are disclosed. In some example embodiments, a computer-implemented method comprises: receiving, by a management system of a cloud service provider, a user request for creation of an instance of an application platform of the cloud service provider in a user environment within a distributed computing system, the user environment being dedicated to a user account hosted by the distributed computing system, the user request comprising credential data configured to provide the management system with limited permission for accessing the user environment, the limited permission restricting the management system from full administrative privileges in accessing the user environment; and deploying, by the management system, the instance of the application platform to a workload cluster in the user environment using the credential data to access the user environment.

Abstract: Example methods and systems are directed to generating knowledge graph entities from text. Natural language text is received as input and processed using named entity recognition (NER), part of speech (POS) recognition, and business object recognition (BOR). The outputs of the NER, POS, and BOR processes are combined to generate knowledge entity triples comprising two entities and a relationship between them. Keywords are extracted from the text using NER to generate a set of entities. A node in a knowledge graph is created for at least some of the entities. A POS tagger identifies verbs in the text, generating a set of verbs. Relational verbs (e.g., “talk to” or “communicated with”) are detected and used to create edges in the knowledge graph. The knowledge graph may be converted back to natural language text using a trained machine learning model.

Abstract: A new cultivar of Ulmus tree named ‘Everalan’ that is characterized by its straight central leader, its narrow, upright, and uniform plant habit, its branches that are held in 45° angles that reduces the need for pruning, its good commercial propagation from unrooted cuttings, its deciduous habit, producing few leaves persisting into late winter, its foliating bark that tends to curl in strips and reveals colorful patches of orange-tan, grey and white, its low quantity of winged branches, and its resistance to Dutch elm disease, elm leaf beetle damage, drought, wind, extreme winter and summer temperatures, and leaf scorch.