Abstract: Systems and methods are disclosed to implement a bounded group by query system that computes approximate time-sliced statistics for groups of records in a dataset according to a group by query. In embodiments, a single pass scan of the dataset is performed to accumulate exact results for a maximum number of groups in a result grouping structure (RGS) and approximate results for additional groups in an approximate result grouping structure (ARGS). RGSs and ARGSs are accumulated by a set of accumulator nodes and provided to an aggregator node, which combines the received structures to generate exact or approximate statistical results for at least a subset of the groups in the dataset. Advantageously, the disclosed query system is able to produce approximate results for at least some of the groups in a single pass of the dataset using size-bounded data structures, without predetermining the actual number of groups in the dataset.

Abstract: Embodiments of the disclosed technologies receive a first signal from a user session and create a first ranked list of content items. Based on the first signal, a first subset of the first ranked list is assigned to a first set of slots of the user session. A second subset of the first ranked list is assigned to a second set of slots of the user session. Based on user activity data and position context data, a second ranked list of content items is created. The second ranked list is assigned instead of the second subset to the second plurality of slots.

Abstract: An embodiment includes processing a dataset to generate a set of feature vectors that include a first feature vector corresponding to a first concept within a user's areas of interest and a second feature vector corresponding to a second concept within the user's areas of study. The embodiment identifies clusters of the feature vectors and identifies key features that most contribute to influencing the clustering algorithm. The embodiment selects the first feature vector in response to a user query, and then selects the second feature vector based on an overlap between key features of the first and second feature vectors and a degree of dissimilarity between the first and second concepts. The embodiment outputs a query response that includes the second concept. The embodiment also determines an effectiveness value based on sensor data indicative of a user action responsive to the outputting of the response to the query.

Abstract: A computer-implemented method for efficiently estimating the number of unique elements in a collection of elements comprises generating, via hash logic, hash values associated with the elements. The hash values specify bit positions within an array of bits. Hash values output from the hash logic conform to a geometric distribution such that bit positions of the array of bits corresponding to lower orders bits are more likely to be generated than bit positions corresponding to higher-order bits. Bits of the array of bits corresponding to the bit positions are set. The number of bits of the array of bits that are set is counted. Estimation logic estimates the number of unique elements of the collection of elements as a function of the number of bits of the array of bits that are set.

Abstract: Software feature metadata objects and software artifact search, identification, and tracking is provided herein. A software artifact can have an associated software feature metadata object. A software feature metadata object can include metadata describing or defining at least in part the software artifact. The software feature metadata object can include one or more defined queries for identifying the software artifact in applications or programming code. The software feature metadata object can include one or more identifiers for composite software artifacts which integrate the software artifact corresponding to the software feature metadata object. The software feature metadata object can be accessed to obtain metadata about the corresponding software artifact for tracking usage, integration, or other activities, which can be provided for reporting or analysis.

Abstract: In an approach for detecting non-obvious relationships between entities from visual data sources, a processor calculates a co-occurrence frequency score for an entity pair from visual data. A processor calculates a distance proximity score for the entity pair from the visual data. A processor determines an event type in the visual data. A processor determines a timeline relationship in the visual data. A processor calculates a relationship score based on the co-occurrence frequency score, the distance proximity score, the event type, and the timeline relationship. A processor detects a relationship between the entity pair based on the relationship score.

Abstract: A document re-finding system generates embeddings for concept clips provided by a user, the concept clips defining a concept for searching for content of interest to the user in a plurality of documents previously seen by the user. The re-finding system determines semantic relationships between the concept and document clips, related to respective document among the plurality of documents, based on the concept embedding and embeddings generated for the document clips. A graphical user interface depicting the semantic relationships is rendered to the user and is operable to enable re-finding a document, among the plurality of documents, having the content of interest to the user.

Abstract: Disclosed are a method and a system for optimizing data storage of query statistics of a graph database. The method includes: periodically scanning, on storage servers in which partitions are located, all edges in the partitions; determining, according to all the edges in the partitions, partitions to which start points and end points belong, and calculating outgoing-edge correlation and incoming-edge correlation between partitions; calculating relevancies between partitions through a preset correlation matrix weight according to the outgoing-edge correlation and the incoming-edge correlation between partitions; and storing partitions with high relevancies on a same storage server.

Abstract: Herein are high throughput techniques for incorporating cryptographic blockchains into relational data. In an embodiment, a computer indicates, in a database dictionary in a database, that a relational table is for blockchain storage. The relational table contains application column(s). In response to that indication, the relational table is associated with system column(s) that are unmodifiable by administrators and clients of the database. The system column(s) include a cryptographic hash column. A request to store a particular value in a particular application column is received from a client. In response to receiving the request, a cryptographic hash value is calculated for a new row for the relational table. In the relational table, the computer stores the new row that contains: the particular value in the particular application column, and the cryptographic hash value in the cryptographic hash column.

Abstract: A method includes registering a type of data file. Registering the type of data file includes storing metadata describing the type of data file, the metadata including a file storage service and a parser for the type of data file. The method includes receiving a first data file of the type from a first domain, the first data file having raw data, storing the first data file, storing one or more access rules and a lineage of the first data file, parsing the first data file using the parser to generate a content from the raw data, storing the content separately from the raw data, providing the first data file and the content to a search service, and automatically updating one or more second data files from one or more other domains based on the content of the first data file using the search service and the lineage.

Abstract: Systems and methods are disclosed for determining compatibility based on one or more social values by receiving a request for the alignment of values between a user and an entity; determining values associated with the user and the entity; for each value, determining the alignment between the user value and the entity value; and generating a composite compatibility rank, the alignment score, between the user and the entity.

Abstract: Various approaches for accelerating data access to a computer memory and predicate evaluation includes storing, in the computer memory, (i) base data as multiple base columns, (ii) multiple sketched columns each corresponding to a base column in the base data and having smaller code values compared thereto, and (iii) a compression map for mapping one or more base columns to the corresponding sketched column; applying the compression map to a query having a predicate; determining data on the sketched column that satisfies the predicate; and evaluating the predicate based at least in part on the determined data on the sketched column without accessing the base column in the base data.