Abstract: A question answering (QA) system comprising memory for storing instructions, and a processor configured to execute the instructions to ingest source documents that include structured data and unstructured data to create a knowledge base, wherein the unstructured data includes table data; create table annotations to represent the table data; store the ingested structured data, unstructured data, and the table annotations in the knowledge base; and determine answers to questions using the knowledge base.

Abstract: A file storage application that processes file operations is communicably connected with a block storage application that processes block operations by establishing multiple communication sessions between the file storage application and the block storage application. Multiple logical volumes provided by the block storage application are exposed to the file storage application over the multiple communication sessions established between the file storage application and the block storage application using a total number of logical paths to the logical volumes that is equivalent to the total number of the logical volumes provided by the block storage application to the file storage application.

Abstract: Provided are a feedback method and apparatus based on an online document comment, and a non-transitory computer-readable storage medium. The feedback method based on an online document comment includes receiving comment push information sent by a server, where the comment push information is generated by the server according to a comment feedback addition request sent by a terminal and includes a document identifier, a comment identifier, and a comment feedback type; determining a first target document matching the document identifier and determining a first comment matching the comment identifier in the first target document; and acquiring comment feedback matching the comment feedback type and adding the comment feedback in a comment feedback display region matching the first comment.

Abstract: In a computer-implemented method for querying a variably partitioned time series database, a query of a time series database is received, the query including a time range and a predicate comprising at least one dimension, wherein the time series database comprises a plurality of time series database schemas. At least one time series database schema of the time series database corresponding to the time range is determined. The query is divided into a plurality of sub-queries, wherein each sub-query of the plurality of sub-queries corresponds to one time series database schema of the plurality of time series database schemas. The plurality of sub-queries is executed to return a plurality of results.

Abstract: Techniques and solutions are described for copying data from a source client to a target client. It may be selected, such as by a user, whether a full copy or a partial copy of a set of source client data should be made. If a partial copy is selected, a set of file types is provided. The file types can be used to define files that should be included in, or excluded from, the copy. A data source of the source client is analyzed to determine data associated with a file type that is to be included in a copy, or is associated with a file type that is not indicated as to be excluded from the copy. The determined data is copied from the source client to the target client.

Abstract: A computer device receives a request to search a corpus of documents for an entity, wherein the request includes a non-name identifier of the entity. The computing device identifies entries of text within the corpus of documents that reference the non-name identifier. The computing device applies natural language processing (NLP) to content associated with the identified entries within the corpus of documents, wherein the NLP identifies candidate entities associated with the non-name identifier. The computing device selects an entity from the candidate entities based, at least in part, on distances between the candidate entities and references to the non-name identifier in the identified entries. The computing device returns the selected entity to a submitter of the request.

Abstract: A technique relates to natural language automation to implement service requests. An intent of a service request is determined by accessing a knowledge base, the knowledge base being configured for dynamic discovery of dependencies related to configuration items, the configuration item being among the configuration items, the configuration items being associated with concepts. An intent application programming interface (API) database comprising a specification is accessed, the specification describing parameters of APIs and associations that the APIs have with the concepts of the knowledge base. Associated parameters of an API associated with the intent of the service request are determined based on the intent API database. The API is caused to be executed to accomplish the service request.

Abstract: Systems, apparatus, methods, and articles of manufacture provide for generation, execution, and visualization of data queries (e.g., SQL statements) and their results, based on natural language input from a user. In one example implementation, a dashboard system provides a voting lounge and personalized and crowdsourced dashboards.

Abstract: Some embodiments may include a process for determining a type of snapshot to be stored using a data storage system. An example the process comprises identifying a snapshot chain for a first virtual machine, determining whether the snapshot chain includes a dependent base file, determining a maximum incremental chain length for the snapshot chain based on whether the snapshot chain includes a dependent base file, or based on an age of the backed up versions within the snapshot chain, determining whether a new snapshot chain should be created based on the maximum incremental chain length, and determining a type of snapshot to be stored for the first virtual machine based on the maximum incremental chain length.

Abstract: Disclosed herein are methods, systems, and processes for source side classification of five and active data. Operating system calls associated with files being accessed or files recently accessed by an endpoint computing device are intercepted. A list including the files is generated and sent to a server computing device. A confirmation is received that a request to classify the files has been received from the server computing device.

Abstract: A system includes reception of a database query, determination of result set output columns associated with the database query, and determination, for each of the determined result set output columns, of one or more data sources associated with the result set output column. Sensitivity information is determined for each of the one or more data sources based on metadata, and result set sensitivity information is determined based on the determined sensitivity information. A result set is determined based on the database query, and the result set and the result set sensitivity information are transmitted.

Abstract: Systems and methods are provided for generating new insights for multi-dimensional data. A plurality of insight definitions that define insights within multi-dimensional data can be received, where the multi-dimensional data include dimensions organized in a hierarchical structure, and the insight definitions include members across the hierarchical dimensions that define a slice of the multi-dimensional data. Descriptive data about a candidate insight defined by at least one of the insight definitions that corresponds to a candidate slice of the multi-dimensional data can be received. A new insight definition based on the candidate insight can be generated, where the new insight definition corresponds to a new slice of the multi-dimensional data, and the new slice of the multi-dimensional data is proximate to the candidate slice of the multi-dimensional data with respect to the hierarchical structure.

Abstract: the present disclosure relates to systems, methods, and computer-readable media for optimizing and implementing operator trees based on a received query. For example, systems disclosed herein may generate an operator tree based on a received query. The systems described herein may systematically analyze the impact of bitvector filters in optimizing a join order of the operator tree to generate an optimized operator tree. The systems described herein may further implement the bit-vector aware operator tree by providing the optimized operator tree to an execution engine for further processing.

Abstract: A server, method, and non-transitory computer readable medium for classifying queries based on contextual information are provided. The server includes a network interface, a memory storage unit and a processor. The method involves receiving a plurality of queries, analyzing the queries and determining a likelihood divergence and selecting a domain. The non-transitory computer readable medium is encoded with programming instructions to direct a processor to carry out the method.

Abstract: The present disclosure involves systems, software, and computer implemented methods for automatically detecting hot areas in heat map visualizations. One example method includes identifying a two-dimensional heat map. The identified two-dimensional heat map is converted to a one-dimensional heat map. Cells of the one-dimensional heat map are clustered using a density-based clustering algorithm to generate at least one dense region of cells. A mean value of cells in each dense region is calculated and the dense regions are sorted by mean value in descending order. An approach for identifying hot areas is selected and the selected approach is used to identify at least one dense region as a hot area of the one-dimensional heat map.

Abstract: This disclosure is directed to systems and methods for generating a communication associated with an optimization code. Generating a communication may include generating an optimization code, which may include (i) receiving a first data associated with one or more of a first computing device and a first computing device user; (ii) generating at least two confirmation codes, including one or more of a verification code, a consistency code, and an activity code; and (iii) generating an optimization code which may be based, at least in part, on the at least two confirmation codes.

Abstract: Techniques are described herein for subquery removal given two set operation-based subqueries in a query, where one subquery contains the result of the other. The described optimization technique of subquery removal is enabled by join and set operation-based containment of the set operation-based subqueries where semantic equivalence can be established for a given pair of set operation-based subqueries when some table(s)—with associated join condition(s), correlation condition(s), and/or filter predicate(s)—in one subquery are not considered. Subquery removal reduces multiple access to the same table and multiple evaluations of the same join conditions required to evaluate the query. When a subquery is removed from a disjunction, this may lead to other optimizations such as subquery unnesting, e.g., when the original query configuration would not permit query unnesting and the rewritten query (with one or more removed subqueries) permits unnesting.

Abstract: Techniques are disclosed relating to building an in-memory multi-level data structure useable to determine presence or absence of key ranges in files consisting of database records. In various embodiments, a computer system operates a database, including maintaining a set of records having a set of corresponding keys that are accessible in key-sorted order and generates a multi-level data structure that facilitates key range lookups against the set of records. The generating may include accessing ones of the set of keys in key-sorted order and determining, for a particular accessed key that includes a set of characters, an intermediate level within the multi-level data structure and a subset of the characters of the particular accessed key for insertion. The computer system may insert, starting at the intermediate level, information that identifies the subset of characters, with the inserting being performed without traversing any levels before the intermediate level.

Abstract: A method, apparatus, system, and computer program code for retrieving data records. A set of static configuration objects is provided, including: a set of resources that describe available data items, and a set of views that express a serialized transformation of resources objects into a response. In response to receiving a data request, a computer system generates a data fetch execution plan from the set of resources and the set of views. The data fetch execution plan is generated using an executor adapted to a particular data store and set of performance requirements. The computer system retrieves the data records according to the data fetch execution plan.

Abstract: The disclosed implementations include a method performed by a data intake and query system. The method includes receiving a search query at a search head, the search query including a branching operation between sets of data, generating a first subquery and a second subquery corresponding to the sets of data for execution by a search node, generating instructions for an intermediary node to combine partial results of the first subquery and the second subquery and instructions to concurrently communicate the subqueries to a search node, and executing the query by providing the instructions for the intermediary node to the intermediary node and the subqueries to the search node, the intermediary node receiving sets of partial search results for the subqueries, performing at least a portion of the branching operation on the partial results, and communicating the combined results to another intermediary node or the search head.