Abstract: The present disclosure involves systems, software, and computer implemented methods for using worst-case predicate selectivity for database query plans. One example method includes identifying a query that includes an initial set of parameter values for a set of predicates. An order of predicate evaluation is determined for a query plan by determining a worst-case selectivity for each predicate and ordering the predicates based on the worst-case selectivities. A second instance of the query is received that includes a second set of parameter values. The second instance of the query is executed, to generate a query result, using the query plan and the second set of parameters by evaluating the set of predicates based on the second set of parameters and the order of predicate evaluation determined based on the worst-case selectivities. The query result is provided in response to the second instance of the query.

Abstract: Systems and methods receive control signal(s) representing a UI input provided via an actionable GUI input component depicted via a GUI of a computer screen, the UI input indicating the user's need for an entity object, accessible via an entity, to be personalized for the user. Stored user data of the user stored to data storage location(s) is accessed that includes both attribute data associated with the user and resource data associated with a resource currently possessed by the user. Data analysis is performed on entity objects each having object attributes, the data analysis including evaluating the object attributes relative stored user data, identifying entity objects available to the user, and ranking the entity objects. Interactive UI input components associated with entity object content are generated and display, via the GUI, is initiated, the entity object content including a selection of ranked entity objects available to the user.

Abstract: A computer-implemented method for identifying a leaf in a tree is provided. A processor set receives a first point representing one or more values within a d-dimensional space for identifying the leaf in the tree. The processor set generates a parameter for identifying the leaf in the tree. The processor set identifies a node at highest depth of the tree. The processor set determines a first value of the parameter for generating a range. The processor set selects a subset of child nodes from the number of child nodes associated with the node at the highest depth of the tree based on the range. The processor sets the subset of child nodes as the node at the highest depth of the tree. The processor set traverses the tree by repeating the identifying step, the determining step, the selecting step, and setting steps until the leaf in the tree is identified.

Abstract: Methods, systems, and apparatus, for associating actions with events that are determined independent of the action type of the action. A system receives, from a user device, identification of an action to be taken, the action being one of a plurality of action types, and an identification of a first event that is determined independent of the action type and for which the occurrence of the first event may be determined by the system. They system associates the action and the first event with instructions for determining if the first event has occurred, and then determines whether the first event has occurred. In response to determining that the first event has occurred, the system causes the action to occur.

Abstract: A system for enabling granular access control over ontology data and related methods are disclosed. The system is programmed to receive data source updates from data sources having respective sets of permissions for access control, transform the data source updates to changes to an ontology, and control access to the ontology based on the sets of permissions. The system is further programmed to receive a specification of one or more rules referencing attributes of user accounts or properties of ontology entities and corresponding one or more lists of permissions. The system is programmed to then enforce a security policy based on the specification to further control access to the ontology.

Abstract: A system, computer readable storage medium, and computer-implemented method presents video search results responsive to a user keyword query. The video hosting system uses a machine learning process to learn a feature-keyword model associating features of media content from a labeled training dataset with keywords descriptive of their content. The system uses the learned model to provide video search results relevant to a keyword query based on features found in the videos. Furthermore, the system determines and presents one or more thumbnail images representative of the video using the learned model.

Abstract: A hybrid transactional/analytical processing (HTAP) database includes an online transaction processing (OLTP) engine, an online analytical processing (OLAP) engine provided separately from the OLTP engine, and a shared storage holding data of multiple tenants. The shared storage is configured to receive a request from the OLAP engine for evaluation of a predicate against the data stored on the shared storage. The shared storage is further configured to determine that a CPU utilization of the shared storage exceeds a predicate refusal threshold. Upon determining that the CPU utilization of the shared storage exceeds the predicate refusal threshold, the shared storage is further configured to refrain from evaluating at least a portion of the predicate.

Abstract: A method for practicing precision medicine comprising providing, to a blockchain platform, each of clinical data and genetic data, providing the blockchain platform, the blockchain platform having a first data structure comprising clinical data and a second data structure comprising genetic data, harmonizing the first and second data structures, creating at least one cohort based on the harmonized first and second data structures, and identifying at least one relationship between the clinical data and the genetic data in each of the at least one cohort.

Abstract: Methods and apparatuses for dynamically generating and applying automated search evaluation sets to improve search results and to automatically detect and correct search system issues are described. A search evaluation set may comprise a set of search evaluation vectors that each map a search query and corresponding properties of the search query to a canonical search result. To detect search system issues over time, baseline search result rankings may be periodically generated or automatically generated after software updates to the search system have been made. Two consecutive baseline search result rankings using the same search evaluation set may then be compared to detect result deviations in search result rankings. If the search system detects that at least a threshold number of result deviations have occurred, then the search system may perform subsequent actions to automatically detect and correct search system issues.

Abstract: A database system is operable to communicate first system metadata to a plurality of nodes in a first temporal period, where each node of the plurality of nodes updates corresponding system configuration data as the first system metadata. At least one database function is performed in the first temporal period via the plurality of nodes operating in conjunction with the first system metadata. Updated system metadata is determined based on a first metadata change applied the first system metadata. The first metadata change is communicated to the plurality of nodes in a second temporal period, where each node further updates the corresponding system configuration data as the updated system metadata based on applying the first metadata change to the first system metadata. The at least one database function is performed in the second temporal period via the plurality of nodes operating in conjunction with the updated system metadata.

Abstract: Systems, devices and automated processes are described for automated enhancement of metadata in a database of information about movies, television shows or other media programs. Gaps or errors in metadata describing the different programs in the database can be corrected using a digital architecture in which one or more sources are queried for missing information. Queries may be directed toward a large language model (LLM) or other artificial intelligence (AI) engine, if desired.

Abstract: Methods and systems for clustering documents according to semantic similarity are disclosed. The method includes generating an embedding for each of a plurality of documents to form a plurality of embeddings. Each embedding is indicative of a semantic representation for the corresponding document. The method includes segregating the plurality of embeddings into a plurality of shards. The method includes clustering one or more embeddings within each shard of the plurality of shards into the one or more first clusters. The one or more first clusters for each shard collectively constitute a plurality of first clusters. The method includes generating a plurality of second clusters across the plurality of shards, based, at least in part, on semantic similarity between the plurality of embeddings and the plurality of first clusters.

Abstract: A system, method, and device for managing updates to a hypercube is provided. The method includes (i) obtaining a tree data structure to represent the data, (ii) receiving a request to change the N-conjoined tree data structure, (iii) enforcing a rule that requires each leaf node to have an associated linkage to each tree in the N-conjoined tree data structure while changing the N-conjoined tree data structure in accordance with the request, and (iv) providing an updated N-conjoined tree data structure. The tree data structure is an N-conjoined tree data structure, and N is a positive integer.

Abstract: A computer-implemented method is disclosed for storing source data related to targeted and untargeted tenants on several publishing servers. The method includes sending metadata related to a first part of the source data related to the targeted tenants from the publishing servers to an aggregating server and storing the metadata in a first database including metadata segments arranged in a first sequenced array and having corresponding state-indicating cursors arranged in a second sequenced array beginning with a first cursor and ending with a last cursor. The method also includes storing the second sequenced array on a second database, querying the first cursor of the second sequenced array from a subscribing server including targeted data related to at least a part of the tenants, querying the metadata segment corresponding to the first cursor, and performing a predetermined operation on at least a part of the targeted data.

Abstract: A system uses a contextual bandit model for query processing. The system receives, from a client device, a user query for identifying one or more items by the system. The user query is described by one or more query features. The system obtains one or more contextual features describing a context of the user query. The system applies a contextual bandit model to the query features and the contextual features to select a query processing model from a plurality of query processing models. The system applies the selected query processing model to the user query to obtain query results. The system transmits the query results for display on the client device.

Abstract: The present disclosure is directed toward systems, methods, and non-transitory computer-readable media for performing a data search for a search request by utilizing a directed acyclic graph. For example, the disclosed systems receive a search request at a search engine of a content management system. In addition, the disclosed systems determine (e.g., in response to the search request) a node path from a directed acyclic graph that includes a plurality of interconnected nodes defining computer operations. Further, the determined node path includes a set of nodes that corresponds to the search request. Moreover, the disclosed systems perform the data search for the search request by executing operations defined by nodes along the node path within the directed acyclic graph.

Abstract: Techniques are described herein for determining an information gain score for one or more documents of interest to the user and present information from the documents based on the information gain score. An information gain score for a given document is indicative of additional information that is included in the document beyond information contained in documents that were previously viewed by the user. In some implementations, the information gain score may be determined for one or more documents by applying data from the documents across a machine learning model to generate an information gain score. Based on the information gain scores of a set of documents, the documents can be provided to the user in a manner that reflects the likely information gain that can be attained by the user if the user were to view the documents.

Abstract: Systems and methods for multimodal query suggestion can include obtaining image data, determining text strings associated with the image data, and providing the text strings as selectable options for performing a multimodal query with the image data. The text strings can be determined based on performing object detection and classification on the image data. The object classifications can then be leveraged for determining potential text queries a user may select for obtaining additional information about the classified object.

Abstract: Automatically recommending appropriate foundation models is provided. A list of recommended foundation models, along with a corresponding ranking for each respective foundation model in the list is generated based on a corresponding attribute matching score and a justification for the corresponding ranking of each respective foundation model. The list of the recommended foundation models, along with the corresponding ranking for each respective foundation model in the list and the justification for the corresponding ranking of each respective foundation model is sent to a user. Feedback is received from the user regarding accuracy of a user-selected foundation model from the list of the recommended foundation models. The user-selected foundation model is adjusted based on the feedback received from the user regarding the accuracy of the user-selected foundation model from the list of the recommended foundation models.

Abstract: A method includes receiving, by a logic layer processor, over a communication network, from a plurality of electronic resources, initial user personal identifiable information (PII) of a user of a plurality of users. The user PII includes a plurality of data elements. The plurality of data elements of the initial PII of the user are classified to populate a profile map data structure having a standardized predefined data schema of a plurality of vector elements so as to form a user-specific profile map data structure of the user. Additional user personal identifiable information (PII) of the user is iteratively received from the plurality of electronic resources. The additional user PII of the user is iteratively classified to update the user-specific profile map data structure of the user. A plurality of user-specific data management software functions is enabled based on the user-specific profile map data structure.