Abstract: A system includes reception of a query execution plan associated with a plurality of query execution pipelines, estimated execution costs and estimated intermediate result cardinalities, determination of one or more precedence relationships of the plurality of query execution pipelines, determination of an execution order of the plurality of query execution pipelines based on the estimated execution costs, the estimated intermediate result cardinalities, and the one or more precedence relationships, and providing of the execution order of the plurality of query execution pipelines and the query execution plan to a query execution engine.

Abstract: Methods, systems, apparatuses, and computer program products are provided for coordinating a distributed database transaction. A transaction driver, such as a client machine, may initiate a distributed transaction. The transaction driver may transmit to a transaction coordinator a driver report that includes identifying information related to the distributed transaction, including an identification of participants involved in the transaction. The coordinator may determine whether participant reports, which include a status of the portion of the distributed database transaction of a particular participant, are received from each of the participants. Participant reports may also identify participants that are descendants of the reporting participant. The transaction coordinator may store, in a table, information to track the progress of the distributed transaction. Using the table, an outcome of the distributed transaction may be determined and transmitted to one or more of the involved participants.

Abstract: A first direct index lookup table represents the current state of a storage object using entries with references corresponding to tracks of the storage object. A second direct index lookup table represents a first targetless snapshot of the storage object. A virtual replication data pointer table maps the entries of both the first direct index lookup table and the entries of the second direct index lookup table to backend storage via a system replication data pointer table. Updates to the storage object are represented using new entries in the first direct index lookup table and the system replication data pointer table. Movement of a track that is represented in multiple targetless snapshots that are represented by multiple direct index lookup tables is represented by updating the corresponding virtual replication data pointer table and system replication data pointer table rather than updating each of the direct index lookup tables.

Abstract: The present invention relates to join acceleration. In an embodiment, a computer receives a request for a relational join of build data rows with probe data rows. Based on the request for the relational join, a particular kind of data map from many kinds of data map that can implement the relational join is dynamically selected. Based on the build data rows, an instance of the particular kind of data map is populated. A response is sent for the request for the relational join that is based on the probe data rows and the instance of the particular kind of data map.

Abstract: Systems and methods for composite storage of data across tiers of a multi-tenant storage device are provided. In embodiments, a method includes determining attributes associated with each query in a set of queries; determining whether each of the attributes meet respective predetermined threshold values for a first storage tier, a second storage tier and a third storage tier based on statistical data generated for the attributes; updating storage rules for at least one of the first storage tier, the second storage tier and the third storage tier based on the determining; receiving data from the tenant for storage; dividing the data into at least a first portion and a second portion based on the storage rules; and storing the at least the first portion and the second portion on separate ones of the first storage tier, the second storage tier and the third storage tier based on the storage rules.

Abstract: Described are methods, systems and computer readable media for keyed row data selection and processing.

Abstract: Techniques are discussed for preparing and executing scanning plans for particular types of information, including personally identifiable information. A user indicates one or more datastores to be scanned for the particular type of information. A scanner determines scan objectives for the scanning plan and classifiers for use in scans conducted according to the scanning plan. The scanner estimates scan performance metrics and scan quality metrics. The scanner presents estimated results for the scanning plan based on the selected classifiers, scan objectives, estimate scan performance metrics, and estimated scan quality metrics. The user can modify the set of scan objectives or select between alternative sets of scan objectives. The scanning plan may be performed iteratively and the results of previous scan may be used to adjust classifiers or scan objectives to be used in subsequent scans.

Abstract: Systems, devices, media, and methods are presented for assembling a database for query generation. The database is assembled by receiving a query history log, the query history log including target queries and a mapping between each of the target queries and associated subqueries for each of the target queries, selecting one or more of the associated subqueries for a first target query based on a conditional probability exceeding a threshold for the associated subqueries of the first target query compared to the matching associated subqueries of the other target queries, and including the first target query and the selected one or more associated subqueries for the first target query in the in-memory data structure store for query generation.

Abstract: In order to improve the integrating of datasets, improved systems and methods for matching records from a first dataset and a second dataset are provided. Records from the first dataset and the second dataset that are associated with the same individuals are identified. The records are identified using a combination of Euclidean distance, Leviathan distance, and the application of one or more rules. Once the records that are associated with the same individuals are identified, the records can be combined in an integrated dataset.

Abstract: A lifecycle platform for creation, ingestion, version control, and contextual query of knowledge graph is disclosed. Such a platform may be used to create and deploy a knowledge graph by reusing and merging knowledge defined in existing and validated data models. The platform tracks changes made to the knowledge graph after being deployed and provides version tracking of the knowledge graph and its underlying namespaces. The platform further provides a subscribable service for contextual viewing and query of portions and/or subset versions of the knowledge graph. Such a platform may be provided as an agnostic plugin to a specific vendor knowledge graph solution space.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for backup. The method includes: determining a plurality of buffer periods associated with a plurality of pending backup operations of a plurality of objects, each buffer period being a preprocessing period for a corresponding pending backup operation. The method further includes: determining a plurality of predicted execution durations of the plurality of pending backup operations based on historical execution durations of respective historical backup operations of the plurality of objects. The method further includes: determining priorities of the plurality of pending backup operations based on the plurality of predicted execution durations and the plurality of buffer periods. The method further includes: executing the plurality of pending backup operations based on the priorities.

Abstract: Systems and methods for managing data. The methods comprise: receiving, by a load driver node of a network, a request for upload of source data associated with a resource name to a data warehouse; generating a publication identifier and a version value for the source data by the load driver node in response to the request; causing, by the load driver node, operations to be performed by load worker nodes to facilitate population of at least one fact table of the data warehouse with the publication identifier and the source data; and causing, by the load driver node, a publication table of the data warehouse to be updated to include the publication identifier and the version value so as to be associated with the resource name.

Abstract: Disclosed herein is a technique for providing software application recommendations to a user of a computing device. The technique can include: (1) receiving, from the computing device, a request for at least one software application recommendation, (2) identifying, among a plurality of user profiles, a user profile associated with the user, (3) accessing a plurality of software application profiles (SAPs), wherein each SAP of the plurality of SAPs is associated with a respective software application managed by the server computing device, (4) analyzing the user profile against a subset of the plurality of SAPs to identify, among the respective software applications associated with the subset of the plurality of SAPs, at least one software application to recommend, (5) associating the at least one software application recommendation with the at least one software application, and (6) causing the computing device to display the at least one software application recommendation.

Abstract: A system has data capture devices collecting data from different points in a network. The captured data is written to a data store and is directed to an output. The data from the different data capture devices can be delivered to a data analytics device. As long as the data analytics device is able to keep pace with the data that is directed to the output, that data is used by the analytics device. If the analytics device is not able to keep pace, the data written to the data store is retrieved and is used until the analytics device has caught up.

Abstract: Methods, computer systems, computer-storage media, and graphical user interfaces are provided for facilitating data visualization generation. In one implementation, dataset intent data, visual design intent data, and insight intent data determined from a user input natural language query are obtained. A set of candidate intent recommendations is generated using various combinations of the dataset intent data, visual design intent data, and insight intent data. Each of the candidate intent recommendations is incorporated into a set of visualization templates to determine eligibility of the candidate intent recommendations. For eligible candidate intent recommendations, a score associated with a corresponding visualization template is determined. Based on the scores, a candidate intent recommendation and corresponding visualizations template is selected to use as a visual recommendation for presenting a data visualization.

Abstract: A communications system implements instructions including maintaining a message object that includes an array of entries. Each entry of the array includes a field identifier, a data type, and a next entry pointer. The next entry pointers and a head pointer establish a linked list of entries. The instructions include, in response to a request to add a new entry to the message object, calculating an index based on a field identifier of the new entry and determining whether the entry at the calculated index within the array of entries is active. The instructions include, if the entry is inactive, writing a data type, field identifier, and data value of the new entry to the calculated index, and inserting the new entry into the linked list. The instructions include, if the entry is already active, selectively expanding the size of the array and repeating the calculating and determining.

Abstract: The described technology relates to systems and techniques for providing efficient and easy-to-use user-customizable extract templates for running queries against databases. The user-customizable extract templates enable customization of the same predefined query according to the requirements and privileges of respective users. In particular, embodiments enable customization of queries by users themselves, reducing or altogether eliminating having developers to modify the query or associated extract templates while still allowing the data owners or administrators to control access to the data.

Abstract: Examples relate to detecting an abnormality. The examples disclosed herein enable receiving, from a first user, a first request to perform a first transaction on at least one data record. A plurality of transactions originated from the first request may be organized in a first hierarchical tree-based data structure having multiple depth levels. The data structure may comprise a root node representing the first transaction and a leaf node representing a second transaction. The examples further enable detecting the abnormality based on at least one parameter where the at least one parameter comprises a size of the data structure and a depth level associated with the leaf node.

Abstract: A method including analyzing the query data to formulate one or more groups of synonym candidates, wherein each synonym in the one or more groups of synonym candidates is categorized in one or more synonym candidate categories. Reformulating the first search query by removing at least one synonym candidate from the first group of synonym candidates to form a first set of synonyms such that each synonym in the first set of synonyms is categorized in the synonym candidate category that matches the search query category of the search query, wherein the at least one synonym candidate removed from the first group of synonym candidates is not categorized in the synonym candidate category.

Abstract: Shared materialized views are maintained during data changes to the primary data and during creation of new materialized views. Shared data stored for use by shared materialized views is distinguished from data stored by an independent materialized view. A view selector manages data updates to shared materialized views and corresponding mapping table. The view selector directs movement of data between a shared materialized view and an independent materialized view through the lifecycle of the materialized views.