Abstract: Using a first unique identifier of a local file on a client machine associated with a second unique identifier of a content item maintained at a content management system repository, synchronization of the local file and the content item can be restored after a synchronization break.

Abstract: An online system may generate numerous search records in response to searches requested by users. The online system may use a specific way to sample the historical search records to reduce biases in sampling. For example, the online system retrieves historical query records associated with an item query engine. The set of historical query records includes a plurality of search phrases. A historical query record is associated with a search phrase and a list of items returned by the item query engine. The online system determines the search frequencies for the search phrases. The online system stratifies the historical query records into a plurality of bins according to the search frequencies of the search phrases. The online system samples the historical query records from the plurality of bins to collect a representative set of historical query records and outputs the representative set of historical query records for rating.

Abstract: Techniques and solutions are described for providing flexible access to data during execution of a data access request. Multiple instances of a data artifact are created, where different instances of the data artifact provide access to different data sources having data associated with the data access request. When a data access request is executed, a particular data artifact instance can be used during execution of the data access request. In some cases, switching logic can be used to determine which data artifact instance is to be used in executing the data access request. Also described are technologies for facilitating creation of data artifact instances corresponding to a modelling artifact.

Abstract: Methods and systems are disclosed herein for updating a knowledge graph based on a user confirmation. A media guidance application receives a user communication and isolates a term of the user communication. The media guidance application identifies a candidate component of a knowledge graph associated with the term. The media guidance application requests user input directed to confirming whether the term is associated with the candidate component. In response to receiving the user input, the media guidance application modifies a strength of association between the term and the component.

Abstract: Various systems, methods, and computer program products are provided for optimizing database querying. The method includes receiving a search request to perform a search operation associated with a database. The search request includes one or more search values. The method also includes identifying one or more search columns of the database based on at least one of the one or more search values. The identification of the one or more search columns includes comparing the at least one of the one or more search values with a reference matrix. The reference matrix relates to contents of the database. The method further includes updating the search request based on the one or more search columns identified. The method still further includes causing a transmission of the updated search request for performance of the search operation.

Abstract: In some embodiments, the present disclosure provides an exemplary method that may include steps of receiving input data from at least one external data aggregator; utilizing a trained machine learning algorithm to generate a database of known queries; receiving subsequent input data from the at least one external aggregator; automatically updating the database of known queries associated with the plurality of users; utilizing the trained machine learning algorithm to perform a cross-reference analysis to determine a presence of a data record within the database of known queries; dynamically removing the data record from the database of known queries; utilizing the trained machine learning algorithm to predict a trigger associated with the presence of the at least one data record; and instructing a computing device to initiate a verification of the presence of the at least one data record.

Abstract: Techniques are described for executing machine learning models trained for specific operators with feature values that are based on the actual execution of a workload set. The machine learning models generate an estimate of benefit gain/cost for executing operations on data portions in the alternative encoding format. Such data potions may be sorted based on the estimated benefit, in an embodiment. Using cost estimation machine learning models for memory space, the data portions with the most benefits that comply with the existing memory space constraints are recommended and/or are automatically encoded into the alternative encoding format.

Abstract: A machine reading comprehension system (MRCS) can analyze a larger-sized document that includes multiple pages to predict an answer to a query. For example, the document can have two, five, tens, or hundreds of pages. The MRCS divides the document into multiple sections with each section including a portion of the document. Each section is processed separately by one or more processing circuitries to determine a score for that section. The score indicates how related the section is to the query and/or a probability that the section provides a possible answer to the query. Once all of the sections have been analyzed, the sections are ranked by their scores and a subset of the ranked sections are processed again to determine a predicted answer to the query.

Abstract: Provided is a data query method, applied to a heterogeneous acceleration platform. The data query method includes: determining operators in a database management system, and accomplishing, in a parallel processor, functions corresponding to the operators (S101); if an SQL query statement is received, converting, by using a CPU, the where clause in the SQL query statement into a data structure including a binary tree and a linked list (S102); controlling the CPU to generate an operation code stream of the data structure according to node information (S103); and performing, by using the parallel processor, a screening operation corresponding to the operation code stream on records in the database management system to obtain a query result conforming to the where clause (S104).

Abstract: A node of a database system is operable to receive a plurality of data blocks. Based on backlog detection data, at least one feedback data block is generated to be sent to the set of source nodes. Feedback relay node selection data selecting at least one of the plurality of nodes in the database system for facilitating routing of the at least one feedback data block from the node to at least one of the set of source nodes via a prioritized feedback communication mechanism is generated. The at least one feedback data block is sent to the at least one of the plurality of nodes selected in the feedback relay node selection data. The at least one of the plurality of nodes facilitates routing of the at least one feedback data block from the node via the prioritized feedback communication mechanism.

Abstract: System and methods for configuring a technical system based on generated rules and building the technical system. The technical system and the generated rules are given in graph representations including the following steps: defining rules by a user and representing the rules in a graphical interface, converting the rules from the graphical interface into a programming language and/or a natural language, validating the rules for the technical system, checking the compatibility of the rules, serializing the rules for storage in a file system or a database, using the serialized rules to configure the technical system, and building the configured technical system.

Abstract: A method for execution by one or more processing modules of one or more computing devices of a storage network, the method comprises receiving a data object for processing, determining whether the data object is to be transferred to one or more remote storage location, determining whether one or more legal restrictions are associated with the data object. Based on a determination that one or more legal restrictions are associated with the data object, the method continues by determining whether the one or more legal restrictions allow transfer of the data object to a storage unit of the one or more remote storage locations. The method continues by segmenting the data object into a plurality of data segments, dispersed error encoding a data segment of the plurality of data segments in accordance with dispersed error encoding parameters to produce a set of encoded data slice and transmitting a write requests for an encoded data slice of the set of encoded data slices to the storage location for processing.

Abstract: A data query for data is received that is associated with a first data node managed by a first executable service and a second data node managed by a second executable service. The data query comprises a subquery that is directed to the second executable service for access to the second data node. From the data query, a selection set is determined. The selection set includes the first data node and the second data node. In view of the selection set, a batch access request is generated to the second executable service that retrieves data for the subquery from the second data node in a single access request.

Abstract: Systems, methods, and devices for retrying a query. A method includes receiving a query directed to database data and assigning execution of the query to one or more execution nodes of an execution platform, the one or more execution nodes configured to execute the query on a first version of a database platform. The method includes determining that execution of the query was unsuccessful. The method includes assigning a first retry execution of the query to the one or more execution nodes of the execution platform and determining whether a regression or an intermittent fault caused the execution of the query to be unsuccessful based at least in part on whether the first retry execution of the query was successful or unsuccessful.

Abstract: The present disclosure provides systems and methods for an interactive user interface that allows for one or more submissions of update information related to a point of interest to be reviewed. The system may receive the submission from a computing device. The system may analyze the submission to determine the type of content, such as the name, address, website, photo, etc. related to the point of interest. The type of content may be classified using a machine learning model. The model may compare the content of the submission to a model of the type of content to determine whether the submission is approved for publishing or whether additional information is needed. The system may transmit one or more notifications to the computing device. The notifications may include updates on the workflow status of the submission.

Abstract: A method, apparatus, and system for join operations of a plurality of relations that are distributed over a plurality of storage locations over a network of computing components.

Abstract: Systems and methods of the disclosure include: submitting, by a processing device, a plurality of queries to a database associated with an application, wherein each query of the plurality of queries comprises a request for one or more records from the database; determining a period of time for executing each query of the plurality of queries; and executing each query of the plurality of queries, wherein executing each query comprises returning a set of portions of the one or more records within the period of time.

Abstract: Systems, methods, and devices are described for performing scalable data processing operations. A queue that includes a translatable portion comprising indications of data processing operations translatable to data queries and a non-translatable portion comprising indications of non-translatable data processing operations is maintained. A determination that a first data processing operation of a first code block statement is translatable to a database query is made. An indication of the first data processing operation is included in the translatable portion of the queue. Responsive to a determination that a second data processing operation of a second code block statement is undeferrable, the translatable portion of the queue is compiled into a database query. An execution of the database query to be executed by a database engine to generate a query result is caused. A result dataset corresponding to the query result is transmitted to an application configured to analyze the result dataset.

Abstract: Disclosed are various embodiments for dynamically generating a search set for use in a search application, such as a search engine, and using the search set to navigate collections of archived content. A request for user interface data is received from a client device in response to the client device attempting to access a domain. The domain may be parsed to identify a search category corresponding to one of the categories stored in a data store. Subcategories and search collections that are associated with the search category are identified and user interface data may be generated that cause at least a portion of the subcategories and search collections associated with a search component to be rendered in a display of the client device. The search component is configured to use a selected one of the at least a portion of the subcategories to narrow a search conducted using the search component by generating a narrowing search query.

Abstract: A content retrieval system uses a graph neural network architecture to determine images relevant to an image designated in a query. The graph neural network learns a new descriptor space that can be used to map images in the repository to image descriptors and the query image to a query descriptor. The image descriptors characterize the images in the repository as vectors in the descriptor space, and the query descriptor characterizes the query image as a vector in the descriptor space. The content retrieval system obtains the query result by identifying a set of relevant images associated with image descriptors having above a similarity threshold with the query descriptor.