Systems, methods, and computer-readable media for fuzzy-searches on encrypted messages include maintaining, in an indexer, a dictionary of words appearing in a message history. Upon receiving a query including at least one search term, a fuzzy search of the dictionary using the at least one search term is performed to determine one or more fuzzy-matching words in the dictionary, and one or more search tokens are generated from the one or more fuzzy-matching words, the one or more search tokens including encrypted versions of the one or more fuzzy-matching words. The one or more search tokens are provided to a search service for searching a database of encrypted messages of the message history, where the at least one search term may not have an exact match with any of the words in the dictionary.

A method performed by a computing device includes generating a first aptitude level entigen group for a first aptitude level phrase in accordance with identigen rules. The first aptitude level entigen group represents a most likely interpretation of the first aptitude level phrase. The method further includes obtaining a multiple aptitude level entigen group from a knowledge database based on the first aptitude level entigen group. The multiple aptitude level entigen group includes the first aptitude level entigen group. The method further includes generating a second aptitude level entigen group utilizing the multiple aptitude level entigen group. The method further includes generating a second aptitude level phrase based on the second aptitude level entigen group. The second aptitude level entigen group represents a most likely interpretation of the second aptitude level phrase.

Systems, methods, and computer-readable media for fuzzy-searches on encrypted messages include maintaining, in an indexer, a dictionary of words appearing in a message history. Upon receiving a query including at least one search term, a fuzzy search of the dictionary using the at least one search term is performed to determine one or more fuzzy-matching words in the dictionary, and one or more search tokens are generated from the one or more fuzzy-matching words, the one or more search tokens including encrypted versions of the one or more fuzzy-matching words. The one or more search tokens are provided to a search service for searching a database of encrypted messages of the message history, where the at least one search term may not have an exact match with any of the words in the dictionary.

Disclosed are systems and methods for generating search result data based on machine-encoded text generated by computer vision optical character recognition machine learning techniques performed on digital media. The disclosed systems and methods provide a novel framework for performing machine learning visual search or machine learning text extraction techniques on digital media in order to extract and analyze the data therein and further conduct search queries based on the extracted and analyzed data. The disclosed framework may leverage the aforementioned computer vision machine learning techniques in order to provide a user with relevant search results regarding objects and text detect in digital media captured on a user device.

Systems and methods are disclosed that provide for extracting information from a text string. In certain embodiments, a system is disclosed to receive a textual string representative of a distributed computing operation. The system is configured to isolate an identifier included in the textual string based on information in the textual string and/or other information associated with the distributed computing operation. The system is also configured to provide the identifier to a computer device over a network.

A method is executed at a computer system to retrieve data from a database. Upon receiving a database query, a database engine of the computer system parses the query to form an operator tree including a plurality of join operators. For one of the plurality of clauses, the database engine adds to the operator tree a respective node that specifies a mark join operator, a single join operator, an inner join operator, or an outer join operator. Specifically, the database engine adds the mark join operator when the clause includes one of a predetermined set of predicate subqueries, and adds the single join operator when the clause includes a scalar subquery. The database engine performs one or more optimization passes on the operator tree to form an optimized execution plan, and executes the optimized execution plan to retrieve a result set from the database.

A method executes at a computer system to retrieve data from a database. Upon receiving a database query, the computer system translates the query into an intermediate representation, and estimates a compilation time to compile the intermediate representation into machine executable code. The query execution time to retrieve a result set is also estimated. In accordance with a determination that the query execution time and compilation time satisfy an interpretation criterion, the computer system invokes a byte code interpreter to interpret the intermediate representation and retrieve the result set from the database. In accordance with a determination that the query execution and compilation times satisfy one of a plurality of compilation criteria, the computer system compiles the intermediate representation to form machine code and executes the machine code to retrieve the result set from the database. In some cases, the query intermediate representation is optimized prior to compilation.

In some examples, workflow-based dynamic data model and application generation may include ascertaining, for an application that is to be generated, a plurality of fields that are declared. Based on the plurality of declared fields, a data model may be generated. The data model may include a plurality of application programming interface (API) keys associated with the plurality of declared fields. Based on the data model, a mapping file may be generated to map a plurality of APIs that are to be invoked relative to the API keys. Based on the data model and the mapping file, the application may be generated.

A method for obtaining query response data by a relational database management system (RDBMS) is provided. The method receives a user input query, by a processor associated with the RDBMS, wherein the user input query comprises a query request for a set of data; formats the user input query into a second query language suitable for communication between the RDBMS and a query response interface associated with a second data storage external to the RDBMS, by the processor, to generate a reformatted user input query, wherein the RDBMS is configured to perform query operations using an n-ary tree format, and wherein the query response interface is configured to perform query operations using a binary tree format consisting of two child nodes per non-terminal node of a binary tree; and transmits the reformatted user input query to the query response interface, via a communication device communicatively coupled to the processor.

A computer-implemented method, medium, and system are disclosed. In one computer-implemented method, an invocation request sent by an initiator is received by a blockchain node in a blockchain network. The invocation request is associated with invocation of a smart contract in the blockchain network. The smart contract includes contract code, data, and pre-update metadata. A pre-update data structure described by the pre-update metadata is parsed by the blockchain node and by execution of the contract code. The pre-update data structure is associated with the data comprised in the smart contract. Following parsing of the pre-update data structure, the pre-update data structure is represented by the blockchain node using a computer programming language. The pre-update data structure specified by the computer programming language is sent by the blockchain node to the initiator.