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.

Abstract: A data storage system providing data access to multiple users is provided. The data storage system includes a data store configured to store electronic files and a processor operably coupled to the data store. Memory is operably coupled to the processor and stores instructions that, when executed, provide an access control component that allows certain users to interact with a given electronic file of the stored electronic files. The processor is configured to detect a change to the given electronic file that affects a user's access to the given electronic file and responsively generate a notification to the user that allows the user to request renewed access to the given electronic file.

Abstract: A system and method include associating, by a database system of a virtual computing system, a protection schedule with each source database provisioned in the database system, the protection schedule defining a frequency of capturing snapshots and a frequency of capturing transactional logs, capturing, by the database system for each of the source databases, snapshots and transactional logs based upon the frequency of capturing snapshots and the frequency of capturing transactional logs, respectively, and receiving, by the database system, a request identifying a point in time for creating a cloned database from a first source database. The system and method also include retrieving, by the database system, the snapshots and the transactional logs corresponding to the point in time and creating, by the database system, the cloned database by combining data in storage locations identified in the transactional logs and the data in remaining storage locations identified in the snapshots.

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: The present disclosure is directed towards systems and methods for finding documents that are similar to a reference text. The inventive systems and methods examine a set of collected documents to determine the facts present in those documents by, for example, extracting triplets and expanding them. A user's input reference text is similarly examined to extract and expand triplets therein and the facts identified with respect to the reference text are used as a basis to find documents having similar facts. The present disclosure is also related to systems and methods for mining facts from documents relating to a primary source such as a piece of legislation and using the mined facts to improve the results of subsequent searches.

Abstract: Methods, systems, and apparatuses, including computer programs for generating and using a hash table configured to improve mapping of reads are disclosed that include obtaining a first seed of K nucleotides from a reference sequence, generating a seed extension tree having a nodes, wherein each node of the nodes corresponds to (i) an extended seed that is an extension of the first seed and has a nucleotide length of K* and (ii) one or more locations, in a seed extension table, that include data describing reference sequence locations that match the extended seed, and for each node: storing interval information at a location of the hash table that corresponds to an index key for the extended seed, wherein the interval information references one or more locations in the seed extension table that include reference sequence locations that match the extended seed associated with the node.

Abstract: Methods, systems, and devices supporting primitive-based query generation are described. A database system may receive a natural language query associated with a subset of data sets stored at the database system, determine a set of tokens included in the natural language query, and label one or more tokens of the set of tokens with one or more primitives from a set of supported primitives associated with the subset of data sets. The database system may determine a set of higher order concepts corresponding to query operations, query conditions, or both based on the one or more labeled tokens. The database system may train a neural network to learn a grammatical structure of the natural language query and generate a database query for querying the database system based on the one or more labeled tokens, the set of higher order concepts, and the neural network.

Abstract: Systems and methods of the present disclosure enable secure data aggregation in an aggregation database. The aggregation database has an aggregation database schema configured to communicate with entity-specific databases via entity-specific secure connections. The aggregation database receives, from the entity-specific databases, user profiles having an entity identifier identifying an entity, and a metric associated with a user. Groups associated with the user profiles are determined based on the metric associated with each user profile. The user profiles are ranked within each group for a ranking across the entity-specific databases based on the metric. A percentile rank in each group across the entity-specific databases is determined for each user profile. Each user profile is modified to include the percentile rank and are returned to each entity-specific database without other user profiles not associated with each respective entity-specific database.

Abstract: Methods for cascade elimination of candidates in spatial relation operations are performed by systems, devices, and apparatuses. Spatial relation operations include counts of geometric objects against geographies/geometries, and data points associated with vertices of shapes representing the geographies/geometries are reduced to form smaller sets of data points that represent the initial shapes. Elimination of geometric objects for operations is performed using inner- and outer-reductions in cascade. Data points are reduced until a representation of the original shape with a specified area or number of data points is generated. Multi-polygon geometries are joined by union based on preservation of area and data points of the polygons therein prior to reducing data points. Cascade reductions are also performed at specified times during spatial operations based on costs associated therewith.

Abstract: The disclosure includes aspects of a system and/or method including a hash multi-table joining implementation method based on a grouping vector, which includes the following steps: 1) rewriting an SQL query command, and dividing a complete OLAP query command into a subtask of selecting-projecting-grouping-joining operation and an subtask of aggregating operation; 2) creating and generating grouping vector metadata corresponding to a GROUP-BY statement in an SQL command through the subtask of selecting-projecting-grouping-joining operation, and creating a vector index as an output result of the subtask of selecting-projecting-grouping-joining operation; 3) executing aggregation computation based on the vector index through the subtask of aggregating operation, and storing an aggregation computation result in a corresponding unit of a grouping vector aggregator with the same length as the grouping vector; and 4) merging the aggregation computation result in the grouping vector aggregator with the grouping vecto

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating a win prediction for an opportunity. In some implementations, a server receives data representing an opportunity. The server obtains historical data from a data repository based on the received data representing the opportunity. The server generates standardized feature vectors based on non-standardized data, the non-standardized data comprising (i) the received data and (ii) the obtained historical data. The server filters the standardized feature vectors. The server generates a win percentage based on the filtered feature vectors using classifiers. In response to generating the win percentage for the opportunity, the server generates a plurality of data insights using the classifiers and the generated win percentage, wherein the plurality of data insights describe one or more data predictions for pursuing the opportunity.

Abstract: Disclosed are various approaches for providing a natural language interface for searching databases. A natural language query is parsed to identify a plurality of tokens. At least one operator is identified with a machine-learning model based at least in part on the plurality of tokens. Next, at least one attribute and at least one respective attribute value are identified with a machine-learning model based at least in part on the plurality of tokens. Then, at least one constraint is identified with a machine-learning model based at least in part on the plurality of tokens. Finally, a machine language query is generated based at least in part on the at least one operator, the constraint(s), the attribute(s), and the respective attribute value(s).

Abstract: A method and apparatus that recommends a feature from a data set. The method includes performing a first conversion on the data set including one target variable and a plurality of feature variables by converting a missing value for each of the feature variables into a preset constant, executing a first algorithm to determine a level of redundancy of the plurality of feature variables, using the data set converted by the first conversion and producing first recommendation information that includes a predetermined number of feature variables selected based on a result of the executing the first algorithm.

Abstract: A computer-implemented method according to one embodiment includes compiling log data from all nodes of a cluster, retrieving a timestamp table stored within the cluster, optimizing the timestamp table, and adjusting the log data from all the nodes of a cluster, utilizing the timestamp table.

Abstract: Systems and techniques are generally described for multi-stage text-based clustering. In various examples, a first data set comprising a first set of elements may be received. Each element of the first set of elements may include text data. A clustering algorithm may be used to determine a first set of clusters of the first set of elements based at least in part on similarities in the text data. A second set of clusters, for each cluster of the first set of clusters, may be determined using the clustering algorithm. A number of resources for labeling the first set of elements may be determined based at least in part on the first set of clusters. The number of resources may be assigned to label clusters of the second set of clusters based at least in part on a number of elements in each cluster of the second set of clusters.

Abstract: A method for execution by a query processing system includes receiving a query expression that includes a call to a computing window function. The computing window function is executed in accordance with execution of the query expression against a database. Execution of the query expression includes accessing an ordered set of rows of the database indicated in the call to the computing window function, and applying a recursive definition indicated in the call to the computing window function to each row in the ordered set of rows to generate output for each row in the ordered set of rows. A query resultant for the query expression is generated based on the output for each row in the ordered set of rows.