Abstract: Prefetching query results using expanded queries including generating a database query using a state specification of a graphical user interface, wherein the database query is composed to retrieve initial results from a cloud-based data warehouse; determining that the database query is expandable; modifying the database query to retrieve expanded results from the cloud-based data warehouse, wherein the expanded results include the initial results; and fetching, from the cloud-based data warehouse, the expanded results using the modified database query.

Abstract: A computer-implemented method includes receiving a message comprising an origin, a destination and a relationship type for a relationship between the origin and the destination. The message further includes a payload. A first node is created in a graph database for the origin and a second node is created in the graph database for the destination. A relationship is set between the first node and the second node in the graph database based on the relationship type. A node is created in the graph database for the message while preventing the payload from being stored in the graph database. A relationship is created between the first node and the node for the message. The message, including the payload, is stored in a searchable datastore separate from the graph database.

Abstract: Techniques and solutions are provided for improving query execution. Data models can be complex, which is often reflected in queries against such data models. The present disclosure provides a query refactoring technique where a complex query, such as a query expressed as a single select statement, can be formulated as a series of less complex queries. The workload of a database can be reduced by combining results of the less complex queries outside of the database. The present disclosure provides a framework for implementing these techniques, where the framework includes a virtual cube, a calculation engine, and one or more operations, which can all be implemented as classes in a programming language, and where a generic class or interface can help guide users in developing subclasses that provide a reformulation or refactoring of a complex query.

Abstract: Techniques are disclosed relating to methods that include receiving, by a computer system in a multi-tenant database service, a stream of change event records for a database on a server. A given change event record may be indicative of a modification made to the database by one of a plurality of tenants. The methods may further include storing the received change event records in one or more buffers, and tracking, in a data structure separate from the one or more buffers. Information for ones of the stored change event records may include a corresponding order of reception and a particular tenant associated with a respective change event record. In response to receiving a query from a given tenant, the methods may include processing the query using the data structure to identify change event records associated with the given tenant.

Abstract: A computer-implemented system for organizing data migration is disclosed. The computer-implemented system includes a receiving module to receive a plurality of data as an input from a user, a recommendation module generates a plurality of recommendations by processing on the received input using an artificial intelligence model. The plurality of recommendations includes a plurality of migration plans. A cloud migration module receives a plurality of inputs based on the plurality of migration plans and automatically generate a landing zone pertaining to a first migration wave, a post-migration phase module perform a continuous improvement loop after each phase of the first migration wave, fine-tune the continuous improvement loop for subsequent migration waves, and continuously analyze a predefined cloud platform environment to identify areas of improvement, a chatbot module provides on-demand support to the user during and after the migration.

Abstract: The system includes a parsing module to receive one or more input constructs from a source database in a first syntactical dialect, parse the one or more input constructs received in the first syntactical dialect using an external domain specific language parser, converts the one or more input constructs upon parsing into an abstract syntax tree corresponding to the first syntactical dialect of the source database. A canonicalization module transforms the abstract syntax tree into a canonical abstract syntax tree by utilizing a library of a plurality of operators and expressions corresponding to the first syntactical dialect. A tree optimization module optimizes the canonical abstract syntax tree by utilizing a set of optimization rules. An input translation module converts the canonical abstract syntax tree into an output code corresponding to a second syntactical dialect associated with a target database for compatibility using a translation layer.

Abstract: Methods, systems, and computer-readable storage media for providing a first access schema in a view layer of the database system, the first access schema including first database objects and projection views, each projection view corresponding to a second database object of second database objects in a data persistency, transitioning access of sessions of an application from the data persistency to the first access schema, executing at least a portion of the maintenance procedure in the database system, the at least a portion of the maintenance procedure changing one or more second database objects within the data persistency, creating a second access schema, and transitioning access of the sessions of the application from the first access schema to the second access schema, transitioning access of the sessions of the application from the second access schema to the data persistency, and removing the second access schema from the database system.

Abstract: Technologies are described for storing and reporting user activities within a computing environment. For example, bitsets (e.g., compressed and/or uncompressed bitsets) can be used to store activities (e.g., where each activity is a bit in the bitset in chronological order). Separate bitsets can be maintained for followable aspects of the activities (e.g., a separate bitset for each unique followable). Activity streams can be produced from the compressed bitsets (e.g., custom streams reflecting followables designated by users).

Abstract: Described herein is a regulatory parser that downloads and efficiently processes regulatory documents. The regulatory documents may be from different sources and may have different formats. The regulatory parser parses all of the text in the regulatory documents and converts into a predetermined, single format for downstream applications. The text is organized and stored in a structured tree, organized into one or more hierarchies with nodes storing segments of text from a regulatory document. In some embodiments, each node in the regulatory tree may represent a segment of text. Partitioning the text of a regulatory document into segments of text may make the storage and querying of the regulatory documents more manageable. The organization and structure of the structured tree may reduce the times and resources needed for accessing and searching for a regulatory citation. The structured tree may allow a user to manipulate a regulatory document or text.

Abstract: A learning apparatus according to an embodiment has a feature generation means configured to take a search query, a first document related to the search query, and a second document that is not related to the search query as input, and generate a feature of the search query, a feature of the first document, and a feature of the second document, by using model parameters of a neural network, and an update means configured to take the feature of the search query, the feature of the first document, and the feature of the second document as input, and update the model parameters by using an error function including a cost function that is a differentiable approximation function of an L0 norm.

Abstract: Methods and devices for statistical determination of medication dosage level such as bolus amount based on contextual information are provided.

Abstract: A plurality of functions to configure a unit of a storage volume is maintained, wherein each of the plurality of functions, in response to being applied to the unit of the storage volume, configures the unit of the storage volume differently. Statistics are computed on growth rate of data and access characteristics of the data stored in the unit of the storage volume. A determination is made as to which of the plurality of functions to apply to the unit of the storage volume, based on the computed statistics.

Abstract: Disclosed herein are system, method, and computer program product embodiments for providing a natural, pen-and-paper user experience that harnesses cutting edge artificial intelligence and machine learning to enhance user interactions with data in a suite of software applications. The pen-and-paper user experience may mimic the time-honored human tradition of writing with pen and paper, allowing users to work in an intuitive, productive, familiar fashion. The user experience may automatically retrieve objects, e.g., data, charts, tables, graphs, etc. from backend systems and display the objects in the user experience. The user experience may allow users to provide additional natural language directly on or around the objects and update the displayed results accordingly.

Abstract: Data in a micro-partition of a table is stored in a compressed form. In response to a database query on the table comprising a filter, the portion of the data on which the filter operates is decompressed, without decompressing other portions of the data. Using the filter on the decompressed portion of the data, the portions of the data that are responsive to the filter are determined and decompressed. The responsive data is returned in response to the database query. When a query is run on a table that is compressed using dictionary compression, the uncompressed data may be returned along with the dictionary look-up values. The recipient of the data may use the dictionary look-up values for memoization, reducing the amount of computation required to process the returned data.

Abstract: The present invention provides a system, method and software for digitizing and automating an auditing process. The system comprises a computer, a regulations database, a storage database, and a software program. The method includes: providing regulations or standards for a user to select from the regulations database as a focus for an audit; providing a user-selected filtered regulation or standard from the regulations database; presenting the user a plurality of audit questions in the form of an audit row, one audit row at a time; receiving user responses from which at least one standard row item is created and/or updated; and sending one or more of a filtered regulation or standard row item to the storage database as an audit. The system may permit user information updates. After an audit is completed, the system may transfer the audit information into a final report, which may be provided to the user.

Abstract: A system may deliver personalized content to a user. The system may create a user persona based on demographic information and stored clickstream data of the user. The system may learn which functionalities the user typically uses on a webpage, and the system may create a personalized version of the webpage for the user.

Abstract: Various embodiments enable a web site to expose various search providers that it promotes to browsers that navigate to that site. In at least some embodiments, the search providers are exposed using the HTML of a web page. When a browser navigates to that site, it processes the HTML of the associated web page and exposes the promoted search providers to the user. In at least some embodiments, the browser can permit use of one or more search providers without requiring the user to install the search provider. Alternately or additionally, in at least some other embodiments, the browser can enable the user to quickly and efficiently install the search provider so that the search provider can be available whenever the user uses their browser application.

Abstract: The invention relates to an electronic element supporting data inquiry method, a storage medium and a terminal. The method comprises: obtaining an initial series element code; splitting the initial series element code according to a preset splitting mode to obtain at least a sub-word; establishing a corresponding relationship between the sub-word and the electronic element supporting data and storing the corresponding relationship in a database. Receiving an electronic element identifier; extracting at least a sub-word corresponding to the electronic element identifier, wherein the sub-word is a part of the electronic element identifier; searching for a data tag corresponding to the sub-word, wherein the data tag comprises the sub-word; obtaining the electronic element supporting data corresponding to the data tag. Through the implementation of the invention, the workload in the database construction process is greatly reduced, and the maintenance cost is reduced.

Abstract: A multi-cluster configuration of a database management system in a virtual computing system includes a server that defines a first policy for a source database on a first cluster of a plurality of clusters. Each of the plurality of clusters is registered with the server and the first policy defines capture of snapshots and/or transactional logs from the source database on the first cluster. The server defines a second policy for the source database to replicate at least some of the snapshots and/or transactional logs from the first cluster to a second cluster of the plurality of clusters, captures a first snapshot and/or a first transactional log from the source database in accordance with the first policy, and replicates the first snapshot and/or the first transactional log to the second cluster in accordance with the second policy.

Abstract: Interruptible computing resources for executing queries may be selected. When queries are received, the probability that query can complete execution at interruptible computing resources may be determined. Computing resources to process the query may be selected based on the probability. For queries that are performed on computing resources that are interrupted, interruption handling techniques may retry the query on other computing resources or complete the query on other computing resources, in some embodiments.