Abstract: In an example embodiment, a solution is provided that aggregates records as they are submitted to a third party (on the write path) rather than performing a real-time aggregation when a request is processed that needs the aggregation (read path). More particularly, in an example embodiment, a caching layer is introduced that avoids having to read all usage events to compute an aggregation when a request is received for aggregated data. The caching layer maintains values for various metrics that require aggregation.

Abstract: Systems and methods including one or more processors and one or more non-transitory media storing computing instructions that, when executed on the one or more processors, cause the one or more processors to perform: storing one or more notifications in a data store; receiving a new notification; determining a respective number of notifications in each respective segment of a plurality of approximately equal segments; using the respective number of notifications in each respective segment of the plurality of approximately equal segments to determine a number of the one or more notifications; when the number of the one or more notifications is equal to or greater than a maximum number of notifications, removing at least one notification of the one or more notifications; and before or after removing the at least one notification, storing the new notification in the data store.

Abstract: Implementations relate to providing search suggestions on a collaboration platform. In some implementations, a method includes generating a dictionary of terms comprising terms associated with games of the collaboration platform by identifying a set of the games that have a frequency of play that meets a threshold frequency and identifying a plurality of search terms associated with previous search queries of the collaboration platform. The method further includes comparing the plurality of search terms with the dictionary of terms, identifying a first set of the search terms that are candidate search terms and a second set of the search terms that are search suggestions, and generating a record that associates candidate search terms of the first set of the search terms with respective search suggestions wherein the record is used to provide a suggestion for one or more new search terms of a new search query.

Abstract: The disclosed systems and methods include operations for: storing, by one or more processors, a plurality of content items in association with a content item generation template, each of the plurality of content items having been previously generated by a respective user of a plurality of users of a messaging application in accordance with instructions associated with the content item generation template; ranking the plurality of content items associated with the content item generation template; receiving input that selects an identifier of the content item generation template; and displaying the ranked plurality of content items to a given user of the messaging application in response to receiving the input.

Abstract: Systems and methods for creating digital interactive metadata elements in a social media composition may include (1) providing, to a user of a social media application, a composition interface for creating digital social media compositions, (2) collecting, via the composition interface, user-generated content and metadata information, (3) creating, based on the user-generated content and the metadata information, a social media composition that includes the user-generated content and an interactive metadata item, and (4) posting the social media composition to a consumption channel (e.g., a newsfeed channel and/or a stories channel) of a social-networking platform associated with the social media application. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Various embodiments can implement a multi-system or node architecture that can be deployed on-demand and augment existing systems with pre-configured nodes that can be installed within existing architecture. The multi-node architecture is flexible for integration into many systems and can also stand alone to provide data validation and assurance. Various embodiments of the multi-node architecture enable private and public distributed ledgers (e.g., blockchains) that enhance security, enhance confidentiality, and eliminate the need to trust the provider/hosts of the data validation information and/or the hosts of the confidential information.

Abstract: A system stores original datasets in a datastore. The system generates first derivative datasets from the original datasets, and generates second derivative datasets from at least the first derivative datasets. The system determines relationships among the original datasets, the first derivative datasets, and the second derivative datasets, based on an analytical relationship between two datasets, a similarity relationship between two datasets, a modification relationship between two datasets, and a user-interaction relationship between two datasets. Then, the system generates a node map including at least part of the original datasets, the first derivative datasets, and the second derivative datasets as a node, and at least part of the determined analytical, similarity, modification, and user-interaction relationships between two nodes as a link.

Abstract: A process includes accessing a query that is associated with joining a fact table with a plurality of dimension tables. The fact table includes a primary key that includes a set of columns, which are covered by the dimension tables. The process includes determining a query plan for processing the query. The query plan has an associated join order. Determining the query plan includes determining a plurality of sets of the plurality of dimension tables, where each set includes dimension tables, which cover the set of columns of the primary key. Determining the query plan includes evaluating costs that are associated with joining subsets of the plurality of sets with the fact table. Based on the costs, a given subset of the plurality of subsets is selected. Determining the query plan includes constraining the join order based on the given subset so that the dimension tables of the given subset are joined before the fact table.

Abstract: A primary query engine may receive a query and determine whether the query is eligible for performance at a secondary query engine. If eligible, the primary query engine may evaluate the availability of the first query engine to perform the query. The first query engine may determine whether to assign the query to the primary query engine or to the secondary query according to availability evaluation. For queries assigned to the secondary query engine, the primary query engine may send a request to the secondary query engine to being processing of the query.

Abstract: A computer system receives a set of messages, and processes the messages using a filter. In some examples, the filter is defined using a pattern matching language such as a regular expression. The system collects a set of representative messages that match the filter. Using the set of representative messages, the system generates a corresponding flow network graph. Using the flow network graph, the system determines a similarity measure that indicates whether a new message resembles other matching messages of the filter. Based on the similarity measure, in various embodiments, the system identifies potential errors in the filter definitions, omissions in the terms of the filter, and message outliers that indicate system anomalies or events of particular interest to the user.

Abstract: A method, system and computer program product for improving the discoverability of messages on a social network. The creation of a proposed message that requests a response from a target audience is detected. The social network is then searched to identify search terms and posts related to the proposed message. Upon identifying the search terms, the search terms are ranked in order of usage among the identified posts. A list of identified search terms in order of rank is then presented to the user to modify the proposed message. The proposed message is modified using a search term selected by the user from the list of search terms. The modified message is then posted on the social network. In this manner, the message created by the user has been modified to improve the discoverability of the message on the social network and to increase responses from an appropriate target audience.

Abstract: An example operation may include one or more of receiving a set of structured query language (SQL) queries from one or more software applications, generating a set of SQL syntax trees that correspond to the set of SQL queries, identifying a unique subset of SQL syntax trees among the generated set of SQL syntax trees based on previously obtained SQL syntax trees, and transmitting the unique subset of SQL syntax trees to a computing system.

Abstract: A system for generating similarity data for different datasets in a cloud data platform. A first dataset of a plurality of datasets on the cloud data platform is identified, where the first dataset is associated with a first user of the cloud data platform. A semantic type for each feature the first dataset is identified, and each semantic type for the first dataset is compared with existing data of the first user. Semantic types for each feature of each dataset are identified, and each semantic type for the first dataset is compared to each semantic type of each dataset. Overlap requests are generated to output overlap datasets between the first dataset and each of the plurality of datasets. A results dataset is generated by applying the overlap requests to a joined dataset comprising data from the first dataset and data from each of the plurality of datasets.

Abstract: In an embodiment, a data processing method comprises, using a distributed database system that is programmed to manage a plurality of different raw datasets and a plurality of derived datasets that have been derived from the raw datasets based on a plurality of derivation relationships that link the raw datasets to the derived datasets: from a first dataset that is stored in the distributed database system, determining a subset of records that are candidates for propagated deletion of specified data values; determining one or more particular raw datasets that contain the subset of records; deleting the specified data values from the particular raw datasets; based on the plurality of derivation relationships and the particular raw datasets, identifying one or more particular derived datasets that have been derived from the particular raw datasets; generating and executing a build of the one or more particular derived datasets to result in creating and storing the one or more particular derived datasets without

Abstract: A syndicated-content recognition system retrieves, from at least one database, media broadcast files broadcast by a plurality of media broadcast sources, wherein individual media broadcast files are associated with stations, days of the week, and times. Based on historical data associated with the media broadcast files, the system determines whether a particular media broadcast file associated with a particular station and a particular time is likely to include syndicated content. In response to determining that the particular media broadcast file is likely to include syndicated content the particular media broadcast file is tagged to generate a tagged media broadcast file, and the tagged media broadcast file is exempted from syndicated-content-comparisons with other media broadcast files.

Abstract: Continuous data protection, including sending, to a target data repository from a source data repository, metadata describing one or more updates to one or more datasets stored within the source data repository; generating, based on the metadata describing the one or more updates to the one or more datasets, an ordered log of metadata describing an ordered application of the one or more updates to the one or more datasets; and generating, on the source data repository and based on the ordered log of metadata, the one or more datasets in accordance with the one or more updates corresponding to a specified point in time.

Abstract: Systems and methods include presenting search results from multiple sources by grouping the results from some of the multiple sources, ranking each of the multiple sources and groups of sources, and not presenting duplicate results 5 from lower ranked sources. In this way, the user is provided with search results that are distinct as opposed to presenting the same result multiple times when it is available from different sources.

Abstract: A request may be received from a user through a user interface an issued independent claim of a patent may be automatically compared to a pre-allowance published independent claim of an application of the patent to identify a unique keyword present in the issued independent claim but not present in the pre-allowance published independent claim. The unique keyword may be flagged to the user by highlighting the unique keyword in the user interface. A first prior art document may be retrieved using the flagged unique keyword. A unique keyword overlap score may be calculated for the first prior art document based on occurrences of the unique keyword in the first prior art document. A graphical representation of an identity of the first prior art document, the unique keyword, and the unique keyword overlap score may be generated for display in the user interface. The graphical representation may be displayed along with a graphical timeline based on a priority date of the first prior art document.

Abstract: A data intake and query system executes a search query at a first execution time for querying events having associated time stamps within a first time period characterized by a first start time and a first end time. The first start time is computed based upon a time indicated by reference time information stored prior to execution of the search query. The system determines whether execution of the search query completed successfully based upon a first search result obtained from executing the search query. If the first execution of the search query was not successful, the system computes for a second execution of the search query after the first execution, a second time period using the reference time information. The second execution is configured to query events with associated timestamps that fall within a second time period that includes the first time period and an additional time period.

Abstract: Aspects of the disclosure are directed to generating a hybrid query execution plan for executing queries on database systems implementing a columnar cache. A hybrid query execution plan combines a query execution plan for querying and retrieving data from a columnar cache and a base table. A columnar cache stores cached data in column-major format, which is logically represented by the database management system in row-major format. A database management system as described herein can scan valid blocks of column data according to a column scan operation. The system can identify invalidated blocks and execute a different sub-execution plan of the hybrid query execution plan to scan corresponding rows in tables corresponding to the location of data for the invalidated blocks.