Abstract: A method includes determining a query request corresponding to a requesting entity. Query cost data is generated for the query request. Minimum query cost compliance data is generated for the query request based on the query cost data. A query result is for the query request is determined based on execution of the query request against a database system and the query result is transmitted to the requesting entity when the minimum query cost compliance data indicates the potential query cost data complies with the minimum query cost rule.

Abstract: Systems and methods for a bouncing replication protocol are described herein. The system can include a replication cluster including a plurality of servers and a master controller that can receive a first request to replicate a first transaction and execute a batching process to replicate the first transaction. The batching process can include selecting a first server for replication of the first transaction, determining that a pending acknowledgement from the selected first server has not been identified, adding the first transaction to a first batch for the first server, and sending the first batch including only the first transaction.

Abstract: Disclosed herein are embodiments of systems, methods, and products comprises a server, which provides trigger-based personalized sales outreach based on a user's request. The request comprises a list of target companies/people. The server scans a variety of sources by web crawling the sources' web documents and finds news items relevant to the target companies/people. The server determines an importance score for each news item that measures the probability of a sales representative being interested in the news item. The server applies a set of filters comprising a network of neural networks to filter out false positives. The analytic server determines a relevancy score for each news item. The server generates a GUI to display the news items satisfying certain thresholds. Based on the user's selection on the news items, the server uses the news items as triggers of outreach and generates an electronic message template prepopulated with the news items.

Abstract: A data operations system receives compressed data and a search term. The data operations system completes a modified decoding of the compressed data, resulting in distinguishable data terms that are smaller than the corresponding data terms, and loads modified decoded terms into a data register. The data operations system generates a truncated search term and loads instances of the truncated search term into a query register. The data operations system performs a parallel data operation, such as a query operation, by comparing each of the modified decoded terms to an instance of the truncated search term. The data operations system returns the results of the operation.

Abstract: A pictogram repository is created of pictograms including expressions that are mapped to at least a portion of source code that is stored in a separate source code repository. A score is recorded for developers for the source code that is stored in the source code repository. A source code search inquiry of at least one pictograms for search query elements is conducted, in which the at least one pictogram for the search query elements are matched to the pictograms in the repository of pictograms that includes expressions that are mapped to at least a portion of source code that is stored in the separate source code repository. Matching source code have the score for their developer checked against a threshold value. Source code meeting the search query elements and having a score for their developer meeting the threshold value are retrieved.

Abstract: Apparatus and methods for reconciling data in a big data environment is provided. Methods may receive a first data set and a second data set for reconciliation. Methods may identify a first set of metadata associated with the first data set. Methods may identify a second set of metadata associated with the second data set. Methods may include a data reconciliation algorithm. The algorithm may compare the first set of metadata to the second set of metadata to obtain a subset of data found within the first data set and a subset of data found within the second data set that are joinable. Methods may dynamically construct one or more SQL queries to identify any discrepancies between the first data set and the second data set. Methods may execute the one or more SQL queries that identify any discrepancies between the first data set and the second data set.

Abstract: Methods of and systems for searching a catalog include parsing the items of the catalog into tokens, determining the frequency with which each token appears in the catalog, and storing the frequencies in a cache. Queries to the catalog are likewise parsed into tokens, and the tokens of the query string are compared to frequency values in the cache to identify a smaller search space within the catalog.

Abstract: A system for measuring similarity between a binary query vector and a plurality of binary candidate vectors includes a storage unit and a processor. The storage unit stores the binary query vector and the plurality of candidate vectors, and the processor performs Tanimoto calculations in terms of Hamming distances. The processor includes a Tanimoto to Hamming threshold converter, a Hamming measurer, and a Hamming comparator. The Tanimoto to Hamming threshold converter converts a Tanimoto threshold into a Hamming threshold. The Hamming measurer measures the Hamming distances between the candidate vectors and the query vector. The Hamming comparator selects candidate vectors whose Hamming distance from the query vector is less than or equal to the Hamming threshold.

Abstract: A query processing system operates by determining a query pricing scheme; receiving a query request from a requesting entity that indicates access to a subset of a plurality of records in a database system; generating query cost data based on the subset of the plurality of records by utilizing the query pricing scheme; and transmitting the query cost data to the requesting entity.

Abstract: A system for managing documents, comprising: interfaces to a user interface, proving an application programming interface, a database of document images, a remote server, configured to communicate a text representation of the document from the optical character recognition engine to the report server, and to receive from the remote server a classification of the document; and logic configured to receive commands from the user interface, and to apply the classifications received from the remote server to the document images through the interface to the database. A corresponding method is also provided.

Abstract: Techniques are provided for managing objects within an object store. An object is maintained within an object store. The object is used to store data of a snapshot of a file system hosted by a remote computing device. A determination is made that the snapshot was deleted by the remote computing device. Bitmaps describing objects within the object store that are related to snapshots of the file system are evaluated to determine that the object is unique to the deleted snapshot. The object is freed from storage within the object store.

Abstract: A method for classifying a digital asset, comprising: retrieving from a repository, according to an initial identifier, a digital asset; computing at least one asset score, each indicative of a degree of confidence that the digital asset has a respective offense classification selected from a plurality of offense classifications; subject to the at least one asset score being less than at least one threshold score: adding to a list of identifiers at least one identifier extracted from the digital asset; and in each of at least one iteration: retrieving from the repository at least one other digital asset, according to at least one selected identifier selected from the list of identifiers; computing a plurality of other asset scores, each associated with one other digital asset of the at least one other digital asset and indicative of another degree of confidence that the other digital asset has another respective offense classification.

Abstract: The present disclosure provides a method, system and computer program product for optimal query scheduling for resource utilization option. In an embodiment of the disclosure, a process for optimal query scheduling includes receiving in an information retrieval data processing system at a contemporaneous time, a request for deferred query execution of a specified query to a future time after the contemporaneous time. The method additionally includes determining a frequency of change of data corresponding to a field referenced in the specified query. Then, on condition that the frequency of change is below a threshold value, an intermediate time prior to the future time but after the contemporaneous time can be identified and the specified query scheduled for execution at the intermediate time instead of the future time. But, otherwise the specified query can be scheduled at the future time as originally requested.

Abstract: Systems, apparatuses, methods, and computer program products are disclosed for post-quantum cryptography (PQC). An example method includes receiving data. The example method further includes generating a set of data attributes about the data. The example method further includes generating a data envelope based on the set of data attributes. Subsequently, the example method includes generating an enveloped data structure based on the data envelope and the data.

Abstract: A new transaction set is compared to a plurality of transaction sets represented in a Compressed Frequent Item Set (CFIS), wherein the CFIS maintains a count for each transaction set represented in the CFIS. When the new transaction set matches a transaction set represented in the CFIS, the count for the matching transaction set in the CFIS is incremented. When the new transaction set does not match any transaction sets represented in the CFIS, the new transaction set is added to the CFIS. If there are intersections between two or more events of the new transaction set and the events of the plurality of transaction sets represented in the CFIS, the count for the transaction sets in the CFIS that intersect with two or more of the events of the new transaction set is incremented.

Abstract: The disclosed computer-implemented method for backing-up an eventually-consistent database in a production cluster may include (1) forming, on a production node, a stable copy of production data, (2) provisioning storage on a backup node based on an amount of data in the stable copy and a replication factor, (3) transferring information from the stable copy to a backup copy on the backup node, (4) performing record synthesis on the backup copy to merge record updates into complete backup records, (5) identifying and discarding any stale records and any redundant records in the complete backup records, and (6) transferring the complete backup records from the backup node to a cloud storage device. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Methods of operating a search engine may include calculating multi-modal document vector models for each of a plurality of electronic documents, training category-specific, search query-specific ranking models with respective machine learning algorithms based on those document vector models, and applying each of those models to further instances of the same search query to rank the documents responsive to that search query.

Abstract: Described herein is a computer implemented method, a computer processing system, and a non-transitory computer-readable storage medium. The method includes displaying a first set of media item representations in a media item order in an initial media selection interface. While the initial media selection interface is displayed, the method further comprises detecting a display complete media set at reference input and, in response: determining a reference media item representation and displaying a complete media selection interface in a first initial display state which is based on the reference media item representation.

Abstract: Interactive assistances for executing natural language queries to data sets may be performed. A natural language query may be received. Candidate entity linkages may be determined between an entity recognized in the natural language query and columns in data sets. The candidate linkages may be ranked according to confidence scores which may be evaluated to detect ambiguity for an entity linkage. Candidate entity linkages may be provided to a user via an interface to select an entity linkage to use as part of completing the natural language query.

Abstract: A method for generating recommendations involves selecting a first platform message, making a first determination that the first platform message is potentially associated with a plurality of topics including a first topic and a second topic, obtaining additional information associated with the first platform message including at least one of information about an account that authored the first platform message and information about third party accounts engaging with the first platform message, making a second determining that the first platform message is associated with the first topic using the plurality of topics and at least a portion of the additional information, wherein the first topic is an initial classification of the first platform message, generating a recommendation for at least one account based on the second determination, and providing the recommendation to at least one account.