Data analytics systems and methods are disclosed herein. A parser can parse reference data from various data sources to store in a data structure. An uploader can receive study data designated by a researcher and store the study data in the data structure. A matcher can compare analyte nameset data in the study data with analyte nameset data from the reference data to generate one or more links each correlating an instance of an analyte in the study data with an instance of that analyte in the reference data. Library overlays each include one or more modules to access reference data to generate organized associations of reference data. A calculation engine can receive a selection of one or more library overlay(s) and manipulate the reference data and study data according to the organized associations of the selected library overlay(s) to generate configured data stored in a collection of data caches for presentation to a researcher via a user interface.

Systems and methods are directed to providing efficient and fast invocation of concurrent sheet defined functions (SDFs) including dynamic arrays by front-loading the work. At SDF creation time, a SDF cell table, a formula table, and a spill area table are generated. The SDF cell table represents cells from a worksheet that are used for the SDF. The formula table comprises an index of formulas used by the SDF, whereby index identifiers are stored in cells of the SDF cell table. The spill area table comprises an index of spill areas where each dynamic array may automatically spill into. The SDF cell table, formula table, and spill area table are shared between a plurality of invocations of the SDF during invocation time.

Systems and methods are provided herein for enabling a computing system to search and interact with service records containing natural language text to aid in the analysis of those records by: displaying in a user interface an image of a complex system; receiving, from the user interface, a high-level selection of criteria of the complex system; querying issue maps associated with individual natural language service records of a corpus of natural language service records based on the high-level selection, wherein the issue maps specify at least one term related to the complex system and a location on the complex system associated with the at least one term; and returning at least one issue map, wherein the at least one issue map returned specifies a term or location correlated to the criteria of the complex system indicated by the high-level selection.

Provided is a method including obtaining a corpus and an associated set of domain indicators. The method includes learning a set of vectors in an embedding space based on n-grams of the corpus. The method includes updating ontology graphs comprising a set of vertices and edges associating the set of vertices with each other. The method also includes determining a vector cluster using hierarchical clustering based on distances of the set of vectors with respect to each other in the embedding space and determining a hierarchy of the ontology graphs based on a set of domain indicators of a respective set of vertices corresponding to vectors of the vector cluster. The method also includes updating an index based on the ontology graphs.

The present invention is related to a method for providing dynamic indexer discovery. The method comprises receiving, from an index manager, a status indication associated with a plurality of indexers, wherein each of the plurality of indexers indexes events of raw machine-generated data received from a plurality of data collectors. The method further comprises determining a weight associated with each of the plurality of indexers and selecting an indexer from the plurality of indexers. Subsequently, the method comprises allocating data to the indexer in accordance with a respective weight assigned to the indexer and transmitting the allocated data to the indexer.

Machine data reflecting operation of a monitored system is ingested and made available for search by a data intake and query system (DIQS). Monitoring includes obtaining a subset of ordered events that are assigned to a task. In a graphical user interface on a display, a chart for the task is displayed. The chart includes an event identifier for each event of the subset of the ordered events, a confidence level value related to each event identifier of each event of the subset of ordered events, the confidence level value indicating the confidence level that the event is in the task. The chart further includes a time reference value identifying a time of each event.

A method includes extracting variable length strings from text data, associating the extracted strings with indexes in an indexing structure that maintain identifiers for instances of the strings in the text data, selecting a set of the strings having corresponding indexes whose size exceeds a threshold size value, and determining whether to merge a first index corresponding to a first string with a second index corresponding to a second string, the second string being a sub string of the first string, wherein the determination is based at least in part on a comparison of a first size of the first index and a second size of the second index. The method further includes merging the first index with the second index to create a merged index in the indexing structure responsive to the determination, and processing queries to the text data utilizing the indexing structure with the merged index.

The subject matter of this specification generally relates to preventing the distribution of forbidden network content. In one aspect, a system includes a front-end server that receives content for distribution over a data communication network. The back-end server identifies, in the query log, a set of received queries for which a given forbidden term was used to identify a search result in response to the received query even though the given forbidden term was not included in queries included in the set of received queries. The back-end server classifies, as variants of the given forbidden term, a term from one or more queries in the set of received queries that caused a search engine to use the given forbidden term to identify one or more search results in response to the one or more queries and prevents distribution of content that includes a variant.

Systems, methods, and computer-readable media for temporary reservation schemes, are provided. In embodiments, temporary reservations are inserted into non-relational datastore, and update records indicating changes to the non-relational datastore are streamed to processing nodes. The processing nodes store the update records in local expiration windows. The expiration windows are periodically polled for expired temporary reservations, which are then removed from the non-relational datastore. Other embodiments may be described and/or claimed.

Systems and methods are directed to providing efficient and fast invocation of concurrent sheet defined functions (SDFs) including dynamic arrays by front-loading the work. At SDF creation time, a SDF cell table, a formula table, and a spill area table are generated. The SDF cell table represents cells from a worksheet that are used for the SDF. The formula table comprises an index of formulas used by the SDF, whereby index identifiers are stored in cells of the SDF cell table. The spill area table comprises an index of spill areas where each dynamic array may automatically spill into. The SDF cell table, formula table, and spill area table are shared between a plurality of invocations of the SDF during invocation time.