Abstract: Techniques for presenting a search result with an improved user interface. A computer system can receive, from a user device, a request for a content item. Additionally, the system can select, based on the request, a first content item from a plurality of content items. The first content item can be associated with an organization image and an organization name of an organization. Moreover, the system can process, using one or more machine-learned model, the organization image to determine whether the organization image is acceptable to be presented in the search result. Subsequently, the system can transmit, to the user device, the first content item and the organization image to be presented in the search result.

Abstract: Various embodiments of a hierarchical system or method of identifying sensitive content in data is described. In some embodiments, sensitive data classifiers local to a data storage system can analyze a plurality of data items and classify at least some data items as potentially containing sensitive data. The sensitive data classifiers can provide the classified data items to a separate sensitive data discovery component. The sensitive data discovery component can, in some embodiments, obtain the classified data items, perform a sensitive data location analysis on the classified data items to identify a location of sensitive data within some of the classified data items, and generate location information for the sensitive data within the data items containing sensitive data. The sensitive data discovery component can provide to a destination this information, in some embodiments, where the destination might redact, tokenize, highlight, or perform other actions on the located sensitive data.

Abstract: Methods, systems, and computer-readable media for lifecycle management for customized natural language processing are disclosed. A natural language processing (NLP) customization service determines a task definition associated with an NLP model based (at least in part) on user input. The task definition comprises an indication of one or more tasks to be implemented using the NLP model and one or more requirements associated with use of the NLP model. The service determines the NLP model based (at least in part) on the task definition. The service trains the NLP model. The NLP model is used to perform inference for a plurality of input documents. The inference outputs a plurality of predictions based (at least in part) on the input documents. Inference data is collected based (at least in part) on the inference. The service generates a retrained NLP model based (at least in part) on the inference data.

Abstract: Methods, systems, and computer-readable media for context-sensitive linking of entities to private databases are disclosed. An entity linking service stores a plurality of representations of entities. Individual ones of the entities correspond to individual ones of a plurality of records in one or more private databases. The entity linking service determines a mention of an entity in a document. The entity linking service selects, from the plurality of records in the one or more private databases, a record corresponding to the entity. The record is selected based at least in part on the plurality of representations of the entities and based at least in part on a context of the mention of the entity in the document. The entity linking service generates output comprising a reference to the selected record in the one or more private databases.

Abstract: A method, computer system, and a computer program product for transforming a scalar sub-query to join with non-provable singleton output, responsive to receiving a parsed representation of a statement, containing a scalar operation, which is correlated to predetermined types of objects, by analyzing the parsed representation to determine eligibility for transformation of any scalar operations. Responsive to a determination of eligibility, a query engine injects additional processing into the parsed representation to defer checking of a 1 row condition required by statement semantics. The query engine further injects processing to utilize a result of the additional processing to validate a single row is produced for each GROUPING/PARTITION key. The parsed representation is modified to remove the 1 row condition. The query engine decorrelates the parsed representation using a predetermined method absent a requirement for a unique key to be present in a predicate of the scalar operation.

Abstract: A method for transforming a scalar sub-query to join with non-provable singleton output, responsive to receiving a parsed representation of a statement, containing a scalar operation, which is correlated to predetermined types of objects, by analyzing the parsed representation to determine eligibility for transformation of any scalar operations. Responsive to a determination of eligibility, a query engine injects additional processing into the parsed representation to defer checking of a 1 row condition required by statement semantics. The query engine further injects processing to utilize a result of the additional processing to validate a single row is produced for each GROUPING/PARTITION key. The parsed representation is modified to remove the 1 row condition. The query engine decorrelates the parsed representation using a predetermined method absent a requirement for a unique key to be present in a predicate of the scalar operation.

Abstract: A method for transforming a scalar sub-query to join with non-provable singleton output, responsive to receiving a parsed representation of a statement, containing a scalar operation, which is correlated to predetermined types of objects, by analyzing the parsed representation to determine eligibility for transformation of any scalar operations. Responsive to a determination of eligibility, a query engine injects additional processing into the parsed representation to defer checking of a 1 row condition required by statement semantics. The query engine further injects processing to utilize a result of the additional processing to validate a single row is produced for each GROUPING/PARTITION key. The parsed representation is modified to remove the 1 row condition. The query engine decorrelates the parsed representation using a predetermined method absent a requirement for a unique key to be present in a predicate of the scalar operation.

Abstract: A method, computer system, and a computer program product for transforming a scalar sub-query to join with non-provable singleton output, responsive to receiving a parsed representation of a statement, containing a scalar operation, which is correlated to predetermined types of objects, by analyzing the parsed representation to determine eligibility for transformation of any scalar operations. Responsive to a determination of eligibility, a query engine injects additional processing into the parsed representation to defer checking of a 1row condition required by statement semantics. The query engine further injects processing to utilize a result of the additional processing to validate a single row is produced for each GROUPING/PARTITION key. The parsed representation is modified to remove the 1 row condition. The query engine decorrelates the parsed representation using a predetermined method absent a requirement for a unique key to be present in a predicate of the scalar operation.

Abstract: Although many techniques provide ways to answer queries very quickly by either avoiding joins and/or aggregation or avoiding expression computations in order to apply filtering predicates, these techniques have significant potential overhead for maintenance, and require a great deal of storage space. The present invention discloses the use of synopsis or zone tables to expressions to provide powerful filtering capabilities to base tables across joins, and aggregations on join results, thus allowing for highly effective region or stride filtering and ordering aggregate ranges to select the most likely candidate tuples for joining to produce top-N or bottom-N result sets for queries.

Abstract: Although many techniques provide ways to answer queries very quickly by either avoiding joins and/or aggregation or avoiding expression computations in order to apply filtering predicates, these techniques have significant potential overhead for maintenance, and require a great deal of storage space. The present invention discloses the use of synopsis or zone tables to expressions to provide powerful filtering capabilities to base tables across joins, and aggregations on join results, thus allowing for highly effective region or stride filtering and ordering aggregate ranges to select the most likely candidate tuples for joining to produce top-N or bottom-N result sets for queries.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: Although many techniques provide ways to answer queries very quickly by either avoiding joins and/or aggregation or avoiding expression computations in order to apply filtering predicates, these techniques have significant potential overhead for maintenance, and require a great deal of storage space. The present invention discloses the use of synopsis or zone tables to expressions to provide powerful filtering capabilities to base tables across joins, and aggregations on join results, thus allowing for highly effective region or stride filtering and ordering aggregate ranges to select the most likely candidate tuples for joining to produce top-N or bottom-N result sets for queries.

Abstract: Although many techniques provide ways to answer queries very quickly by either avoiding joins and/or aggregation or avoiding expression computations in order to apply filtering predicates, these techniques have significant potential overhead for maintenance, and require a great deal of storage space. The present invention discloses the use of synopsis or zone tables to expressions to provide powerful filtering capabilities to base tables across joins, and aggregations on join results, thus allowing for highly effective region or stride filtering and ordering aggregate ranges to select the most likely candidate tuples for joining to produce top-N or bottom-N result sets for queries.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: The present invention provides systems and methods for real-time cellular to Internet video transfer during a voice call between an initiator and a recipient handset. In some embodiments, the systems and methods deliver the video stream in real-time from a cellular phone to a personal computer using the Internet.

Abstract: The present invention provides systems and methods for real-time cellular to Internet video transfer during a voice call between an initiator and a recipient handset. In some embodiments, the systems and methods deliver the video stream in real-time from a cellular phone to a personal computer using the Internet.